On the Consistency of Information Filters for Lazy Learning Algorithms

@inproceedings{Brighton1999OnTC,
  title={On the Consistency of Information Filters for Lazy Learning Algorithms},
  author={Henry Brighton and Chris Mellish},
  booktitle={PKDD},
  year={1999}
}
A common practice when ltering a case-base is to employ a ltering scheme that decides which cases to delete, as well as how many cases to delete, such that the storage requirements are minimized and the classiication competence is preserved or improved. We introduce an algorithm that rivals the most successful existing algorithm in the average case when ltering 30 classiication problems. Neither algorithm consistently outperforms the other, with each performing well on diierent problems. We… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

Mining competent case bases for case-based reasoning

Artif. Intell. • 2007
View 15 Excerpts
Highly Influenced

Hit Miss Networks with Applications to Instance Selection

Journal of Machine Learning Research • 2008
View 6 Excerpts
Highly Influenced

Advances in Case-Based Reasoning

Lecture Notes in Computer Science • 2000
View 10 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Information ltering for lazy learning algorithms

P. E. Hart
Masters Thesis • 1997

An experiment with the edited nearest - neighbor rule

C. S. Mellish
IEEE Transactionson Systems , Man , and Cybernetics , SMC - • 1995

Information ltering : Selection mechanisms inlearning systems

P. D. Scott
Machine Learning • 1993

Remembering to forget

M. T. Keane.
1986

Nearest neighbor pattern classi cation

Janet L. Kolodner, Calif. SanMateo
Institute ofElectrical and Electronics Engineers Transactions on Information Theory , IT - • 1967

Similar Papers

Loading similar papers…