Nonnegative Matrix Factorization with Hypergraph Based on Discriminative Constraint and Nonsymmetric Reformulation

被引:0
作者
Pan, Sigan [1 ]
Yang, Lei [1 ]
机构
[1] Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China
来源
2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC) | 2021年
基金
中国国家自然科学基金;
关键词
Nonnegative matrix factorization; Image clustering; Community detection; Hypergraph regularization; Nonsymmetric reformulation; COMMUNITY DETECTION; NETWORKS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nonnegative matrix factorization (NMF) is a widely used clustering method, which has been successfully applied to image clustering, community detection, text clustering, and other applications. However, NMF uses the linear combination of basis vectors, so when there is a nonlinear structure, NMF cannot find the combination of basis vectors representing the one cluster. Meanwhile, higher-order information among the nodes and the limited label information is often ignored. In this paper, we present a new model, namely NMF with hypergraph based on discriminative constraint and nonsymmetric reformulation (DNHNMF) to address this shortcoming. Specifically, DNHNMF formulates a symmetric matrix containing pairwise similarity values by reformulating the nonsymmetric matrix, explicitly combining label information and higher-order information, excavate the potential inherent cluster structure, and making the Euclidean distance between coefficient matrices (clustering assignment matrix) better represent the similarity measure among nodes. The clustering experiments of the proposed method are carried out and validated on eight standard datasets. Extensive experimental results show the effectiveness of the DNHNMF.
引用
收藏
页码:7441 / 7446
页数:6
相关论文
共 29 条
  • [1] Ahmed I, 2021, NEIGHBORHOOD STRUCTU, V22, P1
  • [2] [Anonymous], 1992, VECTOR QUANTIZATION
  • [3] Graph Regularized Nonnegative Matrix Factorization for Data Representation
    Cai, Deng
    He, Xiaofei
    Han, Jiawei
    Huang, Thomas S.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1548 - 1560
  • [4] Metrics for Community Analysis: A Survey
    Chakraborty, Tanmoy
    Dalmia, Ayushi
    Mukherjee, Animesh
    Ganguly, Niloy
    [J]. ACM COMPUTING SURVEYS, 2017, 50 (04)
  • [5] A model framework for the enhancement of community detection in complex networks
    He, Dongxiao
    Wang, Hongcui
    Jin, Di
    Liu, Baolin
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 461 : 602 - 612
  • [6] Community detection in networks: A multidisciplinary review
    Javed, Muhammad Aqib
    Younis, Muhammad Shahzad
    Latif, Siddique
    Qadir, Junaid
    Baig, Adeel
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 108 : 87 - 111
  • [7] Kuang Da, 2012, Proceedings of the 2012 SIAM International Conference on Data Mining, P106, DOI DOI 10.1137/1.9781611972825.10
  • [8] Learning the parts of objects by non-negative matrix factorization
    Lee, DD
    Seung, HS
    [J]. NATURE, 1999, 401 (6755) : 788 - 791
  • [9] Graph Regularized Lp Smooth Non-negative Matrix Factorization for Data Representation
    Leng, Chengcai
    Zhang, Hai
    Cai, Guorong
    Cheng, Irene
    Basu, Anup
    [J]. IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (02) : 584 - 595
  • [10] Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
    Leskovec, Jure
    Lang, Kevin J.
    Dasgupta, Anirban
    Mahoney, Michael W.
    [J]. INTERNET MATHEMATICS, 2009, 6 (01) : 29 - 123