scientific article; zbMATH DE number 2081091

zbMath1052.68120MaRDI QIDQ4474204

Yehuda Koren, David Harel

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2245/22450018.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (9)

Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ The complexity of contracting bipartite graphs into small cycles ⋮ Algebraic connectivity and disjoint vertex subsets of graphs ⋮ The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases ⋮ On graph contractions and induced minors ⋮ Quantum speed-up for unsupervised learning ⋮ An update algorithm for restricted random walk clustering for dynamic data sets ⋮ Discovery of anomalous spatio‐temporal windows using discretized spatio‐temporal scan statistics ⋮ Genetic clustering of social networks using random walks

This page was built for publication: