An update algorithm for restricted random walk clustering for dynamic data sets
From MaRDI portal
Publication:734522
DOI10.1007/s11634-009-0039-6zbMath1282.62151MaRDI 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
62H30: Classification and discrimination; cluster analysis (statistical aspects)
60G50: Sums of independent random variables; random walks
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
68W27: Online algorithms; streaming algorithms
Related Items
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