A novel border identification algorithm based on an "anti- Bayesian" paradigm
Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the border of the classes, and have sufficient information to perform a meaningful classification. However, one can see that the true border patterns ("near" border) are not able to perform the task independently as they are not able to always distinguish the testing samples. Thus, researchers have worked on this issue so as to find a way to strengthen the "border" set. A recent development in this field tries to add more border patterns, i.e., the "far" borders, to the border set, and this process continues until it reaches a stage at which the classification accuracy no longer increases. In this case, the cardinality of the border set is relatively high. In this paper, we aim to design a novel BI algorithm based on a new definition for the term "border". We opt to select the patterns which lie at the border of the alternate class as the border patterns. Thus, those patterns which are neither on the true discriminant nor too close to the central position of the distributions, are added to the "border" set. The border patterns, which are very small in number (for example, five from both classes), selected in this manner, have the potential to perform a classification which is comparable to that obtained by well-known traditional classifiers like the SVM, and very close to the optimal Bayes' bound.
|Series||Lecture Notes in Computer Science|
Thomas, A. (Anu), & Oommen, J. (2013). A novel border identification algorithm based on an "anti- Bayesian" paradigm. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-40261-6_23