Classification by restricted random walks
From MaRDI portal
Recommendations
Cites work
- Agglomerative clustering using the concept of mutual nearest neighbourhood
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
- Graph theoretical clustering based on limited neighbourhood sets
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- On the cover time of random walks on graphs
- The relative neighbourhood graph of a finite planar set
Cited in
(8)- Random walk distances in data clustering and applications
- Restricted set classification: who is there?
- Random embedding machines for pattern recognition
- A hybrid method for random pattern sequence classification
- Automatic Classification of Restricted Lattice Walks
- scientific article; zbMATH DE number 2081091 (Why is no real title available?)
- Consistent procedures for multiclass classification of discrete diffusion paths
- An update algorithm for restricted random walk clustering for dynamic data sets
This page was built for publication: Classification by restricted random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402697)