Please use this identifier to cite or link to this item:
|Title:||Particle Competition and Cooperation in Networks for Semi-Supervised Learning|
Quiles, Marcos [UNIFESP]
Universidade de São Paulo (USP)
São Paulo State Univ UNESP
Universidade Federal de São Paulo (UNIFESP)
Polish Acad Sci
Hong Kong Baptist Univ
particles competition and cooperation
|Publisher:||Ieee Computer Soc|
|Citation:||Ieee Transactions On Knowledge and Data Engineering. Los Alamitos: Ieee Computer Soc, v. 24, n. 9, p. 1686-1698, 2012.|
|Abstract:||Semi-supervised learning is one of the important topics in machine learning, concerning with pattern classification where only a small subset of data is labeled. in this paper, a new network-based (or graph-based) semi-supervised classification model is proposed. It employs a combined random-greedy walk of particles, with competition and cooperation mechanisms, to propagate class labels to the whole network. Due to the competition mechanism, the proposed model has a local label spreading fashion, i.e., each particle only visits a portion of nodes potentially belonging to it, while it is not allowed to visit those nodes definitely occupied by particles of other classes. in this way, a divide-and-conquer effect is naturally embedded in the model. As a result, the proposed model can achieve a good classification rate while exhibiting low computational complexity order in comparison to other network-based semi-supervised algorithms. Computer simulations carried out for synthetic and real-world data sets provide a numeric quantification of the performance of the method.|
|Appears in Collections:||Artigo|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.