AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Traffic Clustering Algorithm of Urban Data Brain Based on a Hybrid-Augmented Architecture of Quantum Annealing and Brain-Inspired Cognitive Computing

Key laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai Institute for Advanced Communication and Data Science, Shanghai University, Shanghai 200444, China
State Key Laboratory of Cryptology, Beijing 100878, China
Center for Quantum Computing, Peng Cheng Laboratory, Shenzhen 518000, China.
Show Author Information

Abstract

In recent years, the urbanization process has brought modernity while also causing key issues, such as traffic congestion and parking conflicts. Therefore, cities need a more intelligent "brain" to form more intelligent and efficient transportation systems. At present, as a type of machine learning, the traditional clustering algorithm still has limitations. K-means algorithm is widely used to solve traffic clustering problems, but it has limitations, such as sensitivity to initial points and poor robustness. Therefore, based on the hybrid architecture of Quantum Annealing (QA) and brain-inspired cognitive computing, this study proposes QA and Brain-Inspired Clustering Algorithm (QABICA) to solve the problem of urban taxi-stand locations. Based on the traffic trajectory data of Xi’an and Chengdu provided by Didi Chuxing, the clustering results of our algorithm and K-means algorithm are compared. We find that the average taxi-stand location bias of the final result based on QABICA is smaller than that based on K-means, and the bias of our algorithm can effectively reduce the tradition K-means bias by approximately 42%, up to approximately 83%, with higher robustness. QA algorithm is able to jump out of the local suboptimal solutions and approach the global optimum, and brain-inspired cognitive computing provides search feedback and direction. Thus, we will further consider applying our algorithm to analyze urban traffic flow, and solve traffic congestion and other key problems in intelligent transportation.

References

[1]
F. Neukart, G. Compostella, C. Seidel, D. Von Dollen, S. Yarkoni, and B. Parney, Traffic flow optimization using a quantum annealer, Frontiers in ICT, vol. 4, p. 29, 2017.
[2]
E. F. Freitas, F. F. Martins, A. Oliveira, I. R. Segundo, and H. Torres, Traffic noise and pavement distresses: Modelling and assessment of input parameters influence through data mining techniques, Applied Acoustics, vol. 138, pp. 147-155, 2018.
[3]
Y. Djenouri and A. Zimek, Outlier detection in urban traffic data, in Proc. 8th Int. Conf. Web Intelligence, Mining and Semantics, Novi Sad, Serbia, 2018, pp. 1-12.
[4]
B. N. Silva, M. Khan, C. Jung, J. Seo, D. Muhammad, J. H. Han, Y. Yoon, and K. J. Han, Urban planning and smart city decision management empowered by real-time data processing using big data analytics, Sensors, vol. 18, no. 9, p. 2994, 2018.
[5]
J. Brainard, What’s coming up in 2018, Science, vol. 359, no. 6371, pp. 10-12, 2018.
[6]
E. V. Sekar, J. Anuradha, A. Arya, B. Balusamy, and V. Chang, A framework for smart traffic management using hybrid clustering techniques, Cluster Computing, vol. 21, no. 1, pp. 347-362, 2018.
[7]
M. Saeedmanesh and N. Geroliminis, Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks, Transportation Research Part B: Methodological, vol. 105, pp. 193-211, 2017.
[8]
A. Gregoriades and A. Chrystodoulides, Extracting traffic safety knowledge from historical accident data, in Adjunct Proc. 14th Int. Conf. Location Based Services, Zurich, Switzerland, 2018, pp. 109-114.
[9]
K. K. Santhosh, D. P. Dogra, and P. P. Roy, Temporal unknown incremental clustering model for analysis of traffic surveillance videos, IEEE Transactions on Intelligent Transportation Systems, vol. 20, no. 5, pp. 1762-1773, 2019.
[10]
P. X. Zhao, X. T. Liu, J. W. Shen, and M. Chen, A network distance and graph-partitioning-based clustering method for improving the accuracy of urban hotspot detection, Geocarto International, vol. 34, no. 3, pp. 293-315, 2019.
[11]
S. Gaffney and P. Smyth, Trajectory clustering with mixtures of regression models, in Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, San Diego, CA, USA, 1999, pp. 63-72.
[12]
J. G. Lee, J. W. Han, and K. Y. Whang, Trajectory clustering: A partition-and-group framework, in Proc. 2007 ACM SIGMOD Int. Conf. Management of Data, Beijing, China, 2007, pp. 593-604.
[13]
J. I. Won, S. W. Kim, J. H. Baek, and J. Lee, Trajectory clustering in road network environment, presented at 2009 IEEE Symp. Computational Intelligence and Data Mining, Nashville, TN, USA, 2009, pp. 299-305.
[14]
J. R. Hwang, H. Y. Kang, and K. J. Li, Spatio-temporal similarity analysis between trajectories on road networks, presented at International Conference on Conceptual Modeling, Berlin, Germany: Springer, 2005, pp. 280-289.
[15]
Y. F. Li, J. W. Han, and J. Yang, Clustering moving objects, in Proc. 10th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Seattle, WA, USA, 2004, pp. 617-622.
[16]
Didi Chuxing GAIA Initiative, https://gaia.didichuxing.com, 2019.
[17]
G. Boeing, OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks, Computers, Environment and Urban Systems, vol. 65, pp. 126-139, 2017.
[18]
B. N. Wang, F. Hu, and C. Wang, Optimization of quantum computing models inspired by D-wave quantum annealing, Tsinghua Science and Technology, vol. 25, no. 4, pp. 508-515, 2020.
[19]
C. Wang, F. Hu, H. G. Zhang, and J. Wu, Evolutionary cryptography theory-based generating method for secure ECs, Tsinghua Science and Technology, vol. 22, no. 5, pp. 499-510, 2017.
[20]
F. Hu, C. Wang, H. G. Zhang, and J. Wu, Simple method for realizingweil theorem in secure ECC generation, Tsinghua Science and Technology, vol. 22, no. 5, pp. 511-519, 2017.
[21]
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science, vol. 292, no. 5516, pp. 472-475, 2001.
[22]
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, and J. D. Doll, Quantum annealing: A new method for minimizing multidimensional functions, Chemical Physics Letters, vol. 219, nos. 5&6, pp. 343-348, 1994.
[23]
V. N. Smelyanskiy, E. G. Rieffel, S. I. Knysh, C. P. Williams, M. W. Johnson, M. C. Thom, W. G. Macready, and K. L. Pudenz, A near-term quantum computing approach for hard computational problems in space exploration, arXiv preprint arXiv: 1204.2821v2, 2012.
[24]
N. N. Zheng, Z. Y. Liu, P. J. Ren, Y. Q. Ma, S. T. Chen, S. Y. Yu, J. R. Xue, B. D. Chen, and F. Y. Wang, Hybrid-augmented intelligence: Collaboration and cognition, Frontiers of Information Technology & Electronic Engineering, vol. 18, no. 2, pp. 153-179, 2017.
[25]
X. D. Wu, V. Kumar, J. R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, P. S. Yu, et al., Top 10 algorithms in data mining, Knowledge and Information Systems, vol. 14, no. 1, pp. 1-37, 2008.
Tsinghua Science and Technology
Pages 813-825
Cite this article:
Wang N, Guo G, Wang B, et al. Traffic Clustering Algorithm of Urban Data Brain Based on a Hybrid-Augmented Architecture of Quantum Annealing and Brain-Inspired Cognitive Computing. Tsinghua Science and Technology, 2020, 25(6): 813-825. https://doi.org/10.26599/TST.2020.9010007

839

Views

63

Downloads

15

Crossref

N/A

Web of Science

21

Scopus

3

CSCD

Altmetrics

Received: 03 March 2020
Accepted: 10 March 2020
Published: 07 May 2020
© The author(s) 2020

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return