Clustering analysis using manifold kernel concept factorization

Ping Li

doi:10.1016/j.neucom.2012.02.013

Return

Clustering analysis using manifold kernel concept factorization

2012-06-01

PRE

李萍 (Ping Li) *

Chun Chen

Jiajun Bu

DOI：10.1016/j.neucom.2012.02.013

Original

Original request for help

Save

Abstract

En 中文

Various exponential-growing documents and images have become omnipresent in past decades, and it is of vital importance to group them into clusters upon desired. Matrix factorization is exhibited to help yield encouraging clustering results in previous works, whereas the data manifold structure, which holds plentiful spatial model information, is not fully respected by most existing techniques. And kernel learning is advantageous for unfolding nonlinear structure. Therefore, in this paper we propose a novel clustering approach called Manifold Kernel Concept Factorization (MKCF) that incorporates the manifold kernel learning in concept factorization, which encodes the local geometrical structure in the kernel space. This method efficiently preserves the data semantic structure using graph Laplacian, and the nonlinear manifold learning in the warped RKHS potentially reflects the underlying local geometry of the data. Thus, the concepts consistent with the intrinsic manifold structure are well extracted, and this greatly benefits aggregating documents and images within the same concept into the same cluster. Extensive empirical studies demonstrate that MKCF owns the superiority of achieving the more satisfactory clustering performance as well as deriving the better-represented lower data space. (c) 2012 Elsevier B.V. All rights reserved.

Keywords:

Manifold kernel learning

Concept factorization

Graph Laplacian

Document clustering

Image clustering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.