Spectral graph complexity

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

DOI

  • Anton Tsitsulin, University of Bonn
  • ,
  • Davide Mottin
  • Panagiotis Karras
  • Alex Bronstein, Technion - Israel Institute of Technology
  • ,
  • Emmanuel Müller, University of Bonn

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.

Original languageEnglish
Title of host publicationThe Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019
Number of pages2
PublisherAssociation for Computing Machinery
Publication yearMay 2019
Pages308-309
ISBN (Electronic)9781450366755
DOIs
Publication statusPublished - May 2019
Event2019 World Wide Web Conference, WWW 2019 - San Francisco, United States
Duration: 13 May 201917 May 2019

Conference

Conference2019 World Wide Web Conference, WWW 2019
LandUnited States
BySan Francisco
Periode13/05/201917/05/2019
SponsorAmazon, Bloomberg, Criteo AI Lab, et al., Google, Microsoft
SeriesThe Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019

See relations at Aarhus University Citationformats

ID: 160485869