Skip to Main content Skip to Navigation
Conference papers

Online and Batch Learning of Generalized Cosine Similarities

Abstract : In this paper, we define an online algorithm to learn the generalized cosine similarity measures for kNN classification and hence a similarity matrix A corresponding to a bilinear form. In contrary to the standard cosine measure, the normalization is itself dependent on the similarity matrix which makes it impossible to use directly the algorithms developed for learning Mahanalobis distances, based on positive, semi-definite (PSD) matrices. We follow the approach where we first find an appropriate matrix and then project it onto the cone of PSD matrices, which we have adapted to the particular form of generalized cosine similarities, and more particularly to the fact that such measures are normalized. The resulting online algorithm as well as its batch version is fast and has got better accuracy as compared with state-of-the-art methods on standard data sets.
Document type :
Conference papers
Complete list of metadata
Contributor : Marie-Christine Fauvet Connect in order to contact the contributor
Submitted on : Friday, February 28, 2014 - 4:02:27 PM
Last modification on : Sunday, June 26, 2022 - 9:35:02 AM


  • HAL Id : hal-00953853, version 1



Ali Mustafa Qamar, Eric Gaussier. Online and Batch Learning of Generalized Cosine Similarities. IEEE International Conference on Data Mining (ICDM), 2009, Florida, United States. pp.926-931. ⟨hal-00953853⟩



Record views