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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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:34
David E, Darren S (2011) Listing all maximal cliques in large sparse real-world graphs. CoRR abs/1103.0:150–159
Bron C, Kerbosch J (1973) Finding all clique of an un directed graph. Commum ACM 16(9):575–577
Kose F et al (2001) Visualizing plant metabolomic correlation net works using clique-metabolite matrices. Bioinformatics 17(12):1198–1208
Chang L, Yu JF (2013) Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1):173–186
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–724
Eblen JD, Phillips CA, Rogers GL, Langston MA (2012) The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinformatics 13(10):S5
Li Z-W, Yang X-H (2013) Dynamically weighted clique evolution model in clique networks. Math Probl Eng pp 778–783
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Wang, H., Ding, Y., Shao, Z. (2014). An Maximal Clique Mining Algorithm for Highway Network Optimization Problem. In: Jia, L., Liu, Z., Qin, Y., Zhao, M., Diao, L. (eds) Proceedings of the 2013 International Conference on Electrical and Information Technologies for Rail Transportation (EITRT2013)-Volume II. Lecture Notes in Electrical Engineering, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53751-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-53751-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53750-9
Online ISBN: 978-3-642-53751-6
eBook Packages: EngineeringEngineering (R0)