A Short Survey on Data Clustering Algorithms

November 25, 2015 ยท The Cartographer ยท ๐Ÿ› 2015 Second International Conference on Soft Computing and Machine Intelligence (ISCMI)

๐Ÿ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper โ€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: A Short Survey on Data Clustering Algorithms"

Evidence collected by the PWNC Scanner

Authors Ka-Chun Wong arXiv ID 1511.09123 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CV, cs.LG, stat.CO, stat.ML Citations 55 Venue 2015 Second International Conference on Soft Computing and Machine Intelligence (ISCMI) Last Checked 23 hours ago
Abstract
With rapidly increasing data, clustering algorithms are important tools for data analytics in modern research. They have been successfully applied to a wide range of domains; for instance, bioinformatics, speech recognition, and financial analysis. Formally speaking, given a set of data instances, a clustering algorithm is expected to divide the set of data instances into the subsets which maximize the intra-subset similarity and inter-subset dissimilarity, where a similarity measure is defined beforehand. In this work, the state-of-the-arts clustering algorithms are reviewed from design concept to methodology; Different clustering paradigms are discussed. Advanced clustering algorithms are also discussed. After that, the existing clustering evaluation metrics are reviewed. A summary with future insights is provided at the end.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Data Structures & Algorithms