OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS

DOI10.1142/S1793557109000042zbMath1178.68405OpenAlexW2000888377MaRDI QIDQ5324144

John Yearwood, Richard Dazeley, Andrei V. Kelarev, Musa A. Mammadov

Publication date: 3 August 2009

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557109000042

zbMATH Keywords

efficient algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Grammars and rewriting systems (68Q42)

Related Items (2)

INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Projectively condensed semigroups, generalized completely regular semigroups and projective orthomonoids.
• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Generators and weights of polynomial codes
• On algebras and their radicals
• Rees short exact sequences of \(S\)-systems
• A global optimization approach to classification
• On radicals of module coalgebras.
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• A PRESENTATION OF THE DUAL SYMMETRIC INVERSE MONOID
• REES MATRIX THEOREM FOR $\mathcal{D}^{(\ell)}$-SIMPLE STRONGLY RPP SEMIGROUPS
• A STRUCTURE THEOREM FOR PERFECT ABUNDANT SEMIGROUPS
• An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
• Trace functions on inverse semigroup algebras
• Radicals of Semilattice-graded Rings

This page was built for publication: OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS