Parallel univariate decision trees

Basit Öğe Kaydı
dc.authorid0000-0001-5838-4615
dc.authorid0000-0002-6565-4860
dc.contributor.authorYıldız, Olcay Taneren_US
dc.contributor.authorDikmen, Onuren_US
dc.date.accessioned2015-01-15T23:00:49Z
dc.date.available2015-01-15T23:00:49Z
dc.date.issued2007-05-01
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Computer Engineeringen_US
dc.description.abstractUnivariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the dataset to be learned is very large. In those cases it is highly desirable to construct univariate decision trees in reasonable time. This may be accomplished by parallelizing univariate decision tree algorithms. In this paper, we first present two different univariate decision tree algorithms C4.5 and univariate linear discriminant tree. We show how to parallelize these algorithms in three ways: (i) feature based; (ii) node based; (iii) data based manners. Experimental results show that performance of the parallelizations highly depend on the dataset and the node based parallelization demonstrate good speedups.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citationYıldız, O. T. & Dikmen, O. (2007). Parallel univariate decision trees. Pattern Recognition Letters, 28(7), 825-832. doi:10.1016/j.patrec.2006.11.009en_US
dc.identifier.doi10.1016/j.patrec.2006.11.009
dc.identifier.endpage832
dc.identifier.issn0167-8655
dc.identifier.issn0167-8655
dc.identifier.issue7
dc.identifier.scopus2-s2.0-33847242621
dc.identifier.scopusqualityQ1
dc.identifier.startpage825
dc.identifier.urihttps://hdl.handle.net/11729/257
dc.identifier.urihttp://dx.doi.org/10.1016/j.patrec.2006.11.009
dc.identifier.volume28
dc.identifier.wosWOS:000245060700007
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakScience Citation Index Expanded (SCI-EXPANDED)en_US
dc.institutionauthorYıldız, Olcay Taneren_US
dc.institutionauthorid0000-0001-5838-4615
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherElsevier B.V.en_US
dc.relation.ispartofPattern Recognition Lettersen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDecision treesen_US
dc.subjectParallel processingen_US
dc.subjectUnivariate decision treesen_US
dc.subjectLinear discriminant treesen_US
dc.subjectAlgorithmsen_US
dc.subjectData miningen_US
dc.subjectData structuresen_US
dc.subjectDecision theoryen_US
dc.subjectParallel processing systemsen_US
dc.subjectParallelizationen_US
dc.subjectTrees (mathematics)en_US
dc.titleParallel univariate decision treesen_US
dc.typeArticleen_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 2 / 2
Küçük Resim Yok
İsim:
257.pdf
Boyut:
696.56 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
İndir
Küçük Resim
İsim:
257.pdf
Boyut:
123.42 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Author Pre-Print
İndir

Koleksiyon

Makale Koleksiyonu | Bilgisayar Mühendisliği Bölümü
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu