Classification by restricted random walks

DOI10.1016/S0031-3203(02)00111-5zbMath1028.68103MaRDI QIDQ1402697

Joachim Schöll, Elisabeth Schöll-Paschinger

Publication date: 28 August 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

Hierarchical clusteringRestricted random walkStochastic classification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (1)

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

Uses Software

• UCI-ml
• PARVUS

Cites Work

• The relative neighbourhood graph of a finite planar set
• Graph theoretical clustering based on limited neighbourhood sets
• Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
• Agglomerative clustering using the concept of mutual nearest neighbourhood
• On the cover time of random walks on graphs
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Classification by restricted random walks