Sciweavers

59 search results - page 7 / 12
» Learning Tree Augmented Naive Bayes for Ranking
Sort
View
ECML
2004
Springer
15 years 9 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
JMLR
2008
111views more  JMLR 2008»
15 years 4 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
KAIS
2008
79views more  KAIS 2008»
15 years 4 months ago
Top 10 algorithms in data mining
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, Page...
Xindong Wu, Vipin Kumar, J. Ross Quinlan, Joydeep ...
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
15 years 10 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo
ICML
2000
IEEE
16 years 5 months ago
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
Mark A. Hall