Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61050
Title: Transfer affinity propagation-based clustering
Authors: Hang, W
Chung, FL 
Wang, S
Keywords: Affinity propagation
Exemplars
Insufficient datasets
Transfer affinity propagation
Transfer learning
Issue Date: 2016
Publisher: Elsevier
Source: Information sciences, 2016, v. 348, p. 337-356 How to cite?
Journal: Information sciences 
Abstract: Designing a clustering algorithm in the absence of data is becoming a common challenge because the acquisition of annotated information is often difficult or expensive, particularly in the new fields. Because transferring knowledge from the auxiliary domain has been demonstrated to be useful, it is possible to develop an appropriate clustering algorithm for these scenarios in view of transfer learning, where useful information from relevant source domains can be used to complement the decision process and to identify the appropriate number of clusters and a high quality clustering result. In this paper, a novel transfer affinity propagation-based clustering algorithm known as TAP is presented for the scenarios above. Its distinctive characteristics can modify the update rules for the two message propagations used in affinity propagation (AP). Specifically, the most representative points called "exemplars" and the preferences in the source domain are considered for helping in the construction of the high-quality clustering model for insufficient target data. With the corresponding factor graph, the addition of a new term in the objective function for AP allows TAP to cluster in a AP-like message-passing manner for transfer learning, i.e., TAP can identify the appropriate number of clusters and can extract the knowledge of the source domain to enhance the clustering performance for target data, even when the new data are not sufficient to train a model alone. Extensive experiments verify that the proposed algorithm outperforms the state-of-the-art algorithms on insufficient datasets.
URI: http://hdl.handle.net/10397/61050
ISSN: 0020-0255
EISSN: 1872-6291
DOI: 10.1016/j.ins.2016.02.009
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Aug 20, 2017

Page view(s)

16
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.