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

The DOI matches its Crossref record.

Minimum Spanning Tree Based Clustering Algorithms

Grygorash, Oleksandr, Zhou, Yan, Jorgensen, Zach·2006·2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)

Abstract

The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In this paper, we propose two minimum spanning tree based clustering algorithms. The first algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of the point set and removes edges that satisfy a predefined criterion. The process is repeated until k clusters are produced. The second algorithm partitions a point set into a group of clusters by maximizing the overall standard deviation reduction, without a given k value. We present our experimental results comparing our proposed algorithms to k-means and EM. We also apply our algorithms to image color clustering and compare our algorithms to the standard minimum spanning tree clustering algorithm

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/ictai.2006.83

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.

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

Cited by

See all 212

Metadata

Authors
Grygorash, O., Zhou, Y., & Jorgensen, Z.
Venue
2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)
Publisher
IEEE
Published
2006-11
Pages
73-81
ISSN
1082-3409 (ISSN-L)
OpenAlex
W1976496412
Cited by
212
References
0
FWCI
2.64
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: Minimum Spanning Tree Based Clustering Algorithms. https://app.cochat.ai/papers/10.1109/ictai.2006.83
The paper
Grygorash, O., Zhou, Y., & Jorgensen, Z. (2006). Minimum Spanning Tree Based Clustering Algorithms. 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06). https://doi.org/10.1109/ictai.2006.83

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.