Skip to content

A data driven similarity measure and example mapping function for general, unlabelled data sets

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Deep networks such as autoencoders and deep belief nets are able to construct alternative, and often informative, representations of unlabeled data by searching for (hidden) structure and correlations between the features chosen to represent the data and combining them into new features that allow sparse representations of the data. These representations have been chosen to often increase the accuracy of further classification or regression accuracy when compared to the original, often human chosen representations. In this work, we attempt an investigation of the relation between such discovered representations found using related but differently represented sets of examples. To this end, we combine the cross-domain comparison capabilities of unsupervised manifold alignment with the unsupervised feature construction of deep belief nets, resulting in an example mapping function that allows re-encoding examples from any source to any target task. Using the t-Distributed Stochastic Neighbour Embedding technique to map translated and real examples to a lower dimensional space, we employ KL-divergence to define a dissimilarity measure between data sets enabling us to measure found representation similarities between domains.

Cite

CITATION STYLE

APA

Lejeune, D., & Driessens, K. (2016). A data driven similarity measure and example mapping function for general, unlabelled data sets. In Frontiers in Artificial Intelligence and Applications (Vol. 285, pp. 158–166). IOS Press. https://doi.org/10.3233/978-1-61499-672-9-158

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free