Abstract

The city's district attraction ranking plays an essential role in the city's government because it can be used to reveal the city's district attraction and, thus, help government make decisions for urban planning in terms of the smart city. The traditional methods for urban planning mainly rely on the district's GDP, employment rate, population density, information from questionnaire surveys, and so on. However, as a comparison, such information is becoming relatively less informative as the explosion of an increasing amount of urban data. What is more, there is a serious shortcoming in these methods, i.e., they are independent representations of the attraction of a district and do not take into account the interaction among districts. With the development of urban computing, it is possible to make good use of urban data for urban planning. To this end, based on taxi big data obtained from Guangzhou, China, this article proposes a district attraction ranking approach called AttractRank, which for the first time uses taxi big data for district ranking. An application system is developed for demonstration purposes. First, the entire Guangzhou city is divided into a number of districts by using constrained K-means. Second, the original PageRank algorithm is extended to integrate with the taxi's origin–destination ( $OD$ ) points to establish the $OD$ matrix, whereby the attraction ranking of each district can be calculated. Finally, by visualizing the results and case studies obtained from AttractRank, we can successfully obtain the pattern of how attractions of districts change over time and interesting discoveries on urban lives; therefore, it has wide applications in urban planning and urban data mining.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.