Discovering recurring activity in temporal networks

DOI10.1007/s10618-017-0515-0zbMath1416.62700OpenAlexW2625026177MaRDI QIDQ1741356

Aristides Gionis, Nikolaj Tatti, Orestis Kostakis

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-017-0515-0

zbMATH Keywords

social networkssegmentationfootballtemporal networksdynamic graphsbasketballsports analyticshandballsummarising

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Applications of statistics (62P99)

Related Items (6)

On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning ⋮ An efficient procedure for mining egocentric temporal motifs ⋮ Filtering active moments in basketball games using data from players tracking systems ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Temporal vertex cover with a sliding time window ⋮ The temporal explorer who returns to the base

Uses Software

• GraphScope
• k-means++

Cites Work

• A survey of graph edit distance
• Geometric applications of a matrix-searching algorithm
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Near-optimal fully-dynamic graph connectivity
• On the approximation of curves by line segments using dynamic programming
• Separator based sparsification for dynamic planar graph algorithms
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Machine Learning: ECML 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering recurring activity in temporal networks