Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,350,534 papers from all fields of science
Search
Sign In
Create Free Account
Alternating decision tree
Known as:
ADT
, ADTree
An alternating decision tree (ADTree) is a machine learning method for classification. It generalizes decision trees and has connections to boosting…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Boosting (machine learning)
BrownBoost
Decision stump
Decision tree learning
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
An Advanced Approach for Choosing Security Patterns and Checking their Implementation
S. Salva
,
Loukmen Regainia
arXiv.org
2020
Corpus ID: 220380875
This paper tackles the problems of generating concrete test cases for testing whether an application is vulnerable to attacks…
Expand
2016
2016
Predictive modeling of the first year evaluation based on demographics data: Case study students of Telkom University, Indonesia
Tora Fahrudin
,
J. L. Buliali
,
Chastine Fatichah
International Conference on Data and Software…
2016
Corpus ID: 37583627
Student academic failure prediction is still interesting topics in the Educational Data Mining. One of the challenges is how to…
Expand
Review
2016
Review
2016
A Comparison And Prediction Analysis For The Diagnosis Of Parkinson Disease Using Data Mining Techniques On Voice Datasets
Tarigoppula V. S. Sriram
2016
Corpus ID: 8518293
After Alzheimer‘s, the most dangerous neurological disorder is Parkinson Disease (PD). The problem with these disorders are once…
Expand
2015
2015
Precognition of Students Academic Failure Using Data Mining Techniques
S. Fatima
,
S. Attar
2015
Corpus ID: 51987273
This paper proposes to pre-recognize student's academic failure. Real time data on school or graduating students from an…
Expand
2014
2014
A semantic-based approach for representing successful graduate predictive rules
Noppamas Pukkhem
International Conference on Advanced…
2014
Corpus ID: 20513875
This paper seeks to identify the factors of university students in major of Computer Science at Thaksin University, Thailand that…
Expand
Review
2014
Review
2014
Diagnosis of Parkinson Disease Using Machine Learning and Data Mining Systems from Voice Dataset
Tarigoppula V. S. Sriram
,
M. Rao
,
G. V. S. Narayana
,
D. Kaladhar
International Conference on Frontiers in…
2014
Corpus ID: 44991509
Parkinson’s disease is one of the most painful, dangerous and non curable diseases which occurs at older ages (mostly above 50…
Expand
2012
2012
A fast calculation of metric scores for learning Bayesian network
Q. Lv
,
Xiaoyan Xia
,
Peide Qian
International Journal of Automation and Computing
2012
Corpus ID: 17763281
Frequent counting is a very so often required operation in machine learning algorithms. A typical machine learning task, learning…
Expand
2010
2010
Complex feature alternating decision tree
Y. Kuang
,
M. Ooi
International Journal of Intelligent Systems…
2010
Corpus ID: 26902254
Complex number features are ubiquitous in many engineering and scientific applications. Many traditional classification…
Expand
2009
2009
A flexible electronic nose for odor discrimination using different methods of classification
J. Chilo
,
G. Horvath
,
T. Lindblad
,
R. Olsson
,
J. Redeby
,
J. Roeraade
IEEE-NPSS Real-Time Conference
2009
Corpus ID: 23921171
Ovarian cancer is one of the leading causes of death from cancer in women. The lifetime risk is around 1.5%, which makes it the…
Expand
2008
2008
Adapting ADtrees for High Arity Features
R. V. Dam
,
Irene Langkilde-Geary
,
D. Ventura
AAAI Conference on Artificial Intelligence
2008
Corpus ID: 1243036
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE