A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA

DOI10.1017/S0004972708001111MaRDI QIDQ3624606zbMATH OpenFDO

Authors A. V. Kelarev, J. L. Yearwood, P. Vamplew

Publication date 30 April 2009

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972708001111

zbMATH Keywords

classification of datacombined multiple classifierserror-correcting capabilitygroup ringsring constructionsvisible sets of generators

Mathematics Subject Classification ID

Ideals in associative algebras (16D25) Group rings (16S34) Ordinary and skew polynomial rings and semigroup rings (16S36) Semigroup rings, multiplicative semigroups of rings (20M25) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 4112802
• Important algebraic calculations for \(n\)-variables polynomial codes
• Classical codes as ideals in group algebras
• scientific article; zbMATH DE number 4010390
• Construction of n variable codes

Cites work

• A global optimization approach to classification
• An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Generators and weights of polynomial codes
• scientific article; zbMATH DE number 4112802 (Why is no real title available?)
• On cyclic codes in incidence rings
• Visible codes

Cited in

(15)

• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Classification systems based on combinatorial semigroups
• Centroid sets with largest weight in Munn semirings for data mining applications
• Distances of centroid sets in a graph-based construction for information security applications
• Rees semigroups of digraphs for classification of data.
• Internet security applications of Gröbner-Shirshov bases
• Optimization of matrix semirings for classification systems.
• OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
• Ideal basis in constructions defined by directed graphs
• Optimization of classifiers for data mining based on combinatorial semigroups
• The regular graph of a noncommutative ring
• Incidence semirings of graphs and visible bases.
• Rees matrix constructions for clustering of data.
• Internet security applications of the Munn rings
• On hyperideals in left almost semihypergroups.

This page was built for publication: A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624606)