Mining Data by Query-Based Error-Propagation
Author(s) -
Liang-Bin Lai,
Ray-I Chang,
Jen-Shaing Kouh
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-28323-4
DOI - 10.1007/11539087_162
Subject(s) - computer science , cardinality (data modeling) , data mining , artificial neural network , set (abstract data type) , machine learning , scheme (mathematics) , data set , training set , artificial intelligence , mathematics , mathematical analysis , programming language
Neural networks have advantages of the high tolerance to noisy data as well as the ability to classify patterns having not been trained. While being applied in data mining, the time required to induce models from large data sets are one of the most important considerations. In this paper, we introduce a query-based learning scheme to improve neural networks' performance in data mining. Results show that the proposed algorithm can significantly reduce the training set cardinality. Additionally, the quality of training results can be also ensured. Our future work is to apply this concept to other data mining schemes and applications.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom