Identifying and eliminating irrelevant instances using information theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1822, Issue , 2000, Pages 90-101

  Sebban, Marc ^a   Nock, Richard ^a  

^a UNIVERSITÉ DE GUYANE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; INFORMATION THEORY; TOPOLOGY;

CLASSICAL APPROACH; CLASSIFICATION ACCURACY; GLOBAL UNCERTAINTY; NEAREST NEIGHBORS; PROTOTYPE SELECTION; STATISTICAL CRITERION; STATISTICAL FRAMEWORK;

INFORMATION USE;

EID: 76549111507     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45486-1_8     Document Type: Article

References (23)

1. D. Aha, D. Kibler, and M. Albert. Instance-based learning algorithms. Machine Learning, 6:37-66, 1991.
2. H. Brighton and C. Mellish. On the consistency of information filters for lazy learning algorithms. In Third European Conference on Principles and Practices of Knowledge Discovery in Databases, PKDD’99, pages 283-288, 1999.
3. C. Brodley. Adressing the selective superiority problem: Automatic algorithm/ model class selection. In Tenth International Machine Learning Conference (Amherst), pages 17-24, 1993.
4. C. Brodley and M. Friedl. Identifying and eliminating mislabeled training instances. In Thirteen National Conference on Artificial Intelligence, 1996.
5. T. Cover and P. Hart. Nearest neighbor pattern classification. IEEE. Trans. Info. Theory, IT13:21-27, 1967.
6. P. Domingos. Rule induction and instance-based learning: a unified approach. In International Joint Conference on Artificial Intelligence (IJCAI-95), 1995.
7. Y. Freund and R. Schapire. Experiments with a new boosting algorithm. Proc. of the 13th International Conference on Machine Learning, 1996.
8. G. Gates. The reduced nearest neighbor rule. IEEE Trans. Inform. Theory, pages 431-433, 1972.
9. P. Hart. The condensed nearest neighbor rule. IEEE Trans. Inform. Theory, pages 515-516, 1968.
10. M. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 459-468, 1996.
11. D. Koller and R. Sahami. Toward optimal feature selection. In Thirteenth International Conference on Machine Learning (Bari-Italy), 1996.
12. R. Light and B. Margolin. An analysis of variance for categorical date. Journal of the American Statistical Association (66), pages 534-544, 1971.
13. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidencerated predictions. In Proceedings of the Eleventh Annual ACM Conference on Computational Learning Theory, pages 80-91, 1998.
14. M. Sebban. On feature selection: a new filter model. In Twelfth International Florida AI Research Society Conference, pages 230-234, 1999.
15. M. Sebban and R. Nock. Contribution of boosting in wrapper models. In Third European Conference on Principles and Practices of Knowledge Discovery in Databases, PKDD’99, pages 214-222, 1999.
16. D. Skalak. Prototype and feature selection by sampling and random mutation hill climbing algorithms. In 11th International Conference on Machine Learning, pages 293-301, 1994.
17. D. Skalak. Prototype selection for composite nearest neighbors classifiers. In Technical report UM-CS-1996-089, 1996.
18. R. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6:579-589, 1991.
19. Wettschereck and T. Dietterich. A hybrid nearest-neighbor and nearesthyperrectangle algorithm. In 7th European Machine Learning Conference (Amherst), 1994.
20. D. Wettschereck and T. Dietterich. An experimental comparison of the nearest neighbor and nearest hyperrectangle algorithms. In Machine Learning, 19, pages 5-28, 1995.
21. D. Wilson and T. Martinez. Instance pruning techniques. In Proc. of the Fourteenth International Conference in Machine Learning, pages 404-411, 1997.
22. D. Wilson and T. Martinez. Reduction techniques for exemplar-based learning algorithms. In Machine Learning, 1998.
23. J. Zhang. Selecting typical instances in instance-based learning. In Proc. of the Ninth International Machine Learning Workshop, pages 470-479, 1992.