Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Group Theory, Statistics Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/131025

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0604205
 http://arxiv.org/abs/math/0604205
 Contemporary Mathematics, 349:197-213, 2004

Collections

arXiv