We propose a novel algorithm that we called Multi-Manifold Co-clustering (MMC). This algorithm considers the geometric structures of both the sample manifold and the feature manifold simultaneously. Specifically, multiple Laplacian graph regularization terms are constructed separately to take local invariance into account; the optimal intrinsic manifold is constructed by linearly combining multiple manifolds. We employ multi-manifold learning to approximate the intrinsic manifold using a subset of candidate manifolds, which better reflects the local geometrical structure by graph Laplacian. The candidate manifolds are obtained using various representative manifold-based dimensionality reduction methods. These selected methods are based on different rationales and use different metrics for data distances. Experimental results on several real world text data sets demonstrate the effectiveness of MMC.
CITATION STYLE
Allab, K., Labiod, L., & Nadif, M. (2015). Multi-manifold matrix tri-factorization for text data clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9489, pp. 705–715). Springer Verlag. https://doi.org/10.1007/978-3-319-26532-2_78
Mendeley helps you to discover research relevant for your work.