English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29620800      線上人數 : 336
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/8856

題名: An Approach to Mining the Multi-relational Imbalanced Database
作者: Chien-I Lee;Cheng-Jung Tsai;Tong-Qin Wu;Wei-Pang Yang
貢獻者: 數學系
關鍵詞: Data mining;Classification;Imbalance;Relational database
日期: 2008-05
上傳時間: 2011-05-10T06:28:56Z
出版者: Elsevier Science
摘要: 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
關聯: Expert Systems with Applications, 34(4):3021-3032
顯示於類別:[數學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
2020102110001.pdf387KbAdobe PDF1475檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋