Classification systems based on combinatorial semigroups

DOI10.1007/s00233-012-9454-7zbMath1267.68173OpenAlexW1982301367MaRDI QIDQ1955590

Andrei V. Kelarev, Jemal H. Abawajy

Publication date: 14 June 2013

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/61886

zbMATH Keywords

data miningcombinatorial semigroupsclassification systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorics in computer science (68R05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (5)

Rees semigroups of digraphs for classification of data. ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Centroid sets with largest weight in Munn semirings for data mining applications ⋮ INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES ⋮ Ideal basis in constructions defined by directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipartite graphs and completely 0-simple semigroups.
• Optimization of classifiers for data mining based on combinatorial semigroups
• 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
• On cyclic codes in incidence rings
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
• REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA

This page was built for publication: Classification systems based on combinatorial semigroups