Multivariate supervised discretization, a neighborhood graph approach

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 314-320

  Muhlenbach, Fabrice ^a   Rakotomalala, Ricco ^a  

^a UNIVERSITÉ LUMIÈRE LYON 2   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750319966     PISSN: 15504786     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. S. D. Bay. Multivariate discretization for set raining. Knowledge and Information Systems, 3(4):491-512, 2001
2. C. L. Blake and C. J. Merz. UCI repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science [http://www.ics.uci.edu/˜mlearn/MLRepository.html], 1998
3. M. R. Chmielewski and J. W. Grzymala-Busse. Global discretization of continuous attributes as preprocessing for machine learning. In Third International Workshop on Rough Sets and Soft Computing, pages 294-301, 1994
4. J. Dougherty, R. Kohavi, and M. Sahami. Supervised and unsupervised discretization of continuous features. In International Conference on Machine Learning (ICML95), pages 194-202, 1995
5. th International Joint Conference on Artificial Intelligence, pages 1022-1027, 1993
6. th International Conference on Machine Learning, pages 115-123. Morgan Kaufmann, San Francisco, CA, 1999
7. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. P-IEEE, 80:1502-1517, 1992
8. R. Kohavi and M. Sahami. Error-based and entropy-based discretization of continuous features. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pages 114-119, 1996
9. th IEEE International Conference on Tools with Artificial Intelligence, 1995
10. th European Conference for Principles of Data Mining and Knowledge Discovery (PKDD'2000), pages 148-158. Springer-Verlag, 2000
11. T. Mitchell. Machine learning. McGraw Hill, 1997
12. F. Muhlenbach, D. A. Zighed, and S. D'Hondt. Génération de règles par compression, ECA, 1(1-2):93-104, 2001
13. J. J. Oliver. Decision graphs - an extension of decision trees. In Proceedings of the Fourth International Workshop on Artificial Intelligence and Statistics, pages 343-350, 1993
14. F. P. Preparata and M. I. Shamos. Computational Geometry, an introduction. Springer-Verlag, New York, 2nd edition, 1988. First edition: 1985
15. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986
16. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993
17. S. Rabaséda, M. Sebban, and R. Rakotomalala. A comparison of some contextual discretization methods. Information Sciences: Intelligent Systems, 92(1-4):137-157, 1996. (Pubitemid 126379770)
18. M. Sebban and A. Lamole. String clustering and statistical validation of clusters. In R. E. Mercer and E. Neufeld, editors, Proceedings of Advances in Artificial Intelligence (AI'98), pages 298-309. Springer Verlag, 1998
19. C. Stanfill and D. Waltz. Towards memory-based reasoning. Communications of the ACM, 29(12):1213-1228, 1986
20. G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern recognition, 12:261-268, 1980
21. D. A. Zighed, J. P. Auray, and G. Dura. SIPINA : Méthode et logiciel. Lacassagne, 1992
22. D. A. Zighed, S. Rabaséda, and R. Rakotomalala. Fusinter: a method for discretization of continuous attributes for supervised learning. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 6(33):307-326, 1998