Constrains optimal propagation-based modified semi-supervised spectral clustering for large-scale data
by Dayu Xu; Xuyao Zhang; Jiaqi Huang; Hailin Feng
International Journal of Applied Decision Sciences (IJADS), Vol. 11, No. 3, 2018

Abstract: We focus on the problem of high computational complexity in the clustering process of traditional spectral clustering algorithm that cannot satisfy the requirement of current large-scale data clustering applications. In this article, we establish a constrained optimal propagation based semi-supervised large-scale data clustering model. In this model, micro similarity matrix is constructed by using prior dotted pair constraint information at first. On this basis, the Gabow algorithm is exploited to extract each strongly connected component from the micro similarity matrix that is represented by its connected graph. Then, a new constrained optimisation propagation algorithm for each strongly connected component is proposed to calculate the similarity of the whole dataset. Finally, we employ the singular value decomposition and the accelerated k-means algorithm to obtain the clustering results of large-scale data. Experiments on multiple standard testing datasets show that compared with other previous research results in this field, the proposed clustering model has higher clustering accuracy and lower computation complexity, and is more suitable for large-scale data clustering applications.

Online publication date: Thu, 05-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email