BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimization of constrained frequent set queries with 2-variable constraints
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques
Data mining: concepts and techniques
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
Constraint-based clustering in large databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
STING: A Statistical Information Grid Approach to Spatial Data Mining
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Constraint-based clustering in large databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
On Data Clustering Analysis: Scalability, Constraints, and Validation
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Model-based Clustering with Soft Balancing
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
ItCompress: An Iterative Semantic Compression Algorithm
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Leveraging aggregate constraints for deduplication
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A Particle Swarm Optimization Method for Spatial Clustering with Obstacles Constraints
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Semi-supervised constrained clustering: an expert-guided data analysis methodology
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Record linkage with uniqueness constraints and erroneous values
Proceedings of the VLDB Endowment
Integrating data mining with KJ method to classify bridge construction defects
Expert Systems with Applications: An International Journal
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
A modified Cop-Kmeans algorithm based on sequenced cannot-link set
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
On approximate balanced bi-clustering
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A density-based spatial clustering for physical constraints
Journal of Intelligent Information Systems
Towards an ontology-based spatial clustering framework
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
A novel spatial clustering with obstacles constraints based on PNPSO and k-medoids
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Constrained clustering using SAT
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
| Hi-index | 0.00 |
Constrained clustering--finding clusters that satisfy user-specified constraints--is highly desirable in many applications. In this paper, we introduce the constrained clustering problem and show that traditional clustering algorithms (e.g., k-means) cannot handle it. A scalable constraint-clustering algorithm is developed in this study which starts by finding an initial solution that satisfies user-specified constraints and then refines the solution by performing confined object movements under constraints. Our algorithm consists of two phases: pivot movement and deadlock resolution. For both phases, we show that finding the optimal solution is NP-hard. We then propose several heuristics and show how our algorithm can scale up for large data sets using the heuristic of micro-cluster sharing. By experiments, we show the effectiveness and efficiency of the heuristics.