Spectral graph complexity

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer 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.

OriginalsprogEngelsk
TitelThe Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019
RedaktørerLing Liu, Ryen White
Antal sider2
ForlagAssociation for Computing Machinery
Udgivelsesårmaj 2019
Sider308-309
ISBN (Elektronisk)9781450366755
DOI
StatusUdgivet - maj 2019
Begivenhed2019 World Wide Web Conference, WWW 2019 - San Francisco, USA
Varighed: 13 maj 201917 maj 2019

Konference

Konference2019 World Wide Web Conference, WWW 2019
LandUSA
BySan Francisco
Periode13/05/201917/05/2019
SponsorAmazon, Bloomberg, Criteo AI Lab, et al., Google, Microsoft

Se relationer på Aarhus Universitet Citationsformater

ID: 160485869