Computer Science – Learning
Scientific paper
2011-12-22
Computer Science
Learning
To appear in the proceedings of NIPS 2011, 14 pages
Scientific paper
We consider the problem of classification using similarity/distance functions over data. Specifically, we propose a framework for defining the goodness of a (dis)similarity function with respect to a given learning task and propose algorithms that have guaranteed generalization properties when working with such good functions. Our framework unifies and generalizes the frameworks proposed by [Balcan-Blum ICML 2006] and [Wang et al ICML 2007]. An attractive feature of our framework is its adaptability to data - we do not promote a fixed notion of goodness but rather let data dictate it. We show, by giving theoretical guarantees that the goodness criterion best suited to a problem can itself be learned which makes our approach applicable to a variety of domains and problems. We propose a landmarking-based approach to obtaining a classifier from such learned goodness criteria. We then provide a novel diversity based heuristic to perform task-driven selection of landmark points instead of random selection. We demonstrate the effectiveness of our goodness criteria learning method as well as the landmark selection heuristic on a variety of similarity-based learning datasets and benchmark UCI datasets on which our method consistently outperforms existing approaches by a significant margin.
Jain Prateek
Kar Purushottam
No associations
LandOfFree
Similarity-based Learning via Data Driven Embeddings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Similarity-based Learning via Data Driven Embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-based Learning via Data Driven Embeddings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-308190