Finding Key Stations of Hangzhou Public Bicycle System by a Improved K-Means Algorithm

Article Preview

Abstract:

In China, Hangzhou is the first city to set up the Public Bicycle System. Now, the System has been the largest bike- sharing program in the world. The software of Hangzhou Public Bicycle System was developed by our team. There are many and many technology problems in the decision of intelligent dispatch. Among of these problems, determining how to find the key stations to give special care is very important. In this paper, a improved k-means algorithm is used to recognize the key stations of Hangzhou Public Bicycle System. At first, by passing over the two week’s real data, a rent-return database is initialed. Then the algorithm builds minimum spanning tree and splits it to gets k initial cluster centers. The key stations are determined from the rent-return database by the algorithm. Practice examples and comparison with the traditional k-means algorithm are made. The results show that the proposed algorithm is efficient and robust. The research result has been applied in Hangzhou.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

925-929

Citation:

Online since:

October 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Boris Mirkin, in: Clustering Algorithms: a review, Mathematical Classification and Clustering, Chapter, 3:Kluwer Academic Publishers(1996), p.109–169.

Google Scholar

[2] Boris Mirkin, in: K-Means Clustering , Clustering for Data Mining, Chapter, 3:, Taylor & Francis Group(2005), p.75–110.

Google Scholar

[3] Boris Mirkin: Machine Learning(1999), series 35(1), 25–39

Google Scholar

[4] Shehroz S. Khan and Amir Ahmad:Pattern Recognition Letters(2004), series 25(11), 1293–1302.

Google Scholar

[5] Bjarni Bodvarsson, M. Morkebjerg, L.K. Hansen, G.M. Knudsen and C. Svarer: NeuroImage(2006), series 31(2), 185–186.

Google Scholar

[6] Youssef M. Marzouk and Ahmed F. Ghoniem: Journal of Computational Physics(2005), series 207(2), 493–528

Google Scholar

[7] David J. Hand and Wojtek J. Krzanowski: Computational Statistics & Data Analysis(2005), series 49(4), 969–973.

Google Scholar

[8] R.J. Kuo, H.S. Wang, Tung-Lai Hu and S.H. Chou: Computers& Mathematics with Applications(2005), series 50(10-12), 1709–1724.

Google Scholar

[9] Georg Peters: Pattern Recognition(2006), series 39(8), 1481–1491.

Google Scholar

[10] Makoto Otsubo, Katsushi Sato and Atsushi Yamaji: Journal of Structural Geology(2006).

Google Scholar

[11] Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman and Angela Y. Wu: Computational Geometry(2004), series 28(2-3), 89–112.

DOI: 10.1016/j.comgeo.2004.03.003

Google Scholar

[12] Sanghamitra Bandyopadhyay and Ujjwal Maulik: Information Sciences(2002), series 146(1), 221–237.

Google Scholar

[13] V.S. Ananthanarayana, M. Narasimha Murty and D.K. Subramania: Pattern Recognition(2001).

Google Scholar