DocumentCode
2546165
Title
Fragmentation problem and automated feature construction
Author
Setiono, Rudy ; Liu, Huan
Author_Institution
Sch. of Comput., Nat. Univ. of Singapore, Singapore
fYear
1998
fDate
10-12 Nov 1998
Firstpage
208
Lastpage
215
Abstract
Selective induction algorithms are efficient in learning target concepts but inherit a major limitation each time only one feature is used to partition the data until the data is divided into uniform segments. This limitation results in problems like replication, repetition, and fragmentation. Constructive induction has been an effective means to overcome some of the problems. The underlying idea is to construct compound features that increase the representation power so as to enhance the learning algorithm´s capability in partitioning data. Unfortunately, many constructive operators are often manually designed and choosing which one to apply poses a serious problem itself. We propose an automatic way of constructing compound features. The method can be applied to both continuous and discrete data and thus all the three problems can be eliminated or alleviated. Our empirical results indicate the effectiveness of the proposed method
Keywords
data handling; divide and conquer methods; learning by example; automated feature construction; compound features; concept learning; constructive induction; constructive operators; continuous data; data partitioning; discrete data; divide and conquer; fragmentation problem; repetition; replication; selective induction algorithms; Decision trees; Human computer interaction; Information resources; Partitioning algorithms; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 1998. Proceedings. Tenth IEEE International Conference on
Conference_Location
Taipei
ISSN
1082-3409
Print_ISBN
0-7803-5214-9
Type
conf
DOI
10.1109/TAI.1998.744845
Filename
744845
Link To Document