Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups

Simple item page
dc.creatorHaralick, Robert M.
dc.creatorMiasnikov, Alexei D.
dc.creatorMyasnikov, Alexei G.
dc.date2006-04-09
dc.date.accessioned2026-07-07T08:07:43Z
dc.date.available2026-07-07T08:07:43Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0604205
dc.identifierhttp://arxiv.org/abs/math/0604205
dc.identifierContemporary Mathematics, 349:197-213, 2004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131025
dc.subjectGroup Theory
dc.subjectStatistics Theory
dc.titlePattern Recognition Approaches to Solving Combinatorial Problems in Free Groups
dc.typetext

Files

Collections

arXiv