Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28753
Title: Using approximate reduct and LVQ in case generation for CBR classifiers
Authors: Li, Y
Shiu, SCK 
Pal, SK
Liu, JNK
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4400 lncs, no. part 2, p. 85-102 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: Case generation is a process of extracting representative cases to form a compact case base. In order to build competent and efficient CBR classifiers, we develop a case generation approach which integrates fuzzy sets, rough sets and learning vector quantization (LVQ). If the feature values of the cases are numerical, fuzzy sets are firstly used to discretize the feature spaces. Secondly, a fast rough set-based feature selection method is applied to identify the significant features. Different from the traditional discernibility function-based methods, the feature reduction method is based on a new concept of approximate reduct. The representative cases (prototypes) are then generated through LVQ learning process on the case bases after feature selection. LVQ is the supervised version of self-organizing map (SOM), which is more suitable to classification problems. Finally, a few of prototypes are generated as the representative cases of the original case base. These prototypes can be also considered as the extracted knowledge which improves the understanding of the case base. Three real life data are used in the experiments to demonstrate the effectiveness of this case generation approach. Several evaluation indices, such as classification accuracy, the storage space, case retrieval time and clustering performance in terms of intro-similarity and inter-similarity, are used in these testing.
URI: http://hdl.handle.net/10397/28753
ISBN: 9.78E+12
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

49
Last Week
5
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.