A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
A re-examination of text categorization methods
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
ACM Computing Surveys (CSUR)
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
A probabilistic framework for semi-supervised clustering
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Boosting margin based distance functions for clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Learning with Constrained and Unlabelled Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Semi-supervised graph clustering: a kernel approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
A Framework for Semi-Supervised Learning Based on Subjective and Objective Clustering Criteria
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Semi-supervised clustering: probabilistic models, algorithms and experiments
Semi-supervised clustering: probabilistic models, algorithms and experiments
Learning a kernel function for classification with small training samples
ICML '06 Proceedings of the 23rd international conference on Machine learning
Learning Distance Metrics with Contextual Constraints for Image Retrieval
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
An efficient algorithm for local distance metric learning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Parametric distance metric learning with label information
IJCAI'03 Proceedings of the 18th international joint conference on 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
Semi-supervised visual clustering for spherical coordinates systems
Proceedings of the 2008 ACM symposium on Applied computing
Constraint projections for ensemble learning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Using knowledge driven matrix factorization to reconstruct modular gene regulatory network
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Semi-supervised clustering using similarity neural networks
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
Semi-supervised distance metric learning for collaborative image retrieval and clustering
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Clustering with feature order preferences
Intelligent Data Analysis - Artificial Intelligence
Boosting Clustering by Active Constraint Selection
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Improving constrained clustering with active query selection
Pattern Recognition
Learning from pairwise constraints by Similarity Neural Networks
Neural Networks
A multiple classifier system for classification of LIDAR remote sensing data using multi-class SVM
MCS'10 Proceedings of the 9th international conference on Multiple Classifier Systems
Semi-supervised clustering with discriminative random fields
Pattern Recognition
Semi-supervised clustering via multi-level random walk
Pattern Recognition
Hi-index | 0.00 |
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pairwise constraints. However, these studies focus on designing special clustering algorithms that can effectively exploit the pairwise constraints. We present a boosting framework for data clustering,termed as BoostCluster, that is able to iteratively improve the accuracy of any given clustering algorithm by exploiting the pairwise constraints. The key challenge in designing a boosting framework for data clustering is how to influence an arbitrary clustering algorithm with the side information since clustering algorithms by definition are unsupervised. The proposed framework addresses this problem by dynamically generating new data representations at each iteration that are, on the one hand, adapted to the clustering results at previous iterations by the given algorithm, and on the other hand consistent with the given side information. Our empirical study shows that the proposed boosting framework is effective in improving the performance of a number of popular clustering algorithms (K-means, partitional SingleLink, spectral clustering), and its performance is comparable to the state-of-the-art algorithms for data clustering with side information.