Squeezer: An efficient algorithm for clustering categorical data.

DOI10.1007/BF02948829MaRDI QIDQ1850693zbMATH OpenFDO

Authors Zengyou He, Xiao-Fei Xu, Shengchun Deng

Publication date 2002

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02948829

zbMATH Keywords

data miningdata stream

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1700386
• A hierarchical clustering algorithm for categorical sequence data
• A novel attribute weighting algorithm for clustering high-dimensional categorical data
• Optimal algorithm of data streams clustering on sliding window model
• Cure: An efficient clustering algorithm for large databases

Cites work

• Cure: An efficient clustering algorithm for large databases
• Two-phase clustering process for outliers detection

Cited in

(3)

• Three-way space structure and clustering of categorical data
• An equi-biased k-prototypes algorithm for clustering mixed-type data
• Improving CLOPE's profit value and stability with an optimized agglomerative approach

Describes a project that uses

Uses Software

• ROCK
• UCI

This page was built for publication: Squeezer: An efficient algorithm for clustering categorical data.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850693)