Skip to main content

Fast Extraction Method of Functional Clusters from Large-Scale Spatial Networks Based on Transfer Learning

  • Conference paper
  • First Online:
Complex Networks & Their Applications VI (COMPLEX NETWORKS 2017)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 689))

Included in the following conference series:

  • 1536 Accesses

Abstract

In this paper, we treat the road network of each city as a network and attempt to accelerate extracting functional clusters which means areas that perform similar functions in road network. As a method of extracting a group of nodes having similar functions from the network, we have proposed Functional Cluster Extraction method. In this method, high dimensional vectors based on random walks are clustered by the greedy solution of the K-medoids method, and K functional clusters are extracted. However, it is difficult to hold a similarity matrix of all node pairs for a large network with a large number of nodes like a road network. On the other hand, it has been discovered that the structure of the road network has a similar structure even if the area is different. In this paper, we propose a fast clustering method by extracting approximate medoids from the target network, using the medoid set of networks already clustered, and execute the Voronoi tessellation based on them. Using the actual road network, we evaluate the proposed method from the viewpoint of the correct answer rate (accuracy) and the calculation speed of the approximate solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://mapzen.com/data/metro-extracts.

References

  1. Aggarwal, A., Deshpande, A., Kannan, R.: Adaptive sampling for k-means clustering. In: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 15–28. Springer-Verlag, Berlin, Heidelberg (2009)

    Google Scholar 

  2. Burckhart, K., Martin, O.J.: An interpretation of the recent evolution of the city of Barcelona through the traffic maps. J. Geogr. Inf. Syst. 4(4), 298–311 (2012)

    Google Scholar 

  3. Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036,125+ (2006)

    Google Scholar 

  4. Everett, M., Borgatti, S.: Regular equivalence: general theory. J. Math. Sociol. 19(1), 29–52 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fushimi, T., Saito, K., Ikeda, T., Kazama, K.: Extracting and characterizing functional communities in spatial networks. In: Proceedings of the Workshop on Artificial Intelligence for Tourism (AI4Tourism2016), pp. 182–193 (2016)

    Google Scholar 

  6. Fushimi, T., Saito, K., Ikeda, T., Kazama, K.: Functional cluster extraction from large spatial networks. In: Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM2016), pp. 57–62 (2016)

    Google Scholar 

  7. Fushimi, T., Saito, K., Kazama, K.: Extracting communities in networks based on functional properties of nodes. In: D. Richards, B.H. Kang (eds.) Proceedings of the 12th Pacific Rim Knowledge Acquisition Workshop (PKAW2012), pp. 328–334. Springer-Verlag, Berlin, Heidelberg (2012)

    Google Scholar 

  8. Gilpin, S., Eliassi-Rad, T., Davidson, I.: Guided learning for role discovery (glrd): Framework, algorithms, and applications. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 113–121. ACM, New York, NY, USA (2013)

    Google Scholar 

  9. Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., Li, L.: Rolx: Structural role extraction & mining in large graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1231–1239. ACM (2012)

    Google Scholar 

  10. Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., Faloutsos, C.: It’s who you know: Graph mining using recursive structural features. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 663–671. ACM, New York, NY, USA (2011)

    Google Scholar 

  11. Jiang, B., Duan, Y., Lu, F., Yang, T., Zhao, J.: Topological structure of urban street networks from the perspective of degree correlations. Environ. Plan. 41(5), 813–828 (2014)

    Article  Google Scholar 

  12. Jiang, C., Li, Y., Shao, M., Jia, P.: Accelerating clustering methods through fractal based analysis. In: 1st Workshop on Application of Self-similarity and Fractals in Data Mining (KDD2002 Workshop) (2002)

    Google Scholar 

  13. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM, New York, NY, USA (2007)

    Google Scholar 

  14. Lin, F., Cohen, W.W.: Power iteration clustering. In: Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 655–662 (2010)

    Google Scholar 

  15. Lorrain, F., White, H.: Structural equivalence of individuals in social networks. J. Math. Soc. 1(1), 49–80 (1971)

    Article  Google Scholar 

  16. Montis, D.A., Barthelemy, M., Chessa, A., Vespignani, A.: The structure of interurban traffic: a weighted network analysis. Environ. Plan. 34(5), 905–924 (2007)

    Article  Google Scholar 

  17. Newman, M.E.J.: Detecting community structure in networks. European Phys. J. B Condens. Matter Complex Syst. 38(2), 321–330 (2004). https://doi.org/10.1140/epjb/e2004-00124-y

  18. Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245–251 (2010)

    Article  Google Scholar 

  19. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  20. Park, K., Yilmaz, A.: A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS Annual Conference 2010 (2010)

    Google Scholar 

  21. Rossi, R.A., Ahmed, N.K.: Role discovery in networks. IEEE Trans. Knowl. Data Eng. 27(4), 1112–1131 (2015)

    Article  Google Scholar 

  22. Rossi, R.A., Gallagher, B., Neville, J., Henderson, K.: Role-dynamics: Fast mining of large dynamic networks. In: Proceedings of the 21st International Conference Companion on World Wide Web, pp. 997–1006. ACM (2012)

    Google Scholar 

  23. Rossi, R.A., Gallagher, B., Neville, J., Henderson, K.: Modeling dynamic behavior in large evolving graphs. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 667–676. ACM (2013)

    Google Scholar 

  24. Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)

    Article  MathSciNet  Google Scholar 

  25. Vinod, H.: Integer programming and the theory of grouping, vol. 64. Off. J. Am. Stat. Assoc. (1969)

    Google Scholar 

  26. Wang, P., Hunter, T., Bayen, A.M., Schechtner, K., Gonzalez, M.C.: Understanding road usage patterns in urban areas. Sci. Rep. 2, 1001 (2012) (arXiv:1212.5327)

Download references

Acknowledgement

This work was supported by a JSPS Grant-in-Aid for Scientific Research (No.17H01826).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takayasu Fushimi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fushimi, T., Saito, K., Ikeda, T., Kazama, K. (2018). Fast Extraction Method of Functional Clusters from Large-Scale Spatial Networks Based on Transfer Learning. In: Cherifi, C., Cherifi, H., Karsai, M., Musolesi, M. (eds) Complex Networks & Their Applications VI. COMPLEX NETWORKS 2017. Studies in Computational Intelligence, vol 689. Springer, Cham. https://doi.org/10.1007/978-3-319-72150-7_98

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72150-7_98

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72149-1

  • Online ISBN: 978-3-319-72150-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics