Exact - Component Graph Learning for Image Clustering

Yufang Min and Yaonan Zhang

Mathematical Problems in Engineering, 2020, vol. 2020, 1-10

Abstract:

The performance of graph-based clustering methods highly depends on the quality of the data affinity graph as a good affinity graph can approximate well the pairwise similarity between data samples. To a large extent, existing graph-based clustering methods construct the affinity graph based on a fixed distance metric, which is often not an accurate representation of the underlying data structure. Also, they require postprocessing on the affinity graph to obtain clustering results. Thus, the results are sensitive to the particular graph construction methods. To address these two drawbacks, we propose a - component graph clustering ( - GC) approach to learn an intrinsic affinity graph and to obtain clustering results simultaneously. Specifically, - GC learns the data affinity graph by assigning the adaptive and optimal neighbors for each data point based on the local distances. Efficient iterative updating algorithms are derived for - GC, along with proofs of convergence. Experiments on several benchmark datasets have demonstrated the effectiveness of - GC.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5175210.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5175210.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5175210

DOI: 10.1155/2020/5175210

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().