A global optimization method for semi-supervised clustering

Authors:
Yu Xia
Affiliations:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT
Venue:
Data Mining and Knowledge Discovery
Year:
2009

Citing 16
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Implementing the simplex method for the Optimization Subroutine Library

IBM Systems Journal
Steepest-edge simplex algorithms for linear programming

Mathematical Programming: Series A and B
A survey of constrained classification

Computational Statistics & Data Analysis
A QMR-based interior-point algorithm for solving linear programs

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Constrained K-means Clustering with Background Knowledge

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Semi-supervised Clustering by Seeding

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Clustering with Instance-level Constraints

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Clustering Large Graphs via the Singular Value Decomposition

Machine Learning
A probabilistic framework for semi-supervised clustering

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Integrating constraints and metric learning in semi-supervised 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
Learning a Mahalanobis Metric from Equivalence Constraints

The Journal of Machine Learning Research
Bayesian Feedback in Data Clustering

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval

Pattern Recognition

Semi-supervised clustering with discriminative random fields

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we adapt Tuy's concave cutting plane method to the semi-supervised clustering. We also give properties of local optimal solutions of the semi-supervised clustering. Numerical examples show that this method can give a better solution than other semi-supervised clustering algorithms do.