An update algorithm for restricted random walk clustering for dynamic data sets
DOI10.1007/S11634-009-0039-6zbMATH Open1282.62151OpenAlexW2007774568MaRDI QIDQ734522FDOQ734522
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
Recommendations
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Online algorithms; streaming algorithms (68W27) Sums of independent random variables; random walks (60G50)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Factor analysis with (mixed) observed and latent variables in the exponential family
- Discrete mobile centers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Better streaming algorithms for clustering problems
- Classification by restricted random walks
- Sublinear‐time approximation algorithms for clustering via random sampling
- Title not available (Why is that?)
- Clustering a DAG for CAD databases
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: An update algorithm for restricted random walk clustering for dynamic data sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734522)