2007
DOI: 10.1016/j.patrec.2006.08.013
|View full text |Cite
|
Sign up to set email alerts
|

Combining multiple class distribution modified subsamples in a single tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0
3

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 43 publications
(28 citation statements)
references
References 8 publications
0
25
0
3
Order By: Relevance
“…Testuinguru honetan, ALDAPA ikerketa-taldeak zuhaitz kontsolidatuak sortzeko algoritmoa proposatu zuen, CTC (Consolidated Tree Construction) algoritmoa, hain zuzen [12,13]. Algoritmo honek lagin multzo bat erabiltzen du eta zuhaitzak pausuz pausu sortzen diren heinean, hauen erabakietan oinarrituta, beste zuhaitz bat sortzen du, zuhaitz kontsolidatua deritzona, hain zuzen.…”
Section: Sarreraunclassified
See 1 more Smart Citation
“…Testuinguru honetan, ALDAPA ikerketa-taldeak zuhaitz kontsolidatuak sortzeko algoritmoa proposatu zuen, CTC (Consolidated Tree Construction) algoritmoa, hain zuzen [12,13]. Algoritmo honek lagin multzo bat erabiltzen du eta zuhaitzak pausuz pausu sortzen diren heinean, hauen erabakietan oinarrituta, beste zuhaitz bat sortzen du, zuhaitz kontsolidatua deritzona, hain zuzen.…”
Section: Sarreraunclassified
“…Klase anitzeko datu-basetan (2 baino gehiagokoetan), klaseak orekatzea izango da onartzen den aukera bakarra. Mota honetako azpilaginak hainbat lanetan erabili dira zuhaitz kontsolidatuak sortzeko; kasu batzuetan, gutxiengoaren klasearen proportzio berri bat erabilita (desberdina datu-basearen arabera [13] edo beti %50a, hau da, lagin orekatuak, berriki argitaratutako lanean [16]) eta, beste batzuetan, klase-banaketa balio desberdin zabal bat erabilita [18,19], gutxiengoaren %2-tik %98-ra, honek duen eragina emaitzetan aztertzeko.…”
Section: Inplementatutako Laginketakunclassified
“…CTC (Perez et al, 2007), ID5R (Utgoff, 1989), ITI (Utgoff et al, 1997), UFFT (Gama & Medes, 2005), StreamTree (Jin & Agrawal, 2003), FDT (Janikowo, 1998), G-DT (Pedrycz, 2005) and Spider (Wang, et al, 2007).…”
Section: Introductionmentioning
confidence: 99%
“…Pruning is an important step for reducing the size of the tree, reducing the likelihood of over-fitting and resulting in a tree that is faster and easier to interpret (Pérez, Muguerza, Arbelaitz, Gurrutxaga, & Martín, 2007). In relation to the J48 Consolidated algorithm, there are many internal parameters that are available to be varied as part of the pruning mechanisms.…”
Section: Decision Trees Decision Trees Allow For a Visual (Or Graphimentioning
confidence: 99%
“…All trees (from each subsample) then comply with the majority vote, regardless of their individual vote. This process is repeated until the trees agree to stop growing, and a single decision tree output is then generated (Pérez et al, 2007). There are many parameters that can be manipulated in this way.…”
Section: Decision Trees Decision Trees Allow For a Visual (Or Graphimentioning
confidence: 99%