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

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

Clustering through decision tree construction

Open access
Liu, Bing, Xia, Yiyuan, Yu, Philip S. · 2000 · Proceedings of the ninth international conference on Information and knowledge management

Abstract

Clustering aims to find the intrinsic structure of data by organizing data objects into similarity groups or clusters.It is often called unsupervised learning as no class labels denoting an a priori partition of the objects are given.This is in contrast with supervised learning (e.g., classification) for which the data objects are already labeled with known classes.Past research in clustering has produced many algorithms.However, these algorithms have some major shortcomings.In this paper, we propose a novel clustering technique, which is based on a supervised learning technique called decision tree construction.The new technique is able to overcome many of these shortcomings.The key idea is to use a decision tree to partition the data space into cluster and empty (sparse) regions at different levels of details.The technique is able to find "natural" clusters in large high dimensional spaces efficiently.It is suitable for clustering in the full dimensional space as well as in subspaces.It also provides comprehensible descriptions of clusters.Experiment results on both synthetic data and real-life data show that the technique is effective and also scales well for large high dimensional datasets.

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.

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

Integrity signals

Registry

Crossref · 10.1145/354756.354775

Cites

1 of 1 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.

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.

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

  • When Is ''Nearest Neighbor'' Meaningful?

    Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403 · cited 2×

    “As a consequence, the difference between the distance to the nearest and the farthest neighbor of a data point goes to zero [6].”
    Background

Cited by

See all 225

Metadata

Authors
Liu, B., Xia, Y., & Yu, P. S.
Venue
Proceedings of the ninth international conference on Information and knowledge management
Publisher
ACM
Published
2000-11-06
Pages
20-29
OpenAlex
W2072343647
Cited by
225
References
1
FWCI
3.10
Type
conference paper
Language
en
Open access
bronze

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.