<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-22T19:20:22Z</responseDate><request verb="GetRecord" identifier="oai:ruor.uottawa.ca:10393/34320" metadataPrefix="dim">https://ruor.uottawa.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:ruor.uottawa.ca:10393/34320</identifier><datestamp>2024-02-23T08:54:17Z</datestamp><setSpec>com_10393_242</setSpec><setSpec>col_10393_11105</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Jafer, Yasser</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="supervisor">Matwin, Stanislaw</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="supervisor">Sokolova, Marina</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-02-25T19:56:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-02-25T19:56:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="*">2016</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10393/34320</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://dx.doi.org/10.20381/ruor-5180</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A large amount of digital information collected and stored in datasets creates vast opportunities for knowledge discovery and data mining. These datasets, however, may contain sensitive information about individuals and, therefore, it is imperative to ensure that their privacy is protected. &#xd;
	Most research in the area of privacy preserving data publishing does not make any assumptions about an intended analysis task applied on the dataset. In many domains such as healthcare, finance, etc; however, it is possible to identify the analysis task beforehand. Incorporating such knowledge of the ultimate analysis task may improve the quality of the anonymized data while protecting the privacy of individuals. Furthermore, the existing research which consider the ultimate analysis task (e.g., classification) is not suitable for high-dimensional data. &#xd;
We show that automatic feature selection (which is a well-known dimensionality reduction technique) can be utilized in order to consider both aspects of privacy and utility simultaneously. In doing so, we show that feature selection can enhance existing privacy preserving techniques addressing k-anonymity and differential privacy and protect privacy while reducing the amount of modifications applied to the dataset; hence, in most of the cases achieving higher utility.&#xd;
We consider incorporating the concept of privacy-by-design within the feature selection process. We propose techniques that turn filter-based and wrapper-based feature selection into privacy-aware processes. To this end, we build a layer of privacy on top of regular feature selection process and obtain a privacy preserving feature selection that is not only guided by accuracy but also the amount of protected private information. &#xd;
In addition to considering privacy after feature selection we introduce a framework for a privacy-aware feature selection evaluation measure. That is, we incorporate privacy during feature selection and obtain a list of candidate privacy-aware attribute subsets that consider (and satisfy) both efficacy and privacy requirements simultaneously. &#xd;
Finally, we propose a multi-dimensional, privacy-aware evaluation function which incorporates efficacy, privacy, and dimensionality weights and enables the data holder to obtain a best attribute subset according to its preferences.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">Université d&amp;apos;Ottawa / University of Ottawa</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Task Oriented Privacy (TOP)</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Privacy</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Data Mining</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Data Publishing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Feature Selection</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Privacy-aware Wrappers</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Privacy-aware Filters</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Privacy-aware Evaluation Measure for Feature Selection</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Task Oriented Privacy-preserving (TOP) Technologies Using Automatic Feature Selection</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Thesis</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name" lang="en">PhD</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level" lang="en">Doctoral</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline" lang="en">Génie / Engineering</dim:field>
   <dim:field mdschema="uottawa" element="department" lang="en">Science informatique et génie électrique / Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>