Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 829

The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.

A min-max cut algorithm for graph partitioning and data clustering

Ding, C.H.Q., Xiaofeng He, Hongyuan Zha, Ming Gu, Simon, H.D.·2002·Proceedings 2001 IEEE International Conference on Data Mining

Abstract

An important application of graph partitioning is data clustering using a graph model - the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. In this paper, we propose a new algorithm for graph partitioning with an objective function that follows the min-max clustering principle. The relaxed version of the optimization of the min-max cut objective function leads to the Fiedler vector in spectral graph partitioning. Theoretical analyses of min-max cut indicate that it leads to balanced partitions, and lower bounds are derived. The min-max cut algorithm is tested on newsgroup data sets and is found to out-perform other current popular partitioning/clustering methods. The linkage-based refinements to the algorithm further improve the quality of clustering substantially. We also demonstrate that a linearized search order based on linkage differential is better than that based on the Fiedler vector, providing another effective partitioning method.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icdm.2001.989507

Cites

16 of 16 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 16 references

Cited by

See all 829

Metadata

Authors
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D.
Venue
Proceedings 2001 IEEE International Conference on Data Mining
Published
2002-11-14
Pages
107-114
ISSN
1550-4786 (ISSN-L)
OpenAlex
W2134737843
Cited by
829
References
16
FWCI
15.22
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: A min-max cut algorithm for graph partitioning and data clustering. https://app.cochat.ai/papers/10.1109/icdm.2001.989507
The paper
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2002). A min-max cut algorithm for graph partitioning and data clustering. Proceedings 2001 IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2001.989507

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.