You are not logged in.
Openly accessible

An efficient MapReduce-based parallel clustering algorithm for distributed traffic subarea division

Xia, Dawen, Wang, Binfeng, Li, Yantao, Rong, Zhuobo and Zhang, Zili 2015, An efficient MapReduce-based parallel clustering algorithm for distributed traffic subarea division, Discrete dynamics in nature and society, vol. 2015, pp. 1-18, doi: 10.1155/2015/793010.

Attached Files
Name Description MIMEType Size Downloads
zhang-anefficientmap-2015.pdf Published version application/pdf 6.56MB 5

Title An efficient MapReduce-based parallel clustering algorithm for distributed traffic subarea division
Author(s) Xia, Dawen
Wang, Binfeng
Li, Yantao
Rong, Zhuobo
Zhang, ZiliORCID iD for Zhang, Zili orcid.org/0000-0002-8721-9333
Journal name Discrete dynamics in nature and society
Volume number 2015
Article ID 793010
Start page 1
End page 18
Total pages 18
Publisher Hindawi Publishing Corp.
Place of publication Cairo, Egypt
Publication date 2015
ISSN 1026-0226
1607-887X
Summary Traffic subarea division is vital for traffic system management and traffic network analysis in intelligent transportation systems (ITSs). Since existing methods may not be suitable for big traffic data processing, this paper presents a MapReduce-based Parallel Three-Phase K -Means (Par3PKM) algorithm for solving traffic subarea division problem on a widely adopted Hadoop distributed computing platform. Specifically, we first modify the distance metric and initialization strategy of K -Means and then employ a MapReduce paradigm to redesign the optimized K -Means algorithm for parallel clustering of large-scale taxi trajectories. Moreover, we propose a boundary identifying method to connect the borders of clustering results for each cluster. Finally, we divide traffic subarea of Beijing based on real-world trajectory data sets generated by 12,000 taxis in a period of one month using the proposed approach. Experimental evaluation results indicate that when compared with K -Means, Par2PK-Means, and ParCLARA, Par3PKM achieves higher efficiency, more accuracy, and better scalability and can effectively divide traffic subarea with big taxi trajectory data.
Language eng
DOI 10.1155/2015/793010
Field of Research 0102 Applied Mathematics
010204 Dynamical Systems in Applications
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, The Authors
Free to Read? Yes
Use Rights Creative Commons Attribution licence
Persistent URL http://hdl.handle.net/10536/DRO/DU:30082150

Document type: Journal Article
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 3 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 85 Abstract Views, 6 File Downloads  -  Detailed Statistics
Created: Mon, 14 Mar 2016, 09:51:42 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.