{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:54:54Z","timestamp":1771700094936,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319615417","type":"print"},{"value":"9783319615424","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T00:00:00Z","timestamp":1499212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-61542-4_20","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T08:02:27Z","timestamp":1499155347000},"page":"208-218","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of Investment Relationships Between Companies and Organizations Based on Knowledge Graph"],"prefix":"10.1007","author":[{"given":"Xiaobo","family":"Hu","sequence":"first","affiliation":[]},{"given":"Xinhuai","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Feilong","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"issue":"1","key":"20_CR1","first-page":"94","volume":"27","author":"R Agrawal","year":"2005","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. Data Min. Knowl. Discov. 27(1), 94\u2013105 (2005)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"20_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/ijoc.10.2.163","volume":"10","author":"YL Chou","year":"1998","unstructured":"Chou, Y.L., Romeijn, H.E., Smith, R.L.: Approximating shortest paths in large-scale networks with an application to intelligent transportation. Informs J. Comput. 10(2), 163\u2013179 (1998)","journal-title":"Informs J. Comput."},{"issue":"1","key":"20_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"20_CR4","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise (1996)"},{"issue":"11","key":"20_CR5","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu, L., Sun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324\u20133343 (2006)","journal-title":"Comput. Oper. Res."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: ACM Conference on Hypertext and Hypermedia : Links, Objects, Time and Space\u2014Structure in Hypermedia Systems: Links, Objects, Time and Space\u2014Structure in Hypermedia Systems, pp. 225\u2013234 (1998)","DOI":"10.1145\/276627.276652"},{"issue":"1","key":"20_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01299142","volume":"2","author":"RV Helgason","year":"1993","unstructured":"Helgason, R.V., Kennington, J.L., Stewart, B.D.: The one-to-one shortest-path problem: an empirical analysis with the two-tree Dijkstra algorithm. Comput. Optim. Appl. 2(1), 47\u201375 (1993)","journal-title":"Comput. Optim. Appl."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.artint.2012.06.001","volume":"194","author":"J Hoffart","year":"2013","unstructured":"Hoffart, J., Suchanek, F.M., Berberich, K., Weikum, G.: Yago2: a spatially and temporally enhanced knowledge base from Wikipedia (extended abstract). Artif. Intell. 194, 28\u201361 (2013)","journal-title":"Artif. Intell."},{"issue":"4","key":"20_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TITS.2002.806806","volume":"3","author":"GR Jagadeesh","year":"2003","unstructured":"Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Trans. Intell. Transp. Syst. 3(4), 301\u2013309 (2003)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"20_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann, J., Isele, R., Jakob, M., Jentzsch, A., Kontokostas, D., Mendes, P.N., Hellmann, S., Morsey, M., Kleef, P.V., Auer, S.: Dbpedia - a large-scale, multilingual knowledge base extracted from wikipedia. Semant. Web 6(2), 167\u2013195 (2015)","journal-title":"Semant. Web"},{"issue":"4","key":"20_CR11","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/3468.594911","volume":"27","author":"B Liu","year":"1997","unstructured":"Liu, B.: Route finding by using knowledge about the road network. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 27(4), 436\u2013448 (1997)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69(2 Pt 2), 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"20_CR14","unstructured":"Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: International Conference on Very Large Data Bases, pp. 144\u2013155 (1994)"},{"issue":"October","key":"20_CR15","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/11561071_51","volume":"3669","author":"P Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. Lect. Notes Comput. Sci. 3669(October), 568\u2013579 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Experimental Algorithms, InternationalWorkshop, Wea 2007, Rome, Italy, 6\u20138 June 2007, Proceedings, pp. 66\u201379 (2007)","DOI":"10.1007\/978-3-540-72845-0_6"},{"issue":"8","key":"20_CR17","first-page":"888","volume":"22","author":"J Shi","year":"2002","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. In: Symposium on Switching and Automata Theory, 1971, pp. 114\u2013121 (2006)","DOI":"10.1109\/SWAT.1971.10"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June, pp. 567\u2013580 (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824\u2013833 (2007)","DOI":"10.1145\/1281192.1281280"},{"issue":"1","key":"20_CR21","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endowment 2(1), 718\u2013729 (2009)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Advances in Intelligent Systems and Computing","Innovative Mobile and Internet Services in Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61542-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T13:50:56Z","timestamp":1602424256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61542-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,5]]},"ISBN":["9783319615417","9783319615424"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61542-4_20","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,5]]}}}