Random Walks and Markov Chains
Authors:
- Avrim BlumABAvrim Blum
- Ravi KannanRKRavi Kannan
- 23 January 2020
- book chapter
- Published by Cambridge University Press (CUP)
- p. 62-108
Abstract
Foundations of Data Science - by Avrim Blum January 2020Keywords
This publication has 105 references indexed in Scilit:
- A survey of kernel and spectral methods for clusteringPattern Recognition, 2008
- Survey propagation: An algorithm for satisfiabilityRandom Structures & Algorithms, 2005
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Support-vector networksMachine Learning, 1995
- Lifelong robot learningRobotics and Autonomous Systems, 1995
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Finding repeated elementsScience of Computer Programming, 1982
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963