A formula for multiple classifiers in data mining based on Brandt semigroups
From MaRDI portal
Publication:1014262
DOI10.1007/s00233-008-9098-9zbMath1168.94007OpenAlexW1971925482MaRDI QIDQ1014262
J. L. Yearwood, Andrei V. Kelarev, Musa A. Mammadov
Publication date: 27 April 2009
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/58566
Applications of statistics in engineering and industry; control charts (62P30) Linear codes (general theory) (94B05) Theory of data (68P99)
Related Items (13)
Rees semigroups of digraphs for classification of data. ⋮ On hyperideals in left almost semihypergroups. ⋮ Classification systems based on combinatorial semigroups ⋮ Centroid sets with largest weight in Munn semirings for data mining applications ⋮ OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Internet security applications of the Munn rings ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ On the Cayley Graphs of Brandt Semigroups ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA ⋮ Ideal basis in constructions defined by directed graphs
Uses Software
Cites Work
- Approximate amenability of certain semigroup algebras
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
- Biprefix codes, inverse semigroups and syntactic monoids of injective automata
- The lattice of pseudovarieties of inverse semigroups
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Representations and amalgamation of generalized inverse *-semigroups
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Generators and weights of polynomial codes
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- BoosTexter: A boosting-based system for text categorization
- A global optimization approach to classification
- The inverse braid monoid.
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- On cyclic codes in incidence rings
- Amalgamation for Inverse and Generalized Inverse Semigroups
- TURÁN’S GRAPH THEOREM AND MAXIMUM INDEPENDENT SETS IN BRANDT SEMIGROUPS
- Semigroups with zero whose idempotents form a subsemigroup
- Congruences on the Lattice of Pseudovarieties of Finite Semigroups
- PRINCIPAL REES QUOTIENTS OF FREE INVERSE SEMIGROUPS
- FINITE BANDS AND AMALGAMATION BASES FOR FINITE SEMIGROUPS
- An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
- Trace functions on inverse semigroup algebras
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- The radical of the algebra of any finite semigroup over any field
- Generating Sets of Completely 0-Simple Semigroups
- The study of drug–reaction relationships using global optimization techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A formula for multiple classifiers in data mining based on Brandt semigroups
