loading...
Learning Wormholes for Sparsely Labelled Clustering
Hong Kong August 20-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.75718th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eng-Jon Ong, University of Surrey, Guidlford, Surrey, UK
Richard Bowden, University of Surrey, Guidlford, Surrey, UK
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance function using available training data. Many existing distance functions is the requirement for data to exist in a space of constant dimensionality and not possible to be directly used on symbolic data. To address these problems, this paper introduces an alternative learnable distance function, based on multi-kernel distance bases or wormholes that connects spaces belonging to similar examples that were originally far away close together. This work only assumes the availability of a set data in the form of relative comparisons, avoiding the need for having labelled or quantitative information. To learn the distance function, two algorithms were proposed: 1) Building a set of basic wormhole bases using a Boosting-inspired algorithm. 2) Merging different distance bases together for better generalisation. The learning algorithms were then shown to successfully extract suitable distance functions in various clustering problems, ranging from synthetic 2D data to symbolic representations of unlabelled images.
Citation:
Eng-Jon Ong, Richard Bowden, "Learning Wormholes for Sparsely Labelled Clustering," icpr, vol. 1, pp.916-919, 18th International Conference on Pattern Recognition (ICPR'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.