Density of states for fast embedding node-attributed graphs
CC BY
Lưu vào:
| Tác giả chính: | , , |
|---|---|
| Định dạng: | Sách |
| Ngôn ngữ: | English |
| Nhà xuất bản: |
Springer
2023
|
| Chủ đề: | |
| Truy cập trực tuyến: | https://link.springer.com/article/10.1007/s10115-023-01836-3 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8239 |
| Từ khóa: |
Thêm từ khóa
Không có từ khóa, Hãy là người đầu tiên đánh dấu biểu ghi này!
|
| id |
oai:localhost:PNK-8239 |
|---|---|
| record_format |
dspace |
| spelling |
oai:localhost:PNK-82392023-04-24T02:16:11Z Density of states for fast embedding node-attributed graphs Lingxiao, Zhao Saurabh, Sawlani Leman, Akoglu A-DOGE node-attributed graph CC BY Given a node-attributed graph, how can we efficiently represent it with few numerical features that expressively reflect its topology and attribute information? We propose A-DOGE, for attributed DOS-based graph embedding, based on density of states (DOS, a.k.a. spectral density) to tackle this problem. A-DOGE is designed to fulfill a long desiderata of desirable characteristics. Most notably, it capitalizes on efficient approximation algorithms for DOS, that we extend to blend in node labels and attributes for the first time, making it fast and scalable for large attributed graphs and graph databases. 2023-04-24T02:16:11Z 2023-04-24T02:16:11Z 2023 Book https://link.springer.com/article/10.1007/s10115-023-01836-3 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8239 en application/pdf Springer |
| institution |
Digital Phenikaa |
| collection |
Digital Phenikaa |
| language |
English |
| topic |
A-DOGE node-attributed graph |
| spellingShingle |
A-DOGE node-attributed graph Lingxiao, Zhao Saurabh, Sawlani Leman, Akoglu Density of states for fast embedding node-attributed graphs |
| description |
CC BY |
| format |
Book |
| author |
Lingxiao, Zhao Saurabh, Sawlani Leman, Akoglu |
| author_facet |
Lingxiao, Zhao Saurabh, Sawlani Leman, Akoglu |
| author_sort |
Lingxiao, Zhao |
| title |
Density of states for fast embedding node-attributed graphs |
| title_short |
Density of states for fast embedding node-attributed graphs |
| title_full |
Density of states for fast embedding node-attributed graphs |
| title_fullStr |
Density of states for fast embedding node-attributed graphs |
| title_full_unstemmed |
Density of states for fast embedding node-attributed graphs |
| title_sort |
density of states for fast embedding node-attributed graphs |
| publisher |
Springer |
| publishDate |
2023 |
| url |
https://link.springer.com/article/10.1007/s10115-023-01836-3 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8239 |
| _version_ |
1764086838993092608 |
| score |
8.8926115 |