A formula for multiple classifiers in data mining based on Brandt semigroups
From MaRDI portal
Publication:1014262
DOI10.1007/S00233-008-9098-9zbMATH Open1168.94007OpenAlexW1971925482MaRDI QIDQ1014262FDOQ1014262
Authors: J. L. Yearwood, A. V. Kelarev, Musa 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
Recommendations
- Optimization of classifiers for data mining based on combinatorial semigroups
- An algorithm for the optimization of multiple classifiers in data mining based on graphs
- A formula for multi-class distributed classifiers
- AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
- AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
- A rough set approach to multiple classifier systems
- scientific article; zbMATH DE number 3988506
- Multi-class decision-theoretic rough sets
- Minimax semi-supervised set-valued approach to multi-class classification
- A new mathematical programming approach to multi-group classification problems
Applications of statistics in engineering and industry; control charts (62P30) Linear codes (general theory) (94B05) Theory of data (68P99)
Cites Work
- Title not available (Why is that?)
- BoosTexter: A boosting-based system for text categorization
- Title not available (Why is that?)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Ring constructions and applications
- A description of incidence rings of group automata.
- Title not available (Why is that?)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Title not available (Why is that?)
- Generating Sets of Completely 0-Simple Semigroups
- A global optimization approach to classification
- Generators and weights of polynomial codes
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Presentations of factorizable inverse monoids.
- Semigroups with zero whose idempotents form a subsemigroup
- Turán's graph theorem and maximum independent sets in Brandt semigroups.
- Biprefix codes, inverse semigroups and syntactic monoids of injective automata
- Representations and amalgamation of generalized inverse *-semigroups
- Amalgamation for Inverse and Generalized Inverse Semigroups
- 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
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Approximate amenability of certain semigroup algebras
- FINITE BANDS AND AMALGAMATION BASES FOR FINITE SEMIGROUPS
- The inverse braid monoid.
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
- Title not available (Why is that?)
- The lattice of pseudovarieties of inverse semigroups
- On cyclic codes in incidence rings
- PRINCIPAL REES QUOTIENTS OF FREE INVERSE SEMIGROUPS
- An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
- Title not available (Why is that?)
- The study of drug–reaction relationships using global optimization techniques
Cited In (14)
- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Rees semigroups of digraphs for classification of data.
- Optimization of classifiers for data mining based on combinatorial semigroups
- Internet security applications of the Munn rings
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Ideal basis in constructions defined by directed graphs
- An algorithm for the optimization of multiple classifiers in data mining based on graphs
- Rees matrix constructions for clustering of data.
- On the Cayley graphs of Brandt semigroups.
- Classification systems based on combinatorial semigroups
- Internet security applications of Gröbner-Shirshov bases
- 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
- On hyperideals in left almost semihypergroups.
Uses Software
This page was built for publication: A formula for multiple classifiers in data mining based on Brandt semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014262)
