Centroid sets with largest weight in Munn semirings for data mining applications

DOI10.1007/s00233-013-9488-5zbMath1298.68211OpenAlexW2067103465MaRDI QIDQ2447251

Yanyan Li

Publication date: 25 April 2014

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

Full work available at URL: https://doi.org/10.1007/s00233-013-9488-5

zbMATH Keywords

classification systemsMunn semirings

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Semirings (16Y60)

Related Items

Rees semigroups of digraphs for classification of data. ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ Ideal basis in constructions defined by directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of classifiers for data mining based on combinatorial semigroups
• A formula for multiple classifiers in data mining based on Brandt semigroups
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Regular semirings
• Classification systems based on combinatorial semigroups
• Weak commutativity in idempotent semirings.
• OPTIMIZATION OF MATRIX SEMIRINGS FOR CLASSIFICATION SYSTEMS
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
• OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
• REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA
• Internet security applications of the Munn rings