Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Mining Temporal Networks
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.ORCID-id: 0000-0002-5211-112X
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.ORCID-id: 0000-0002-2526-8762
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.ORCID-id: 0009-0007-5894-0774
2024 (engelsk)Inngår i: WWW 2024 Companion - Companion Proceedings of the ACM Web Conference, Association for Computing Machinery (ACM) , 2024, s. 1260-1263Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In World Wide Web (WWW) systems, networks (or graphs) serve as a fundamental tool for representing, analyzing, and understanding linked data, providing significant insights into the underlying systems. Naturally, most real-world systems have inherent temporal information, e.g., interactions in social networks occur at specific moments in time and last for a certain period. Temporal networks, i.e., network data modeling temporal information, enable novel and fundamental discoveries about the underlying systems they model, otherwise not captured by static networks that ignore such temporal information. In this tutorial, we present state-of-the-art models and algorithmic techniques for mining temporal networks that can provide precious insights into a plethora of web-related applications. We present how temporal networks can be used to extract novel information, especially in web-related network data, and highlight the challenges that arise when modeling temporal information compared to traditional static network-based approaches. We first overview different temporal network models. We then show how such powerful models can be leveraged to extract novel insights through suitable mining primitives. In particular, we present recent advances addressing most foundational problems for temporal network mining—ranging from the computation of temporal centrality measures, temporal motif counting, and temporal communities to bursty events and anomaly detection.

sted, utgiver, år, opplag, sider
Association for Computing Machinery (ACM) , 2024. s. 1260-1263
Emneord [en]
Data Mining, Graph Algorithms, Graphs, Network Mining, Temporal Networks
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-347308DOI: 10.1145/3589335.3641245Scopus ID: 2-s2.0-85194496851OAI: oai:DiVA.org:kth-347308DiVA, id: diva2:1867241
Konferanse
33rd ACM Web Conference, WWW 2024, Singapore, Singapore, May 13 2024 - May 17 2024
Merknad

QC 20240612

Part of ISBN 9798400701726

Tilgjengelig fra: 2024-06-10 Laget: 2024-06-10 Sist oppdatert: 2025-01-27bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Gionis, AristidesOettershagen, LutzSarpe, Ilie

Søk i DiVA

Av forfatter/redaktør
Gionis, AristidesOettershagen, LutzSarpe, Ilie
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 138 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf