SIMPLE ALGORITHMS FOR SOME CLASSIFICATION PROBLEMS

Authors
OLARIU S RAO NSV
Citation
S. Olariu et Nsv. Rao, SIMPLE ALGORITHMS FOR SOME CLASSIFICATION PROBLEMS, Pattern recognition letters, 17(2), 1996, pp. 163-167
Citations number
7
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
Pattern recognition letters → ACNP
ISSN journal
01678655
Volume
17
Issue
2
Year of publication
1996
Pages
163 - 167
Database
ISI
SICI code
0167-8655(1996)17:2<163:SAFSCP>2.0.ZU;2-M
Abstract
Consider two classifiers C-1 and C-2 each partitioning a collection A of n objects into classes based on respective sets of features. In a n umber in pattern recognition and knowledge engineering applications, t he following problems arise: given the two partitions generated by C-1 and C-2, compute new partitions by considering (i) the features commo n to both classifiers, and (ii) the features of either of the classifi ers. We show that both problems can be solved in Theta(n log n) time u sing very simple algorithms.