TY - JOUR
T1 - Linear semi-supervised projection clustering by transferred centroid regularization
AU - Tong, Bin
AU - Shao, Hao
AU - Chou, Bin Hui
AU - Suzuki, Einoshin
N1 - Funding Information:
This work is partially supported by the grant-in-aid for scientific research on fundamental research (B) 21300053 from the Japanese Ministry of Education, Culture, Sports, Science and Technology.
Publisher Copyright:
© Springer Science+Business Media, LLC 2012.
PY - 2012/10/1
Y1 - 2012/10/1
N2 - We propose a novel method, called Semi-supervised Projection Clustering in Transfer Learning (SPCTL), where multiple source domains and one target domain are assumed. Traditional semi-supervised projection clustering methods hold the assumption that the data and pairwise constraints are all drawn from the same domain. However, many related data sets with different distributions are available in real applications. The traditional methods thus can not be directly extended to such a scenario. One major challenging issue is how to exploit constraint knowledge from multiple source domains and transfer it to the target domain where all the data are unlabeled. To handle this difficulty, we are motivated to construct a common subspace where the difference in distributions among domains can be reduced. We also invent a transferred centroid regularization, which acts as a bridge to transfer the constraint knowledge to the target domain, to formulate this geometric structure formed by the centroids from different domains. Extensive experiments on both synthetic and benchmark data sets show the effectiveness of our method.
AB - We propose a novel method, called Semi-supervised Projection Clustering in Transfer Learning (SPCTL), where multiple source domains and one target domain are assumed. Traditional semi-supervised projection clustering methods hold the assumption that the data and pairwise constraints are all drawn from the same domain. However, many related data sets with different distributions are available in real applications. The traditional methods thus can not be directly extended to such a scenario. One major challenging issue is how to exploit constraint knowledge from multiple source domains and transfer it to the target domain where all the data are unlabeled. To handle this difficulty, we are motivated to construct a common subspace where the difference in distributions among domains can be reduced. We also invent a transferred centroid regularization, which acts as a bridge to transfer the constraint knowledge to the target domain, to formulate this geometric structure formed by the centroids from different domains. Extensive experiments on both synthetic and benchmark data sets show the effectiveness of our method.
UR - http://www.scopus.com/inward/record.url?scp=84857869442&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84857869442&partnerID=8YFLogxK
U2 - 10.1007/s10844-012-0198-3
DO - 10.1007/s10844-012-0198-3
M3 - Article
AN - SCOPUS:84857869442
SN - 0925-9902
VL - 39
SP - 461
EP - 490
JO - Journal of Intelligent Information Systems
JF - Journal of Intelligent Information Systems
IS - 2
ER -