The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm

DOI10.1006/jcom.2001.0633zbMath1004.68132OpenAlexW2058312826MaRDI QIDQ1599210

R. Smith

Publication date: 5 June 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2001.0633

zbMATH Keywords

Clusteringknowledge acquisition

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A new shifting grid clustering algorithm, On clustering tree structured data with categorical nature, COMPUTATIONAL INTELLIGENCE METHODS FOR FINANCIAL TIME SERIES MODELING, UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fractional cascading. II: Applications
• Parallel clustering algorithms
• Efficient worst-case data structures for range searching
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Filtering Search: A New Approach to Query-Answering
• On distributing the clustering process
• A new approach to clustering