Improving approximate extraction of functional similar regions from large-scale spatial networks based on greedy selection of representative nodes of different areas

• Main Authors: Takayasu Fushimi, Kazumi Saito, Tetsuo Ikeda, Kazuhiro Kazama
• Format: Article
• Language: English
• Published: SpringerOpen 2018-07-01
• Series: Applied Network Science
• Subjects: Spatial network; Functional similarity; Node clustering; Greedy algorithm; Transfer learning
• Online Access: http://link.springer.com/article/10.1007/s41109-018-0075-2

Abstract Dividing a geographical region into some subregions with common characteristics is an important research topic, and has been studied in many research fields such as urban planning and transportation planning. In this paper, by network analysis approach, we attempt to extract functionally similar regions, each of which consists of functionally similar nodes of a road network. For this purpose, we previously proposed the Functional Cluster Extraction method, which takes a large amount of computation time to output clustering results because it treats too many high-dimensional vectors. To overcome this difficulty, we also previously proposed a transfer learning-based clustering method that selects approximate medoids from the target network using the K medoids of a previously clustered network and divides all the nodes into K clusters. If we select an appropriate network with similar structural characteristics, this method produces highly accurate clustering results. However it is difficult to preliminarily know which network is appropriate. In this paper, we extend this method to ensure accuracy using the K medoids of multiple networks rather than a specific network. Using actual urban streets, we evaluate our proposed method from the viewpoint of the improvement degree of clustering accuracy and computation time.