The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Locally Consistent Concept Factorization for Document Clustering
Abstract
Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization-based techniques, such as Nonnegative Matrix Factorization (NMF) and Concept Factorization (CF), have yielded impressive results. However, both of them effectively see only the global euclidean geometry, whereas the local manifold geometry is not fully considered. In this paper, we propose a new approach to extract the document concepts which are consistent with the manifold geometry such that each concept corresponds to a connected component. Central to our approach is a graph model which captures the local geometry of the document submanifold. Thus, we call it Locally Consistent Concept Factorization (LCCF). By using the graph Laplacian to smooth the document-to-concept mapping, LCCF can extract concepts with respect to the intrinsic manifold structure and thus documents associated with the same concept can be well clustered. The experimental results on TDT2 and Reuters-21578 have shown that the proposed approach provides a better representation and achieves better clustering results in terms of accuracy and mutual information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
(2006) · Cited by 3,624
Metagenes and molecular pattern discovery using matrix factorization
Brunet, J.-P., Tamayo, P., Golub, T. R., & Mesirov, J. P. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0308531101 · Cited by 2,183
Document clustering based on non-negative matrix factorization
Xu, W., Liu, X., & Gong, Y. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860485 · Cited by 1,860
Logothetis, N. K., & Sheinberg, D. L. (1996) · Annual Review of Neuroscience · doi:10.1146/annurev.ne.19.030196.003045 · Cited by 1,351
Kernel k-means: spectral clustering and normalized cuts
Dhillon, I. S., Guan, Y., & Kulis, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014118 · Cited by 1,193
Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering
Bengio, Y., Paiement, J.-F., Vincent, P., Delalleau, O., Roux, N. L., & Ouimet, M. (2003) · Cited by 894
(2018) · Optimization Models · doi:10.1017/cbo9781107279667.013 · Cited by 818
Document clustering using locality preserving indexing
Cai, D., He, X., & Han, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.198 · Cited by 806
Self-citationSpectral Relaxation for K-means Clustering
Hongyuan Zha, B., He, X., Ding, C. H. Q., Gu, M., & Simon, H. D. (2001) · Cited by 585
Self-citationNon-negative Matrix Factorization on Manifold
Cai, D., He, X., Wu, X., & Han, J. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.57 · Cited by 405
Self-citationAdditive versus exponentiated gradient updates for linear prediction
Kivinen, J., & Warmuth, M. K. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225121 · Cited by 223
Multiplicative Updates for Nonnegative Quadratic Programming
Sha, F., Lin, Y., Saul, L. K., & Lee, D. D. (2007) · Neural Computation · doi:10.1162/neco.2007.19.8.2004 · Cited by 173
Deterministic Column-Based Matrix Decomposition
Li, X., & Pang, Y. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.64 · Cited by 76
Cited by
Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering
Yang, B., Fu, X., Sidiropoulos, N. D., & Hong, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.04794 · Cited by 565
Graph Regularized Sparse Coding for Image Representation
Zheng, M., Bu, J., Chen, C., Wang, C., Zhang, L., Qiu, G., & Cai, D. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2090535 · Cited by 562
Self-citationDeep k-Means: Jointly clustering with k-Means and learning representations
Moradi Fard, M., Thonet, T., & Gaussier, E. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2020.07.028 · Cited by 296
Discriminatively boosted image clustering with fully convolutional auto-encoders
Li, F., Qiao, H., & Zhang, B. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.05.019 · Cited by 272
Metadata
- Authors
- Cai, D., He, X., & Han, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2011-06
- Volume
- 23
- Issue
- 6
- Pages
- 902-913
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2136635436
- Cited by
- 399
- References
- 27
- FWCI
- 11.22
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.