{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:03:44Z","timestamp":1759190624107,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1016\/j.patrec.2006.11.009","type":"journal-article","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:58:09Z","timestamp":1169539089000},"page":"825-832","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Parallel univariate decision trees"],"prefix":"10.1016","volume":"28","author":[{"given":"Olcay Taner","family":"Y\u0131ld\u0131z","sequence":"first","affiliation":[]},{"given":"Onur","family":"Dikmen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2006.11.009_bib1","unstructured":"Agayev, E., G\u00fcrda\u011f, B., \u00d6zturan, C., \u00c7a\u011flayan, M.U., 1999. Development of a low cost network based multicomputer. In: Proceedings of 4th Symposium on Computer Networks, Istanbul, pp. 53\u201360."},{"key":"10.1016\/j.patrec.2006.11.009_bib2","unstructured":"Ak\u0131n, H.L., Pavlova, P., Y\u0131ld\u0131z, O.T., 2002. Cerberus 2002, Robocup 2002: Robot soccer world cup VI. In: The 2002 International Robocup Symposium Pre-Proceedings, Fukuoka, June 24\u201325, 2002, pp. 448."},{"year":"2001","series-title":"Pattern Classification","author":"Duda","key":"10.1016\/j.patrec.2006.11.009_bib3"},{"key":"10.1016\/j.patrec.2006.11.009_bib4","doi-asserted-by":"crossref","unstructured":"Jin, R., Agrawal, G., 2003. Communication and memory efficient parallel decision tree construction. In: Proceedings of Third SIAM Conference on Data Mining.","DOI":"10.1137\/1.9781611972733.11"},{"key":"10.1016\/j.patrec.2006.11.009_bib5","article-title":"Decision trees on parallel processors","volume":"vol. 3","author":"Kufrin","year":"1997"},{"key":"10.1016\/j.patrec.2006.11.009_bib6","doi-asserted-by":"crossref","unstructured":"Mehta, M., Agrawal, R., Rissaneh, J., 1996. SLIQ: A fast scalable classifier for data mining. In: Proceedings of the Fifth International Conference on Extending Database Technology, Avignon. France.","DOI":"10.1007\/BFb0014141"},{"key":"10.1016\/j.patrec.2006.11.009_bib7","unstructured":"Message Passing Interface Forum, 1994. MPI: A Message-Passing Interface Standard."},{"key":"10.1016\/j.patrec.2006.11.009_bib8","unstructured":"Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J., 1998. UCI Repository of machine learning databases, [<http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html>], Irvine, CA: University of California, Department of Information and Computer Science."},{"key":"10.1016\/j.patrec.2006.11.009_bib9","unstructured":"ORL Face Database, <http:\/\/www.uk.research.att.com\/facedatabase.html>."},{"key":"10.1016\/j.patrec.2006.11.009_bib10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1022643204877","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Machine Learning"},{"year":"1993","series-title":"C4.5: Programs for Machine Learning San Mateo","author":"Quinlan","key":"10.1016\/j.patrec.2006.11.009_bib11"},{"key":"10.1016\/j.patrec.2006.11.009_bib12","unstructured":"Shafer, J., Agrawal, R., Mehta, M., 1996. SPRINT: A scalable parallel classifier for data mining. In: Proceedings of the 22nd VLDB Conference."},{"key":"10.1016\/j.patrec.2006.11.009_bib13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1009832825273","volume":"3","author":"Srivastava","year":"1999","journal-title":"Parallel Formulations of Decision-Tree Classification Algorithms Data Mining and Knowledge Discovery."},{"issue":"3","key":"10.1016\/j.patrec.2006.11.009_bib14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1142\/S0218001405004125","article-title":"Linear discriminant trees","volume":"19","author":"Y\u0131ld\u0131z","year":"2005","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865506002923?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865506002923?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T05:59:58Z","timestamp":1759125598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865506002923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["S0167865506002923"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2006.11.009","relation":{},"ISSN":["0167-8655"],"issn-type":[{"type":"print","value":"0167-8655"}],"subject":[],"published":{"date-parts":[[2007,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel univariate decision trees","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2006.11.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2006 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}