An Maximal Clique Mining Algorithm for Highway Network Optimization Problem

  • Zipeng Zhang
  • HongGuo Wang
  • Yanhui Ding
  • Zengzhen Shao
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 288)

Abstract

In view of the realistic site and distance information of the highway network and its complex topological structure, a new degree-based maximal clique mining algorithm which containing a series of pruning strategies and dictionary ordering strategies is proposed in this paper according to the top-down method to optimize the expressway network information reasonably. The efficiency of searching and clustering the highway network is improved further. In this paper, a simplified model of the highway network is designed, and based on the example of Shandong province highway network database, the new algorithm shows better results.

Keywords

Mining maximal clique Degree-based algorithm Highway network optimization 

References

  1. 1.
    Cheng J, Ke Y, Fu A W-C, Yu JX, Zhu L (2011) Finding maximalcliques in massive networks. ACM Trans Database Syst 36(4):21:1–21:34Google Scholar
  2. 2.
    David E, Darren S (2011) Listing all maximal cliques in large sparse real-world graphs. CoRR abs/1103.0:150–159Google Scholar
  3. 3.
    Bron C, Kerbosch J (1973) Finding all clique of an un directed graph. Commum ACM 16(9):575–577Google Scholar
  4. 4.
    Kose F et al (2001) Visualizing plant metabolomic correlation net works using clique-metabolite matrices. Bioinformatics 17(12):1198–1208Google Scholar
  5. 5.
    Chang L, Yu JF (2013) Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1):173–186MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Yan X-F, Han J-W (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, IEEE Computer Society, Washington, DC, pp 721–724Google Scholar
  7. 7.
    Eblen JD, Phillips CA, Rogers GL, Langston MA (2012) The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinformatics 13(10):S5Google Scholar
  8. 8.
    Li Z-W, Yang X-H (2013) Dynamically weighted clique evolution model in clique networks. Math Probl Eng pp 778–783Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Zipeng Zhang
    • 1
  • HongGuo Wang
    • 1
  • Yanhui Ding
    • 1
  • Zengzhen Shao
    • 1
  1. 1.School of Management Science and EngineeringShandong Normal UniversityJiNanChina

Personalised recommendations