2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2 Constrained Minimum Cut for Classification Using Labeled and Unlabeled Data Kauai, Hawaii December 08-December 14 ISBN: 0-7695-1272-0
The use of unlabeled data has leads to improvement in classification accuracy for a variety of classification problems via co-training approaches. In the co-training approach, the data has to be available in a dual view representation or two distinct classifiers are required. In this paper, an unified energy equation for classification combining labeled data and unlabeled data is introduced. This classification formulation is posed as a constrained minimum cut problem integrating labeling information on labeled data and cluster similarity information on unlabeled data for joint estimation. A novel constrained randomized contraction algorithm is proposed for finding the solution to the constrained minimum cuts problem. Experimental results on standard datasets and synthetic datasets are presented.
Citation:
C.H. Li, "Constrained Minimum Cut for Classification Using Labeled and Unlabeled Data," cvpr, vol. 2, pp.597, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2, 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||