ESRS: a case selection algorithm using extended similarity-based rough sets

A case selection algorithm selects representative cases from a large data set for future case-based reasoning tasks. This paper proposes the ESRS algorithm, based on extended similarity-based rough set theory, which selects a reasonable number of the representative cases while maintaining satisfacto...

Full description

Saved in:
Bibliographic Details
Main Authors: Liqiang Geng, Hamilton, H.J.
Format: Conference Proceeding
Language:English
Subjects:
Accuracy
Clustering algorithms
Computer aided software engineering
Computer science
Frequency
Machine learning algorithms
Nearest neighbor searches
Paramagnetic resonance
Rough sets
Set theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A case selection algorithm selects representative cases from a large data set for future case-based reasoning tasks. This paper proposes the ESRS algorithm, based on extended similarity-based rough set theory, which selects a reasonable number of the representative cases while maintaining satisfactory classification accuracy. It also can handle noise and inconsistent data. Experimental results on synthetic and real sets of cases showed that its predictive accuracy is similar to that of well-known machine learning systems on standard data sets, while it has the advantage of being applicable to any data set where a similarity function can be defined.
DOI:10.1109/ICDM.2002.1184010