z-logo
open-access-imgOpen Access
Semi-supervised Power Iteration Clustering
Author(s) -
Yuqi Yang,
Rongfang Bie,
Hao Wu,
Shuaijing Xu,
Liangchi Li
Publication year - 2019
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2019.01.210
Subject(s) - computer science , cluster analysis , power iteration , adjacency matrix , pairwise comparison , spectral clustering , computation , algorithm , matrix (chemical analysis) , graph , reduction (mathematics) , data mining , artificial intelligence , theoretical computer science , iterative method , mathematics , materials science , geometry , composite material
Spectral clustering is of significance for many research areas, but high computation complexity restricted its power obviously. Even though Power Iteration Clustering(PIC) algorithm could speed up its process by random selection of the initial vector, it is still at the cost of accuracy reduction. Aiming at the problems above, we proposed one Semi-supervised Power Iteration Clustering(SPIC) algorithm that is based on semi-supervised learning and power iteration clustering(PIC). Several pairwise constraints could be added to modify the graph adjacency matrix while a new affinity matrix with partial supervision would be built. As opposed to standard spectral methods that largely depends on pairwise distances between points, our algorithm focuses on changing the part of the affinity matrix. At last, various synthetic datasets are collected, then several experiments are performed based on these datasets to validate the superiority of our proposed algorithm over the traditional algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom