TY - GEN
T1 - Using approximate reduct and LVQ in case generation for CBR classifiers
AU - Li, Yan
AU - Shiu, Chi Keung Simon
AU - Pal, Sankar Kumar
AU - Liu, James Nga Kwok
PY - 2007/12/1
Y1 - 2007/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38149116988&partnerID=8YFLogxK
M3 - Conference article published in proceeding or book
SN - 9783540716624
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 102
BT - Transactions on Rough Sets VII
ER -