2009 WASE International Conference on Information Engineering 2009
DOI: 10.1109/icie.2009.12
|View full text |Cite
|
Sign up to set email alerts
|

Combining Classifier Based on Decision Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0
1

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 5 publications
0
8
0
1
Order By: Relevance
“…It is a Supervised Machine Learning [17,18] algorithm which continuously divides data based on some parameters or attributes. The main components of a decision tree are stated below:…”
Section: Decision Tree Classifiermentioning
confidence: 99%
“…It is a Supervised Machine Learning [17,18] algorithm which continuously divides data based on some parameters or attributes. The main components of a decision tree are stated below:…”
Section: Decision Tree Classifiermentioning
confidence: 99%
“…Tek bir algoritmaya göre daha iyi sonuç vermektedir. TÖ, en iyi sınıflandırma yöntemlerinden biridir [17]. Ayrıca genelleme yetenekleri oldukça güçlüdür.…”
Section: Topluluk öğRenmeunclassified
“…First, each traveler is assigned a unique contextual preference model built using their data. For this purpose, THOR uses various well-known classification algorithms-i.e., K-Nearest Neighbors (KNN) [19], Support Vector Classifier (SVC) [20], Decision Tree (DT) [21], Random Forest (RF) [22], and Logistic Regression (LR) [23]-and finds the best set of hyper-parameters. Then, when the system receives a set of travel offers to be shown to the user, it exploits the contextual preference model to determine, for each offer, the probability that the user will buy it and ranks the offers accordingly.…”
Section: Introductionmentioning
confidence: 99%