Dimensionality reduction via discretization

被引:22
作者
Liu, H
Setiono, R
机构
[1] Dept. of Info. Syst. and Comp. Sci., National University of Singapore
关键词
dimensionality reduction; discretization; knowledge discovery;
D O I
10.1016/0950-7051(95)01030-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The existence of numeric data and large numbers of records in a database present a challenging task in terms of explicit concepts extraction from the raw data. The paper introduces a method that reduces data vertically and horizontally, keeps the discriminating power of the original data, and paves the way for extracting concepts. The method is based on discretization (vertical reduction) and feature selection (horizontal reduction). The experimental results show that (a) the data can be effectively reduced by the proposed method; (b) the predictive accuracy of a classifier (C4.5) can be improved ai-ter data and dimensionality reduction; and (c) the classification rules learned are simpler.
引用
收藏
页码:67 / 72
页数:6
相关论文
共 11 条
[1]   LEARNING BOOLEAN CONCEPTS IN THE PRESENCE OF MANY IRRELEVANT FEATURES [J].
ALMUALLIM, H ;
DIETTERICH, TG .
ARTIFICIAL INTELLIGENCE, 1994, 69 (1-2) :279-305
[2]  
[Anonymous], 1993, C4 5 PROGRAMS MACHIN
[3]  
[Anonymous], P 10 NAT C ART INT S
[4]  
FRAWLEY W, 1992, AI MAGAZINE FAL
[5]  
HAN J, 1992, 18TH P INT C VER LAR, P547
[6]  
Liu H., 1995, P IEEE INT C SYST MA
[7]  
MATHEUS CJ, 1993, IEEE T KNOWLEDGE DAT, V5
[8]  
Ragavan H., 1993, P 10 INT C MACH LEAR, P252
[9]  
Wyse N., 1980, Pattern Recognition in Practice. Proceedings of an International Workshop, P415
[10]  
1992, INT J INTELLIGENT SY, V7