Sciweavers

55 search results - page 7 / 11
» A new metric splitting criterion for decision trees
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 12 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim
BMCBI
2005
100views more  BMCBI 2005»
13 years 7 months ago
EvDTree: structure-dependent substitution profiles based on decision tree classification of 3D environments
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
Jean-Christophe Gelly, Laurent Chiche, Jér&...
HIS
2008
13 years 9 months ago
REPMAC: A New Hybrid Approach to Highly Imbalanced Classification Problems
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
Hernán Ahumada, Guillermo L. Grinblat, Luca...
AUSAI
2006
Springer
13 years 11 months ago
Lazy Learning for Improving Ranking of Decision Trees
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
Han Liang, Yuhong Yan
ICTAI
2006
IEEE
14 years 1 months ago
Improve Decision Trees for Probability-Based Ranking by Lazy Learners
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
Han Liang, Yuhong Yan