A self-optimizing approach for knowledge acquisition with adaptively incremental sampling

The paper outlines a self-optimizing approach for knowledge acquisition with adaptively incremental sampling, which fused the self-optimizing approach for knowledge acquisition and sampling approaches in order to improve the efficiency of knowledge acquisition effectively. The proposed sampling approach enabled us to dynamically and adaptively adjust the sample size according to the data mining algorithm's performance on the training samples so as to utilize the sample size as small as possible without reducing the accuracy of the knowledge model. Finally, the self-optimizing approach for knowledge acquisition with adaptively incremental sampling was applied to rule generation from the diagnostic decision table for rheumatoid arthritis in Chinese medical science. Experimentation results showed that the approach was much better than other algorithms both in efficiency and in accuracy.

[1]  Mohamed Quafafou,et al.  Scalable Feature Selection Using Rough Set Theory , 2000, Rough Sets and Current Trends in Computing.

[2]  Huan Liu,et al.  Neural-network feature selector , 1997, IEEE Trans. Neural Networks.

[3]  Pat Langley,et al.  Static Versus Dynamic Sampling for Data Mining , 1996, KDD.

[4]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[5]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[6]  Huan Liu,et al.  Some issues on scalable feature selection , 1998 .

[7]  Tim Oates,et al.  Efficient progressive sampling , 1999, KDD '99.

[8]  Pat Langley,et al.  Selection of Relevant Features and Examples in Machine Learning , 1997, Artif. Intell..