Abstract
In a relational database, classification algorithms are used to look for patterns across several interconnected relations. Most of the methods for multi-relational classification algorithms implicitly assume that the classes in the target relation are equally represented. Thus, they tend to produce poor predictive performance over the imbalanced dataset. In this paper, the authors propose an algorithm-level method MCMRC_IB for the classification of imbalanced multi-relational dataset. The proposed method extends MCMRC which is for balanced datasets. MCMRC_IB exploits the property of the imbalanced datasets that the minority class is represented by a smaller number of records usually 20-30% of the total records and is to be dealt accordingly by giving them weightages. The proposed method is able to handle multiple classes. Experimental results conðrm the efficiency of the proposed method in terms of predictive accuracy, F-measure, and G-mean.
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 callMore From: International Journal of Information Technology and Web Engineering
Disclaimer: 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.
