Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Integrating Declarative Knowledge in Hierarchical Clustering Tasks
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
A probabilistic framework for semi-supervised clustering
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Semi-supervised graph clustering: a kernel approach
Machine Learning
Algorithms for Fuzzy Clustering: Methods in c-Means Clustering with Applications
Algorithms for Fuzzy Clustering: Methods in c-Means Clustering with Applications
Semi-supervised Fuzzy c-Means Clustering Using Clusterwise Tolerance Based Pairwise Constraints
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
Agglomerative hierarchical clustering with constraints: theoretical and empirical results
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Hi-index | 0.00 |
This paper presents a new semi-supervised agglomerative hierarchical clustering algorithm with ward method using clusterwise tolerance. Recently, semi-supervised clustering has been remarked and studied in many research fields. In semi-supervised clustering, must-link and cannot-link called pairwise constraints are frequently used in order to improve clustering properties. First, a clusterwise tolerance based pairwise constraints is introduced in order to handle must-link and cannotlink constraints. Next, a new semi-supervised agglomerative hierarchical clustering algorithm with ward method is constructed based on above discussions. Moreover, the effectiveness of proposed algorithms is verified through numerical examples.