Abstract
This papers compares the behavior of three linear classifiers modeled on both the feature space and the dissimilarity space when the class imbalance of data sets interweaves with small disjuncts and noise. To this end, experiments are carried out over three synthetic databases with different imbalance ratios, levels of noise and complexity of the small disjuncts. Results suggest that small disjuncts can be much better overcome on the dissimilarity space than on the feature space, which means that the learning models will be only affected by imbalance and noise if the samples have firstly been mapped into the dissimilarity space.
Sign-in/Register to access full text options 
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.
