New tools for automatically finding data clusters that share statistical properties in a heterogeneous data set are imperative in pattern recognition research. Here we introduce a deterministic procedure as a tool for pattern recognition in a hierarchical way. The algorithm finds attractors of mutually close points based on the neighborhood ranking. A memory parameter mu acts as a hierarchy parameter, in which the clusters are identified. The final result of the method is a general tree that represents the nesting structure of the data in an invariant way by scale transformation.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/PhysRevE.74.026703 | DOI Listing |
Publication Analysis
Top Keywords
pattern recognition
12
deterministic walks
4
walks algorithm
4
algorithm pattern
4
recognition tools
4
tools automatically
4
automatically finding
4
finding data
4
data clusters
4
clusters share
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!