In search of optimal clusters using genetic algorithms
Pattern Recognition Letters
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Why so many clustering algorithms: a position paper
ACM SIGKDD Explorations Newsletter
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distributed Data Mining in Credit Card Fraud Detection
IEEE Intelligent Systems
Clustering with Instance-level Constraints
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
ROCK: A Robust Clustering Algorithm for Categorical Attributes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Proceedings of the 2004 ACM symposium on Applied computing
A novel genetic algorithm for automatic clustering
Pattern Recognition Letters
Content-based multimedia information retrieval: State of the art and challenges
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
ST-DBSCAN: An algorithm for clustering spatial-temporal data
Data & Knowledge Engineering
A tabu search approach for the minimum sum-of-squares clustering problem
Information Sciences: an International Journal
Introduction to Information Retrieval
Introduction to Information Retrieval
Clustering high dimensional data: A graph-based relaxed optimization approach
Information Sciences: an International Journal
A simple and fast algorithm for K-medoids clustering
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
Nearest neighbor pattern classification
IEEE Transactions on Information Theory
Minimum spanning tree based split-and-merge: A hierarchical clustering method
Information Sciences: an International Journal
Improving feature space based image segmentation via density modification
Information Sciences: an International Journal
Integration of particle swarm optimization and genetic algorithm for dynamic clustering
Information Sciences: an International Journal
Optimal clustering in the context of overlapping cluster analysis
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Clustering construction on a multimodal probability model
Information Sciences: an International Journal
Uncovering overlapping cluster structures via stochastic competitive learning
Information Sciences: an International Journal
| Hi-index | 0.07 |
Identifying clusters of arbitrary shapes remains a challenge in the field of data clustering. We propose a new measure of cluster quality based on minimizing the penalty of disconnection between objects that would be ideally clustered together. This disconnectivity is based on analysis of nearest neighbors and the principle that an object should be in the same cluster as its nearest neighbors. An algorithm called MinDisconnect is proposed that heuristically minimizes disconnectivity and numerical results are presented that indicate that the new algorithm can effectively identify clusters of complex shapes and is robust in finding clusters of arbitrary shapes.