The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Bipartite graph partitioning and data clustering
Abstract
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, we propose a new data clustering method based on partitioning the underlying bipartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. We show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. We point out the connection of our clustering algorithm to correspondence analysis used in multivariate analysis. We also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, we apply our clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Modern Applied Statistics with S-Plus.
Venables, W. N., & Ripley, B. D. (1996) · Biometrics · doi:10.2307/2532871 · Cited by 2,994
Correspondence Analysis in Practice
Greenacre, M. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420011234 · Cited by 2,040
Correspondence Analysis in Practice
Greenacre, M. (2017) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315369983 · Cited by 1,108
Modern Applied Statistics with S-PLUS
Venables, W. N., & Ripley, B. D. (1999) · Statistics and Computing · doi:10.1007/978-1-4757-3121-7 · Cited by 978
Cited by
Orthogonal nonnegative matrix t-factorizations for clustering
Ding, C., Li, T., Peng, W., & Park, H. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150420 · Cited by 1,245
Self-citationA min-max cut algorithm for graph partitioning and data clustering
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989507 · Cited by 829
Self-citationHierarchical Clustering Algorithms for Document Datasets
Zhao, Y., Karypis, G., & Fayyad, U. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0361-3 · Cited by 627
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Two supervised learning approaches for name disambiguation in author citations
Han, H., Giles, L., Zha, H., Li, C., & Tsioutsiouliklis, K. (2004) · Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/996350.996419 · Cited by 362
Self-citation
Metadata
- Authors
- Zha, H., He, X., Ding, C., Simon, H., & Gu, M.
- Venue
- Proceedings of the tenth international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2001-10-05
- Pages
- 25-32
- OpenAlex
- W2052819443
- Cited by
- 291
- References
- 15
- FWCI
- 6.03
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bipartite graph partitioning and data clustering. https://app.cochat.ai/papers/10.1145/502585.502591
- The paper
- Zha, H., He, X., Ding, C., Simon, H., & Gu, M. (2001). Bipartite graph partitioning and data clustering. Proceedings of the tenth international conference on Information and knowledge management. https://doi.org/10.1145/502585.502591
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.