By Topic

Transfer clustering via constraints generated from topics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Litao Yu ; Institute of Systems Engineering, Dalian University of Technology, 116023, China ; Yanzhong Dang ; Guangfei Yang

Clustering technique is widely used in data mining like gene-microarray analysis and natural language processing. When there are sufficient data samples and good representations, traditional clustering algorithms such as K-means can work well. But when the number of samples is small and the data representation is bad, direct use of clustering may yield bad results. In this paper we propose a new algorithm TCTC(Topic-Constraint Transfer Clustering), which is an instance of unsupervised transfer learning, to cluster a small number of unlabeled data with the help of sufficient and better represented auxiliary data. First several latent topics are extracted from the clusters of the auxiliary data. Then the affinities between target data samples and topics are discovered to “guide” the disseminated data clustering. Finally semi-supervised clustering algorithm is applied on target data. The experiments demonstrate our method is quite effective to solve the problem of disseminated and ill-presented data clustering.

Published in:

2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC)

Date of Conference:

14-17 Oct. 2012