art i and pattern clustering algorithms

ART I AND PATTERN CLUSTERING ALGORITHMS. Barbara Moore. MIT AI Lab. Room 826,545 Technology Square, Cambridge MA 02139.

The ART I system developed by Gaff Carpenter and Stephen Grossberg is a dynamical system that implements a pattern clustering algorithm. In addition to grouping patterns~ the algorithm automatically determines the best number of groupings. The dynanfical systems implementation is interesting for many reasons, one of which is that it is seems easily realizable in parallel analog hardware. We derive the pattern clustering algorithm from the ART I architecture. We repeat the proofs of ART I convergence presented by Carpenter and Grossberg, but in the domain and ternfinology of pattern analysis. In this framework we examine other properties of the algorithm's behavior. Finally, we ask whether other pattern clustering algorithms might be implementable on an architecture similar to ART I.

art i and pattern clustering algorithms

Documents

clustering algorithms: k-means

hypergraph models and algorithms for data-pattern-based...

1 clustering algorithms hierarchical clustering k -means...

parallelization of multi-objective evolutionary algorithms...

chapter 4 clustering algorithms and evaluations ·...

small world clustering algorithms

data clustering: algorithms and applications

a novel xml documents using clustering tree pattern...

pattern-based clustering

ki2 s07 clustering algorithms

anonymization algorithms - microaggregation and clustering

selecting clustering algorithms based on their...

1 clustering distance measures hierarchical clustering k...

a tutorial on clustering algorithms

clustering hierarchical algorithms

two density-based clustering algorithms

report on new clustering algorithms with simulation...

mu yu lu clustering algorithms

direct multicriteria clustering algorithms

comparison of clustering algorithms report