Abstract

Today's real time applications data are stored in relational databases. In conventional approach to mine data, we often use to join several relations to form a single relation using foreign key links, which is known as flatten. Flatten may cause problems such as time consuming, data redundancy and statistical skew on data. Hence, how to mine data directly on numerous relations become a critical issue. The solution of the given issue is the approach called multi-relational data mining (MRDM) which has been successfully applied in a variety of areas, such as marketing, sales, finance, fraud detection, natural sciences, biological. There has been many ILP-based methods proposed in previous researches, but there are still problems unsolved such as scalability i.e. how to handle large dataset with large number of relations with large number of features. Irrelevant or redundant attributes in a relation may not make contribution to classification accuracy. Thus, feature selection is an essential data preprocessing step in multi-relational data mining. By filtering out irrelevant or redundant features from relations for data mining, we improve classification accuracy, achieve good time performance, and improve comprehensibility of the models. We had proposed the method MR-MNBC which is based on MaxRel feature selection as a preprocessing task for Multi-relational Naïve Bayesian Classifier. MaxRel method uses InfoDist and Pearson's Correlation parameters, which will be used to filter out irrelevant and redundant features from the multi-relational database and will enhance classification accuracy. We analyzed our algorithm over PKDD financial dataset and got the better accuracy compare to the existing features selection methods.

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 call

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.