Proceedings

Locality-Constrained Concept Factorization

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1378-1382.

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

Abstract

Matrix factorization based techniques, such as nonnegative matrix factorization (NMF) and concept factorization (CF), have attracted great attention in dimension reduction and data clustering. Both of them are linear learning problems and lead to a sparse representation of the data. However, the sparsity obtained by these methods does not always satisfy locality conditions, thus the obtained data representation is not the best. This paper introduces a locality-constrained concept factorization method which imposes a locality constraint onto the traditional concept factorization. By requiring the concepts (basis vectors) to be as close to the original data points as possible, each data can be represented by a linear combination of only a few basis concepts. Thus our method is able to achieve sparsity and locality at the same time. We demonstrate the effectiveness of this novel algorithm through a set of evaluations on real world applications.

Haifeng Liu, Zheng Yang, and Zhaohui Wu. 2011. Locality-Constrained Concept Factorization. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1378–1382. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-233
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards