Method Toward Network Embedding Within Homogeneous Attributed Network Using Influential Node Diffusion-Aware
Bibliographic Data
| ID | 22106906 |
|---|---|
| Authors | Weinan Niu (0000-0002-1250-747X, Nanjing University of Aeronautics and Astronautics), Wenan Tan (0000-0003-2608-652X, Shanghai Polytechnic University), Wei Jia (0000-0002-8181-086X, Nanjing University of Aeronautics and Astronautics), Li Da Xu (0000-0002-3263-5217, Old Dominion University) |
| Year | 2024 |
| Volume | 11 |
| Issue | 2 |
| Pages | 2620-2631 |
| Publication date | 2024-04-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2023.3276159 |
| OpenAlex | W4377715312 |
| Language | EN |
| References cited | 39 |
Network embedding (NE) focuses on discovering low-dimensional embeddings of nodes while retaining their intrinsic features and structure of nodes. It is essential for many practical applications, containing text mining, community detection, and node classification. However, the great majority of existing systems are incapable of combining structural and attribute information. To tackle the above-mentioned problem, considering the information diffusion process, we present a novel model for attribute NE (ANE), namely influential node diffusion-based matrix factorization (INDMF), which contains topology level and attribute level. In detail, we first propose a novel method to extract high-order information via influential node diffusion sequences. Then, we regard the optimization of our proposed structure-based and attribute-based loss functions as a matrix factorization problem. Furthermore, this model can be used to generate final node embedding by aggregating the topology level and attribute level hierarchically. Experiments are conducted on four real-world datasets, which indicates that INDMF beats all competing algorithms in node categorization, community detection, and graph visualization
Categorization · Complex network · Computer network · Data mining · Embedding · Graph · Matrix decomposition · Network topology · Non-negative matrix factorization · Visualization · Advanced Graph Neural Networks · Complex Network Analysis Techniques · Computer Science · Mathematics · Opinion Dynamics and Social Influence · Artificial Intelligence · Theoretical Computer Science
| Citation velocity | historical |
|---|---|
| Highly cited | No |