Learning weighted naive bayes with accurate ranking

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 567-570

  Zhang, Harry ^a   Sheng, Shengli ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GAIN RATIO METHOD; MARKOV CHAIN MONTE CARLO METHOD; NAIVE BAYES; POSTERIOR PROBABILITY;

DATA MINING; FUNCTIONS; HIERARCHICAL SYSTEMS; LEARNING ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; SET THEORY;

ALGORITHMS;

EID: 19544366243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10030     Document Type: Conference Paper

References (7)

1. P. Domingos and M. Pazzani. Beyond independence: Conditions for the optimality of the simple Bayesian classifier. Machine Learning, 29:103-130, 1997.
2. U. Fayyad and K. Irani. Multi-interval discretization of continuous-valued attributes for classification learning. Proceedings of Thirteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1993.
3. N. Friedman, D. Geiger, and M. Goldszmidt. Bayesian network classifiers. Machine Learning, 29:131-163, 1997.
4. C. X. Ling, J. Huang, and H. Zhang. AUC: a statistically consistent and more discriminating measure than accuracy. Proceedings of the International Joint Conference on Artificial Intelligence IJCAI03. Morgan Kaufmann, 2003.
5. C. Merz, P. Murphy, and D. Aha. UCI repository of machine learning databases. 1997.
6. F. J. Provost and P. Domingos. Tree induction for probability-based ranking. Machine Learning, 52(3): 199-215, 2003.
7. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.