Abstract
Investment relationship investigation is an important part of financial investigation. However, extraction and analysis of investment relationships becomes more difficult since the increment of the number of enterprises, complexity of company structure, and diversity of investment. This paper uses a knowledge graph of companies to find whether investment relationships between two companies and common investors among target companies exist. In this paper, firstly, find investment relationships between two companies by path finding algorithm to check whether investment paths exist between them. Secondly, use Depth First Search algorithm to check whether common investors exist. Thirdly, knowledge graph contains a great number of companies and relationships between them so that it is inefficient and difficult to compute directly from all the companies nodes. To overcome this problem, this paper will use graph compression to decrease the number of nodes to compute.
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
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–105 (2005)
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–179 (1998)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1(1), 269–271 (1959)
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise (1996)
Fu, L., Sun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324–3343 (2006)
Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: ACM Conference on Hypertext and Hypermedia : Links, Objects, Time and Space—Structure in Hypermedia Systems: Links, Objects, Time and Space—Structure in Hypermedia Systems, pp. 225–234 (1998)
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–75 (1993)
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–61 (2013)
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–309 (2003)
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–195 (2015)
Liu, B.: Route finding by using knowledge about the road network. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 27(4), 436–448 (1997)
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–432 (2008)
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)
Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: International Conference on Very Large Data Bases, pp. 144–155 (1994)
Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. Lect. Notes Comput. Sci. 3669(October), 568–579 (2005)
Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Experimental Algorithms, InternationalWorkshop, Wea 2007, Rome, Italy, 6–8 June 2007, Proceedings, pp. 66–79 (2007)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2002)
Tarjan, R.: Depth-first search and linear graph algorithms. In: Symposium on Switching and Automata Theory, 1971, pp. 114–121 (2006)
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–580 (2008)
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–833 (2007)
Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. Proc. VLDB Endowment 2(1), 718–729 (2009)
Acknowledgments
The authors would like to thank Wenkai Bai for the support in this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Hu, X., Tang, X., Tang, F. (2018). Analysis of Investment Relationships Between Companies and Organizations Based on Knowledge Graph. In: Barolli, L., Enokido, T. (eds) Innovative Mobile and Internet Services in Ubiquitous Computing . IMIS 2017. Advances in Intelligent Systems and Computing, vol 612. Springer, Cham. https://doi.org/10.1007/978-3-319-61542-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-61542-4_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61541-7
Online ISBN: 978-3-319-61542-4
eBook Packages: EngineeringEngineering (R0)