Proceedings

Angular Decomposition

Dengdi Sun, Chris H. Q. Ding, Bin Luo, Jin Tang

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1505-1509.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-253

Abstract

Dimensionality reduction plays a vital role in pattern recognition. However, for normalized vector data, existing methods do not utilize the fact that the data is normalized. In this paper, we propose to employ an Angular Decomposition of the normalized vector data which corresponds to embedding them on a unit surface. On graph data for similarity/kernel matrices with constant diagonal elements, we propose the Angular Decomposition of the similarity matrices which corresponds to embedding objects on a unit sphere. In these angular embeddings, the Euclidean distance is equivalent to the cosine similarity. Thus data structures best described in the cosine similarity and data structures best captured by the Euclidean distance can both be effectively detected in our angular embedding. We provide the theoretical analysis, derive the computational algorithm, and evaluate the angular embedding on several datasets. Experiments on data clustering demonstrate that our method can provide a more discriminative subspace.

Dengdi Sun, Chris H. Q. Ding, Bin Luo, and Jin Tang. 2011. Angular Decomposition. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1505–1509. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-253
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards