An approach to mining the multi-relational imbalanced database

  • Authors:
  • Chien-I Lee;Cheng-Jung Tsai;Tong-Qin Wu;Wei-Pang Yang

  • Affiliations:
  • Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan, ROC;Department of Information Management, National Dong Hwa University, Hualien, Taiwan, ROC

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 12.06

Visualization

Abstract

The class imbalance problem is an important issue in classification of Data mining. For example, in the applications of fraudulent telephone calls, telecommunications management, and rare diagnoses, users would be more interested in the minority than the majority. Although there are many proposed algorithms to solve the imbalanced problem, they are unsuitable to be directly applied on a multi-relational database. Nevertheless, many data nowadays such as financial transactions and medical anamneses are stored in a multi-relational database rather than a single data sheet. On the other hand, the widely used multi-relational classification approaches, such as TILDE, FOIL and CrossMine, are insensitive to handle the imbalanced databases. In this paper, we propose a multi-relational g-mean decision tree algorithm to solve the imbalanced problem in a multi-relational database. As shown in our experiments, our approach can more accurately mine a multi-relational imbalanced database.