Optimization of classifiers for data mining based on combinatorial semigroups
From MaRDI portal
Publication:535243
DOI10.1007/s00233-011-9298-6zbMath1211.68323OpenAlexW2092024922MaRDI QIDQ535243
J. L. Yearwood, P. A. Watters, Andrei V. Kelarev
Publication date: 11 May 2011
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/69150
Learning and adaptive systems in artificial intelligence (68T05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Rees semigroups of digraphs for classification of data. ⋮ Distance labellings of Cayley graphs of semigroups ⋮ On hyperideals in left almost semihypergroups. ⋮ Classification systems based on combinatorial semigroups ⋮ Centroid sets with largest weight in Munn semirings for data mining applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- A formula for multiple classifiers in data mining based on Brandt semigroups
- Undecidable problems for completely 0-simple semigroups.
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Biprefix codes, inverse semigroups and syntactic monoids of injective automata
- Representations and amalgamation of generalized inverse *-semigroups
- On congruences of automata defined by directed graphs
- On transitive Cayley graphs of groups and semigroups
- Abelian Groups, Rings and Modules
- Amalgamation for Inverse and Generalized Inverse Semigroups
- PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- Congruences on the Lattice of Pseudovarieties of Finite Semigroups
- Trace functions on inverse semigroup algebras
- The radical of the algebra of any finite semigroup over any field
- REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA