2018
DOI: 10.1007/978-3-030-01716-3_29
|View full text |Cite
|
Sign up to set email alerts
|

Network Representation Learning Based on Community and Text Features

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Wang et al Wang et al (2017) point out that for two nodes within a community, even if they only have a weak relationship in the microscopic structure due to the data sparsity issue, their similarity will also be strengthened by the community structure constraint. Hence, Zhu et al Zhu et al (2018) propose CTDW, which incorporates the community features and text features of nodes into NRL under the framework of matrix factorization. Nevertheless, the design of matrix factorization requires a high computational cost.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Wang et al Wang et al (2017) point out that for two nodes within a community, even if they only have a weak relationship in the microscopic structure due to the data sparsity issue, their similarity will also be strengthened by the community structure constraint. Hence, Zhu et al Zhu et al (2018) propose CTDW, which incorporates the community features and text features of nodes into NRL under the framework of matrix factorization. Nevertheless, the design of matrix factorization requires a high computational cost.…”
Section: Related Workmentioning
confidence: 99%
“…Evidently, mining the community information and preserving the attribute semantics are both advantageous to enhance the quality of node embeddings based on the microscopic structure. Therefore, Zhu et al Zhu et al (2018) propose the CTDW algorithm.…”
Section: Introductionmentioning
confidence: 99%