Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups

Details Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups

2006-04-09

arxiv.org/abs/math/0604205v1

Contemporary Mathematics, 349:197-213, 2004

Mathematics

Group Theory

Scientific paper

We review some basic methodologies from pattern recognition that can be applied to helping solve combinatorial problems in free group theory. We illustrate how this works with recognizing Whitehead minimal words in free groups of rank 2. The methodologies reviewed include how to form feature vectors, principal components, distance classifers, linear classifiers, regression classifiers, Fisher linear discriminant, support vector machines, quantizing, classification trees, and clustering techniques.

Affiliated with

Also associated with

No associations

Rating

Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267775