Local Similarity Discriminant Analysis
Abstract
We propose a local, generative model for similarity-based classification. The method is applicable to the case that only pairwise similarities between samples are available. The classifier models the local class-conditional distribution using a maximum entropy estimate and empirical moment constraints. The resulting exponential class conditionaldistributions are combined with class prior probabilities and misclassification costs to form the local similarity discriminant analysis (local SDA) classifier. We compare the performance of local SDA to a non-local version, to the local nearest centroid classifier, the nearest centroid classifier, k-NN, and to the recently-developed potential support vector machine (PSVM). Results show that local SDA is competitive with k-NN and the computationally-demanding PSVM while offering the advantages of a generative classifier.
Cite
Text
Cazzanti and Gupta. "Local Similarity Discriminant Analysis." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273514Markdown
[Cazzanti and Gupta. "Local Similarity Discriminant Analysis." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/cazzanti2007icml-local/) doi:10.1145/1273496.1273514BibTeX
@inproceedings{cazzanti2007icml-local,
title = {{Local Similarity Discriminant Analysis}},
author = {Cazzanti, Luca and Gupta, Maya R.},
booktitle = {International Conference on Machine Learning},
year = {2007},
pages = {137-144},
doi = {10.1145/1273496.1273514},
url = {https://mlanthology.org/icml/2007/cazzanti2007icml-local/}
}