Efficient joint clustering algorithms in optimization and geography domains

Authors:
Chia-Hao Lo;Wen-Chih Peng
Affiliations:
Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Venue:
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2008

Citing 5
Cited 1

Clustering with Instance-level Constraints

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Dual Clustering: Integrating Data Clustering over Optimization and Constraint Domains

IEEE Transactions on Knowledge and Data Engineering
Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Incremental clustering in geography and optimization spaces

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining

Clustering Data Streams in Optimization and Geography Domains

PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Prior works have elaborated on the problem of joint clustering in the optimization and geography domains. However, prior works neither clearly specify the connected constraint in the geography domain nor propose efficient algorithms. In this paper, we formulate the joint clustering problem in which a connected constraint and the number of clusters should be specified. We propose an algorithm K-means with Local Search (abbreviated as KLS) to solve the joint clustering problem with the connected constraint. Experimental results show that KLS can find correct clusters efficiently.