An update algorithm for restricted random walk clustering for dynamic data sets

DOI10.1007/s11634-009-0039-6zbMath1282.62151OpenAlexW2007774568MaRDI QIDQ734522

Markus Franke, Andreas Geyer-Schulz

Publication date: 13 October 2009

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-009-0039-6

zbMATH Keywords

clusteringrandom walksdynamic clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Online algorithms; streaming algorithms (68W27)

Related Items

Random walk distances in data clustering and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification by restricted random walks
• Discrete mobile centers
• Factor analysis with (mixed) observed and latent variables in the exponential family
• Sublinear‐time approximation algorithms for clustering via random sampling
• Better streaming algorithms for clustering problems
• Clustering a DAG for CAD databases
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An update algorithm for restricted random walk clustering for dynamic data sets