Scalable Clustering Algorithms with Balancing Constraints
- 26 May 2006
- journal article
- Published by Springer Science and Business Media LLC in Data Mining and Knowledge Discovery
- Vol. 13 (3), 365-395
- https://doi.org/10.1007/s10618-006-0040-z
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Y-means: a clustering method for intrusion detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Frequency-Sensitive Competitive Learning for Scalable Balanced Clustering on High-Dimensional HyperspheresIEEE Transactions on Neural Networks, 2004
- Clustering with Bregman DivergencesPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- Optimal Energy Aware Clustering in Sensor NetworksSensors, 2002
- Elements of Information TheoryPublished by Wiley ,2001
- Detecting Seasonal Trends and Cluster Motion Visualization for Very High Dimensional Transactional DataPublished by Society for Industrial & Applied Mathematics (SIAM) ,2001
- Cure: an efficient clustering algorithm for large databasesInformation Systems, 2001
- Concept Decompositions for Large Sparse Text Data Using ClusteringMachine Learning, 2001
- Scatter/Gather: a cluster-based approach to browsing large document collectionsPublished by Association for Computing Machinery (ACM) ,1992
- Competitive learning algorithms for vector quantizationNeural Networks, 1990