Tree induction for probability-based ranking
From MaRDI portal
Publication:1402266
DOI10.1023/A:1024099825458zbMath1039.68105OpenAlexW1509515766MaRDI QIDQ1402266
Pedro Domingos, Foster Provost
Publication date: 20 August 2003
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024099825458
classificationrankingdecision treesbaggingprobability estimationcost-sensitive learningLaplace correction
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (27)
Empowering difficult classes with a similarity-based aggregation in multi-class classification problems ⋮ ADAPTIVE FUZZY LOGIC-BASED FRAMEWORK FOR HANDLING IMPRECISION AND UNCERTAINTY IN CLASSIFICATION OF BIOINFORMATICS DATASETS ⋮ EMPIRICAL EVALUATION OF CLASSIFIERS FOR SOFTWARE RISK MANAGEMENT ⋮ Logitboost autoregressive networks ⋮ Combining biomarkers to optimize patient treatment recommendations ⋮ Cost-sensitive business failure prediction when misclassification costs are uncertain: a heterogeneous ensemble selection approach ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Hellinger distance decision trees are robust and skew-insensitive ⋮ Adaptive partitioning schemes for bipartite ranking ⋮ Naive Bayes for optimal ranking ⋮ Classification confidence weighted majority voting using decision tree classifiers ⋮ A comparison of pruning criteria for probability trees ⋮ A probabilistic classifier ensemble weighting scheme based on cross-validated accuracy estimates ⋮ Tractability of most probable explanations in multidimensional Bayesian network classifiers ⋮ Discrete-time survival forests with Hellinger distance decision trees ⋮ Time-based detection of changes to multivariate patterns ⋮ Causal learning with Occam's razor ⋮ Combining Multiple Markers for Classification Using ROC ⋮ Learning probabilistic decision graphs ⋮ Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks ⋮ A critical analysis of variants of the AUC ⋮ A classification tree approach for the modeling of competing risks in discrete time ⋮ A survey on semi-supervised learning ⋮ Forecasting cancellation rates for services booking revenue management using data mining ⋮ A reference model for customer-centric data mining with support vector machines ⋮ Decision tree learning with fuzzy labels ⋮ Probability estimation with machine learning methods for dichotomous and multicategory outcome: Theory
This page was built for publication: Tree induction for probability-based ranking
