Proceedings of the 2017 ACM on Conference on Information and Knowledge Management 2017
DOI: 10.1145/3132847.3132902
|View full text |Cite
|
Sign up to set email alerts
|

A Non-negative Symmetric Encoder-Decoder Approach for Community Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 65 publications
(27 citation statements)
references
References 43 publications
0
27
0
Order By: Relevance
“…Shi et al [75] present a novel pairwise constrained non-negative symmetric matrix factorization (PCSNMF) method, which imposes pairwise constraints generated from ground-truth community information, to improve the performance of community detection. Sun et al [76] design a non-negative symmetric encoder-decoder approach to derive a better latent representation to improve community detection. Unlike other NMF-based methods that merely pay attention to the loss of the decoder, they combine the loss of the decoder and encoder to construct a unified loss function, so that the community membership of each node obtained is clearer and more explanatory.…”
Section: Matrix Factorization-based Methodsmentioning
confidence: 99%
“…Shi et al [75] present a novel pairwise constrained non-negative symmetric matrix factorization (PCSNMF) method, which imposes pairwise constraints generated from ground-truth community information, to improve the performance of community detection. Sun et al [76] design a non-negative symmetric encoder-decoder approach to derive a better latent representation to improve community detection. Unlike other NMF-based methods that merely pay attention to the loss of the decoder, they combine the loss of the decoder and encoder to construct a unified loss function, so that the community membership of each node obtained is clearer and more explanatory.…”
Section: Matrix Factorization-based Methodsmentioning
confidence: 99%
“…where • F denotes the Frobenius norm, L represents the graph Laplacian matrix, and graph regularization [124] focuses on the network topological similarity to cluster neighboring nodes. A further work [125] adds a sparsity constraint into the above deep NMF-based community detection.…”
Section: Deep Nonnegative Matrix Factorization-based Community Detectionmentioning
confidence: 99%
“…Non-overlapping community detection is analogous to clustering, and assumes that a node can only belong to a single group; see, for example, [18,26,28,31]. While overlapping community detection is analogous to fuzzy clustering as nodes have an affiliation with multiple clusters; look for example [16,36,43,49,51].…”
Section: Community Detectionmentioning
confidence: 99%
“…We would also like to emphasize that the use of graph kernels would not be feasible on graph datasets which are this numerous. [11,16,36,43,49,51] we assigned each node to the cluster that has the strongest affiliation score with the node (ties were broken randomly). The metric used for the clustering performance measurement is the average normalized mutual information (henceforth NMI) score calculated between the cluster membership vector and the factual class memberships.…”
Section: Datasetsmentioning
confidence: 99%
See 1 more Smart Citation