{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T22:42:28Z","timestamp":1717713748049},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T00:00:00Z","timestamp":1422576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10489-014-0637-7","type":"journal-article","created":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T01:49:13Z","timestamp":1422496153000},"page":"208-232","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SPORE: shortest path overlapped regions and confined traversals towards graph clustering"],"prefix":"10.1007","volume":"43","author":[{"given":"Waqas","family":"Nawaz","sequence":"first","affiliation":[]},{"given":"Kifayat-Ullah","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,30]]},"reference":[{"key":"637_CR1","volume-title":"Highway dimension and provably efficient shortest path algorithms","author":"I Abraham","year":"2013","unstructured":"Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2013) Highway dimension and provably efficient shortest path algorithms. Tech. rep., Microsoft Research, USA. doi: MSR-TR-2013-91"},{"key":"637_CR2","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RFF (2012) Hierarchical hub labelings for shortest paths. In: Epstein L, Ferragina P (eds) ESA, Lecture Notes in Computer Science, vol 7501. Springer, pp 24\u201335. http:\/\/dblp.uni-trier.de\/db\/conf\/esa\/esa2012.html#AbrahamDGW12","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"637_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal C C, Bhuiyan M A, Hasan M A (2014) Frequent pattern mining algorithms: A survey. In: Aggarwal C C, Han J (eds) Frequent Pattern Mining. Springer International Publishing, pp 19\u201364. doi: 10.1007\/978-3-319-07821-2_2","DOI":"10.1007\/978-3-319-07821-2_2"},{"key":"637_CR4","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201913. ACM, New York, pp 349\u2013360. doi: 10.1145\/2463676.2465315","DOI":"10.1145\/2463676.2465315"},{"issue":"5824","key":"637_CR5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast H, Funke S, Sanders P, Schultes D (2007) Fast routing in road networks with transit nodes. Science 316(5824):566. doi: 10.1126\/science.1137521 . http:\/\/www.mpi-inf.mpg.de\/funke\/Papers\/SCIENCE07\/SCIENCE07.pdf","journal-title":"Science"},{"key":"637_CR6","doi-asserted-by":"crossref","unstructured":"Bollobas B (1998) Modern Graph Theory. Springer. http:\/\/www.worldcat.org\/isbn\/0387984887","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"637_CR7","unstructured":"Bradley P, Fayyad U, Reina C (1998) Scaling clustering algorithms to large databases. In: Proceedings of the 4th Conference on Knowledge Discovery in Databases, KDD\u201998. AAAI Press, pp 9\u201315"},{"key":"637_CR8","doi-asserted-by":"crossref","unstructured":"Chen HH, Giles CL (2013) Ascos: an asymmetric network structure context similarity measure. In: Rokne J G, Faloutsos C (eds) ASONAM. ACM, pp 442\u2013449","DOI":"10.1145\/2492517.2492539"},{"issue":"2","key":"637_CR9","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/1921632.1921638","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng H, Zhou Y, Yu JX (2011) Clustering large attributed graphs: A balance between structural and attribute similarities. ACM Trans Knowl Discov Data 5(2):12:1\u201312:33. doi: 10.1145\/1921632.1921638","journal-title":"ACM Trans Knowl Discov Data"},{"key":"637_CR10","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Fuchs F, Goldberg AV, Goldszmidt M, Werneck RF (2013) Scalable similarity estimation in social networks: Closeness, node labels, and random edge lengths. In: Proceedings of the First ACM Conference on Online Social Networks, COSN \u201913. ACM, New York, pp 131\u2013142. doi: 10.1145\/2512938.2512944","DOI":"10.1145\/2512938.2512944"},{"key":"637_CR11","first-page":"191","volume-title":"Search Computing, Lecture Notes in Computer Science, vol 7538","author":"S Cohen","year":"2012","unstructured":"Cohen S, Kimelfeld B, Koutrika G (2012) A survey on proximity measures for social networks. In: Ceri S, Brambilla M (eds) Search Computing, Lecture Notes in Computer Science, vol 7538. Springer, Berlin Heidelberg, pp 191\u2013206. doi: 10.1007\/978-3-642-34213-4_13"},{"key":"637_CR12","unstructured":"Cormen TH, Stein C, Rivest RL, Leiserson CE (2001) Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education"},{"key":"637_CR13","volume-title":"Robust exact distance queries on massive networks","author":"D Delling","year":"2014","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2014) Robust exact distance queries on massive networks. Tech. rep., Microsoft Research, USA. doi: MSR-TR-2014-12"},{"key":"637_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D Delling","year":"2009","unstructured":"Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Lerner J, Wagner D, Zweig K A (eds) Algorithmics of Large and Complex Networks. Springer, Berlin, Heidelberg, pp 117\u2013139. doi: 10.1007\/978-3-642-02094-0_7"},{"issue":"1","key":"637_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Ser B 39(1):1\u201338","journal-title":"J R Stat Soc Ser B"},{"issue":"1","key":"637_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"637_CR17","unstructured":"van Dongen S (2000) Graph clustering by flow simulation. Ph.D. thesis. University of Utrecht, Utrecht"},{"issue":"1","key":"637_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F Farnstrom","year":"2000","unstructured":"Farnstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms revisited. SIGKDD Explor Newsl 2(1):51\u201357. doi: 10.1145\/360402.360419","journal-title":"SIGKDD Explor Newsl"},{"issue":"4","key":"637_CR19","doi-asserted-by":"crossref","first-page":"358","DOI":"10.14778\/2095686.2095694","volume":"5","author":"J Gao","year":"2011","unstructured":"Gao J, Jin R, Zhou J, Yu JX, Jiang X, Wang T (2011) Relational approach for shortest path discovery over large graphs. Proc VLDB Endow 5(4):358\u2013369. doi: 10.14778\/2095686.2095694","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"637_CR20","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388\u2013404. doi: 10.1287\/trsc.1110.0401","journal-title":"Transp Sci"},{"key":"637_CR21","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Kaplan H, Werneck RF (2009) Reach for a*: Efficient point-to-point shortest path algorithms. In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge. American Mathematical Society, USA, pp 93\u2013139","DOI":"10.1090\/dimacs\/074\/05"},{"key":"637_CR22","doi-asserted-by":"crossref","unstructured":"Hamerly G (2010) Making k-means even faster. In: Proceedings of the 2010 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, Philadelphia, pp 130\u2013140. doi: 10.1137\/1.9781611972801.12","DOI":"10.1137\/1.9781611972801.12"},{"issue":"1","key":"637_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387. doi: 10.1023\/B:DAMI.0000005258.31418.83","journal-title":"Data Min Knowl Discov"},{"key":"637_CR24","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2002) Simrank: A measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902. ACM, New York, pp 538\u2013543. doi: 10.1145\/775047.775126","DOI":"10.1145\/775047.775126"},{"issue":"1","key":"637_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343. doi: 10.1007\/BF02289026","journal-title":"Psychometrika"},{"issue":"1","key":"637_CR26","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"HP Kriegel","year":"2009","unstructured":"Kriegel HP, Kroger P, Zimek A (2009) Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 3(1):1:1\u20131:58. doi: 10.1145\/1497577.1497578","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"637_CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.socnet.2005.01.007","volume":"27","author":"A Lada","year":"2005","unstructured":"Lada A, Eytan A (2005) How to search a social network. Soc Networks 27(3):187\u2013203. doi: 10.1016\/j.socnet.2005.01.007","journal-title":"Soc Networks"},{"key":"637_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD\u201905. Springer, Berlin, Heidelberg, pp 133\u2013145. doi: 10.1007\/11564126_17","DOI":"10.1007\/11564126_17"},{"issue":"7","key":"637_CR29","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031. doi: 10.1002\/asi.20591","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"7","key":"637_CR30","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031. doi: 10.1002\/asi.v58:7","journal-title":"J Am Soc Inf Sci Technol"},{"key":"637_CR31","doi-asserted-by":"crossref","unstructured":"Nawaz W, Lee YK, Lee S (2012) Collaborative similarity measure for intra graph clustering. In: DASFAA Workshops, pp 204\u2013 215","DOI":"10.1007\/978-3-642-29023-7_21"},{"issue":"2","key":"637_CR32","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404\u2013409. doi: 10.1073\/pnas.98.2.404 10.1073\/pnas.98.2.404 . http:\/\/www.pnas.org\/content\/98\/2\/404.abstract","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"637_CR33","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TKDE.2006.31","volume":"18","author":"C Ordonez","year":"2006","unstructured":"Ordonez C (2006) Integrating k-means clustering with a relational dbms using sql. IEEE Trans Knowl Data Eng 18(2):188\u2013201. doi: 10.1109\/TKDE.2006.31","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"637_CR34","first-page":"133","volume-title":"Complex Networks IV, Studies in Computational Intelligence, vol 476","author":"B Perozzi","year":"2013","unstructured":"Perozzi B, McCubbin C, Beecher S, Halbert J (2013) Scalable graph clustering with pregel. In: Ghoshal G., Poncela-Casasnovas J., Tolksdorf R. (eds) Complex Networks IV, Studies in Computational Intelligence, vol 476. Springer, Berlin Heidelberg, pp 133\u2013144. doi: 10.1007\/978-3-642-36844-8_13"},{"issue":"3","key":"637_CR35","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1061\/(ASCE)CP.1943-5487.0000220","volume":"27","author":"A Pradhan","year":"2013","unstructured":"Pradhan A, Mahinthakumar G (2013) Finding all-pairs shortest path for a large-scale transportation network using parallel floyd-warshall and parallel dijkstra algorithms. J Comput Civ Eng 27(3):263\u2013273. doi: 10.1061\/(ASCE)CP.1943-5487.0000220","journal-title":"J Comput Civ Eng"},{"key":"637_CR36","doi-asserted-by":"crossref","first-page":"1.6:1.1","DOI":"10.1145\/2133803.2330080","volume":"17","author":"P Sanders","year":"2012","unstructured":"Sanders P, Schultes D (2012) Engineering highway hierarchies. J Exp Algorithmics 17:1.6:1.1\u20131.6:1.40. doi: 10.1145\/2133803.2330080","journal-title":"J Exp Algorithmics"},{"key":"637_CR37","unstructured":"Satuluri VM (2012) Scalable clustering of modern networks. Ph.D. thesis. The Ohio State University"},{"issue":"1","key":"637_CR38","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Survey: Graph clustering. Comput Sci Rev 1(1):27\u201364. doi: 10.1016\/j.cosrev.2007.05.001","journal-title":"Comput Sci Rev"},{"key":"637_CR39","unstructured":"Sommer C (2012) Shortest-path queries in static networks. Submitted to ACM Computing Surveys"},{"key":"637_CR40","volume-title":"Pattern Recognition","author":"S Theodoridis","year":"2006","unstructured":"Theodoridis S, Koutroumbas K (2006) Pattern Recognition, 3rd edn. Academic Press, Inc., Orlando","edition":"3"},{"key":"637_CR41","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan JY (2006) Fast random walk with restart and its applications. In: Proceedings of the Sixth International Conference on Data Mining, ICDM \u201906. IEEE Computer Society, Washington, pp 613\u2013622. doi: 10.1109\/ICDM.2006.70","DOI":"10.1109\/ICDM.2006.70"},{"issue":"3","key":"637_CR42","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch DI (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645\u2013678. doi: 10.1109\/TNN.2005.845141","journal-title":"IEEE Trans Neural Netw"},{"key":"637_CR43","doi-asserted-by":"crossref","unstructured":"Zhu AD, Ma H, Xiao X, Luo S, Tang Y, Zhou S (2013) Shortest path and distance queries on road networks: Towards bridging theory and practice. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201913. ACM, New York, pp 857\u2013868. doi: 10.1145\/2463676.2465277","DOI":"10.1145\/2463676.2465277"},{"key":"637_CR44","doi-asserted-by":"crossref","unstructured":"Zhu AD, Xiao X, Wang S, Lin W (2013) Efficient single-source shortest path and distance queries on large graphs. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201913. ACM, New York, pp 998\u20131006. doi: 10.1145\/2487575.2487665","DOI":"10.1145\/2487575.2487665"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0637-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0637-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0637-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T21:56:19Z","timestamp":1717710979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0637-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,30]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["637"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0637-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,30]]}}}