Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1168.94007
Kelarev, A.V.; Yearwood, J.L.; Mammadov, M.A.
A formula for multiple classifiers in data mining based on Brandt semigroups.
(English)
[J] Semigroup Forum 78, No. 2, 293-309 (2009). ISSN 0037-1912

Classification of data plays one of the central roles in data mining and in practical applications of artificial intelligence methods in general (see [{\it J. L. Yearwood} and {\it M. A. Mammadov}, Classification technologies: optimization approaches to short text categorization. Tdea Group Inc. (2007)]). A well-known method of designing efficient multiple classifiers consists in representing them as several binary classifiers combined in one scheme. The main advantage of using combined multiple classifiers is that they can correct errors of individual binary classifiers and produce correct classifications despite individual classification errors. The problem of finding the number of errors of individual binary classifiers that a multiple classifier can correct in general is rather complicated. It is well-known that in full generality this problem is related to several other very difficult algorithmic problems (see [{\it J. L. Yearwood} and {\it M. A. Mammadov} [loc. cit.]). This note uses semigroup rings to introduce additional structure on the class sets of multiple classifiers, which makes it possible to generate these sets with a small number of generators. In special case of Brandt semigroups and their subsemigroups the authors have obtained a fairly concise formula for the number of errors of binary classifiers, which can be corrected by the corresponding multiple classifiers. This formula is the main result of paper. Examples are given to show that the formula does not directly generalize to all inverse semigroups and other classes of semigroups.
[Aleksandr V. Tishchenko (Moskva)]
MSC 2000:
*94B05 General theory of linear codes
68P99 Theory of data
62P30 Applications in engineering and industry

Keywords: classification; data mining; error-correcting codes; Brandt semigroup; semigroup rings

Cited in: Zbl 1233.16021

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster