Abstract
In search for subsets of data sets relevant in the classification of data tasks, we have exploited the betweenness relation adopted from axiomatic elementary geometry. It has turned out that this relation can partition data into two subsets, one of them dense in the sense that each object in this set is a convex combination of a finite number of objects in it, the other, to the contrary, consisting of objects endowed with outliers, i.e., pairs of (attribute, value) not possessed by any other object. A technical tool for singling out those subsets is the Dual Indiscernibility Matrix defined as a counterpart to a well-known Discernibility Matrix of Skowron-Rauszer. On the basis of those ideas, the pair Classifier has been introduced. It is its main feature that test objects are approximated to a certain degree by pairs of training objects which are not required to cover the object completely. In this chapter, we examine selected methods for stabilization of the Pair Classifier like Bootstrap Ensemble, Arcing based Bootstrap, Ada–Boost with Monte Carlo split. We present results of experiments with some standard data sets. Consecutive sections are dedicated to basics of the method: Dual Indiscernibility Matrix, Kernel and residuum in data sets, Pair Classifier, Experiments, Discussion of results, Conclusion and Perspectives.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
