Transfer Prototype-Based Fuzzy Clustering

被引:95
作者
Deng, Zhaohong [1 ]
Jiang, Yizhang [1 ]
Chung, Fu-Lai [2 ]
Ishibuchi, Hisao [3 ]
Choi, Kup-Sze [4 ]
Wang, Shitong [1 ]
机构
[1] Jiangnan Univ, Sch Digital Media, Wuxi 214122, Peoples R China
[2] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
[3] Osaka Prefecture Univ, Dept Comp Sci & Intelligent Syst, Osaka 5998531, Japan
[4] Hong Kong Polytech Univ, Sch Nursing, Hong Kong, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Fuzzy c-means (FCM); fuzzy subspace clustering (FSC); knowledge leverage; prototype-based clustering; transfer learning; ALGORITHM; PROXIMITY; SYSTEM; FCM;
D O I
10.1109/TFUZZ.2015.2505330
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional prototype-based clustering methods, such as the well-known fuzzy c-means (FCM) algorithm, usually need sufficient data to find a good clustering partition. If available data are limited or scarce, most of them are no longer effective. While the data for the current clustering task may be scarce, there is usually some useful knowledge available in the related scenes/domains. In this study, the concept of transfer learning is applied to prototype-based fuzzy clustering (PFC). Specifically, the idea of leveraging knowledge from the source domain is exploited to develop a set of transfer PFC algorithms. First, two representative PFC algorithms, namely, FCM and fuzzy subspace clustering, have been chosen to incorporate with knowledge leveraging mechanisms to develop the corresponding transfer clustering algorithms based on an assumption that there are the same number of clusters between the target domain (current scene) and the source domain (related scene). Furthermore, two extended versions are also proposed to implement the transfer learning for the situation that there are different numbers of clusters between two domains. The novel objective functions are proposed to integrate the knowledge from the source domain with the data in the target domain for the clustering in the target domain. The proposed algorithms have been validated on different synthetic and real-world datasets. Experimental results demonstrate their effectiveness in comparison with both the original PFC algorithms and the related clustering algorithms like multitask clustering and coclustering.
引用
收藏
页码:1210 / 1232
页数:23
相关论文
共 62 条
[1]  
Ankerst M, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P49
[2]  
[Anonymous], 2004, ICML
[3]  
[Anonymous], 1969, Nonlinear programming: a unified approach
[4]  
[Anonymous], 1996, Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering
[5]  
[Anonymous], Pattern Recognition with Fuzzy Objective Function Algorithms, DOI 10.1007/978-1-4757-0450-1_3
[6]  
Banerjee A., 2003, ACM International Conference on Knowledge Discovery and Data Mining, SIGKDD, P19, DOI DOI 10.1145/956750.956757
[7]   Support vector clustering [J].
Ben-Hur, A ;
Horn, D ;
Siegelmann, HT ;
Vapnik, V .
JOURNAL OF MACHINE LEARNING RESEARCH, 2002, 2 (02) :125-137
[8]  
Bickel S., 2007, P 24 INT C MACHINE L, P81, DOI DOI 10.1145/1273496.1273507
[9]   Application of Transfer Regression to TCP Throughput Prediction [J].
Borzemski, Leszek ;
Starczewski, Gabriel .
2009 FIRST ASIAN CONFERENCE ON INTELLIGENT INFORMATION AND DATABASE SYSTEMS, 2009, :28-33
[10]   k-plane clustering [J].
Bradley, PS ;
Mangasarian, OL .
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 16 (01) :23-32