2021
DOI: 10.1016/j.neucom.2021.03.020
|View full text |Cite
|
Sign up to set email alerts
|

Deep node clustering based on mutual information maximization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…Subsequently, the proposed framework lists maximal cliques from the constructed graph in different hops to learn useful representations, as used by [27,47]. The Bron-Kerbosch method [45] is used to obtain all maximal cliques in the graph.…”
Section: Cliquefluxnetmentioning
confidence: 99%
“…Subsequently, the proposed framework lists maximal cliques from the constructed graph in different hops to learn useful representations, as used by [27,47]. The Bron-Kerbosch method [45] is used to obtain all maximal cliques in the graph.…”
Section: Cliquefluxnetmentioning
confidence: 99%
“…transportation networks [4], and citation networks [5]. Recently, many studies have emerged on learning representations to encode structural information of the graph [6,7,8,9,10]. These graph representation learning algorithms convert graph data into a low-dimensional space.…”
Section: Introductionmentioning
confidence: 99%
“…Downstream machine learning tasks can then use these latent vectors as feature inputs [5,6]. For example, COOL [7], and GHNN [8] employ graph representations in their classification task, Modularity-aware VGAE [9], and GCN-LP [10] in their link prediction tasks, and SOLI [11] in its clustering task.…”
Section: Introductionmentioning
confidence: 99%