Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Squeezer: An efficient algorithm for clustering categorical data.

From MaRDI portal
Publication:1850693
Jump to:navigation, search

DOI10.1007/BF02948829zbMATH Open1057.68018MaRDI QIDQ1850693FDOQ1850693


Authors: Zengyou He, Xiao-Fei Xu, Shengchun Deng Edit this on Wikidata


Publication date: 2002

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





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


zbMATH Keywords

data miningdata stream


Mathematics Subject Classification ID

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


Cites Work

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


Cited In (2)

  • An equi-biased \(k\)-prototypes algorithm for clustering mixed-type data
  • Improving CLOPE's profit value and stability with an optimized agglomerative approach

Uses Software

  • UCI-ml
  • ROCK





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850693&oldid=14232252"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 11:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki