UM
Revisiting Nyström extension for hypergraph clustering
Zhong,Guo; Pun,Chi Man
2020-08-25
Source PublicationNeurocomputing
ISSN0925-2312
Volume403Pages:247-256
AbstractFast pairwise grouping methods have recently shown great promising for large-scale clustering. However, the relationships among objects of the real world are often high-order rather than pairwise. Naively applying pairwise grouping methods to high-order grouping tasks will not always obtain the desired clustering results since there is a loss of information. In this paper, we propose a fast hypergraph clustering algorithm via the Nyström Extension. As the hyperedge of the hypergraph allows us to join any number of vertices, high-order relationships among objects can be captured. In contrast to some previous works in the Nyström research focusing on the error bound for the Nyström-approximated kernel matrix, we present an error bound for the approximated eigenvectors associated with the Nyström Extension of hypergraph Laplacian. In addition, a novel formulation for sampling size selection is provided. Our experiments on a series of UCI data sets show that the proposed algorithm achieves significantly speeding and lower storage. Specifically, our algorithm outperforms the pairwise spectral grouping method based on the Nyström method in terms of accuracy, computation time and space occupation.
KeywordHypergraph clustering Incidence matrix Large-scale clustering Nyström extension Sampling
DOI10.1016/j.neucom.2020.04.063
URLView the original
Language英語English
Scopus ID2-s2.0-85084560753
Fulltext Access
Citation statistics
Cited Times [WOS]:1   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
AffiliationDepartment of Computer and Information Science,University of Macau,China
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Zhong,Guo,Pun,Chi Man. Revisiting Nyström extension for hypergraph clustering[J]. Neurocomputing,2020,403:247-256.
APA Zhong,Guo,&Pun,Chi Man.(2020).Revisiting Nyström extension for hypergraph clustering.Neurocomputing,403,247-256.
MLA Zhong,Guo,et al."Revisiting Nyström extension for hypergraph clustering".Neurocomputing 403(2020):247-256.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhong,Guo]'s Articles
[Pun,Chi Man]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhong,Guo]'s Articles
[Pun,Chi Man]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhong,Guo]'s Articles
[Pun,Chi Man]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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