2018 9th International Conference on Information Technology in Medicine and Education (ITME) 2018
DOI: 10.1109/itme.2018.00188
|View full text |Cite
|
Sign up to set email alerts
|

Intelligent Placement Model Based on Decision Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…The performance of students can be evaluated from various aspects. Several studies evaluated students in general in terms of student performance [18][19][20][21][22] and some other studies evaluated students for a specific purpose such as academic achievement [23,24], reading ability [25,26], grading [27][28][29], dropout prediction [30][31][32][33], etc. Below, some state-of-the-art research studies have been discussed for each of the mentioned tasks that evaluated the student performance from different aspects.…”
Section: Related Workmentioning
confidence: 99%
“…The performance of students can be evaluated from various aspects. Several studies evaluated students in general in terms of student performance [18][19][20][21][22] and some other studies evaluated students for a specific purpose such as academic achievement [23,24], reading ability [25,26], grading [27][28][29], dropout prediction [30][31][32][33], etc. Below, some state-of-the-art research studies have been discussed for each of the mentioned tasks that evaluated the student performance from different aspects.…”
Section: Related Workmentioning
confidence: 99%
“…Since the likelihood probability is 100% for the observed state and 0% for the rest, the probability of the state only depends on the transition probability between the state to the observed state if the descendant is a leaf node. Let X denote the input data, x denote the i-th alignment site of X, τ denote the tree topology of Mi+1, Sk represent a residue state of the node under estimation, Sσi(k) and Sσj(k) represent the left and right descendant nodes, P represent the transition probabilities between nucleotide states, θ denote the parameters of the evolutionary model calculating P, a comprehensive pruning algorithm [44][45][46] is applied to calculate the likelihood probability of Sk for each arbitrary internal node:…”
Section: Fig 2 Amentioning
confidence: 99%
“…In order to improve the generalization ability, CART needs to be pruned before it is transformed into final decision rules. The bagging algorithm [44,45] (4). For each split, the optimization target is to search splitting feature and value, i.e.…”
Section: Cart and Baggingmentioning
confidence: 99%