TY - GEN
T1 - Spectral graph complexity
AU - Tsitsulin, Anton
AU - Mottin, Davide
AU - Karras, Panagiotis
AU - Bronstein, Alex
N1 - Publisher Copyright: � 2019 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC-BY-NC-ND 4.0 License.
PY - 2019/5/13
Y1 - 2019/5/13
N2 - Graphs conveniently model relationships, interactions, physical and semantic structures. On such graphs, data mining tasks, such as community detection and classification, are performed either directly or on low-dimensional embeddings [12, 18] derived from the graph structures. By its nature, a graph represents complex interactions among objects in an abstract manner, while the underlying data intrinsically possess a notion of complexity.
AB - Graphs conveniently model relationships, interactions, physical and semantic structures. On such graphs, data mining tasks, such as community detection and classification, are performed either directly or on low-dimensional embeddings [12, 18] derived from the graph structures. By its nature, a graph represents complex interactions among objects in an abstract manner, while the underlying data intrinsically possess a notion of complexity.
UR - http://www.scopus.com/inward/record.url?scp=85066882369&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/3308560.3316589
DO - https://doi.org/10.1145/3308560.3316589
M3 - منشور من مؤتمر
T3 - The Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019
SP - 308
EP - 309
BT - The Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019
T2 - 2019 World Wide Web Conference, WWW 2019
Y2 - 13 May 2019 through 17 May 2019
ER -