Abstract
Concept discovery is one of the most commonly addressed tasks of multi-relational data mining and is concerned with inducing logical definitions of a relation in terms of other relations provided. The problem has long been studied from Inductive Logic Programming and graph-oriented perspectives. In this study, we investigate the problem from graph databases perspective and propose a pathfinding-based method for concept discovery in graph databases. More specifically, we introduce a method that employs Neo4j graph database technology to store data and find the concept descriptors that define the target relation and implements several techniques to further improve the post processing steps of concept discovery process. The experimental results show that the proposed method is superior to state-of-the art concept discovery systems in terms of rule induction time, discovers shorter concept descriptors with high coverage and F1 score, and scales well.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Fonseca, N.A., Srinivasan, A., Silva, F.M.A., Camacho, R.: Parallel ILP for distributed-memory architectures. Mach. Learn. 74(3), 257–279 (2009)
Rocha, R., Fonseca, N., Costa, V.S.: On applying tabling to inductive logic programming. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 707–714. Springer, Heidelberg (2005). doi:10.1007/11564096_72
Richards, B.L., Mooney, R.J.: Learning relations by pathfinding. In: Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA, 12–16 July 1992, pp. 50–55 (1992)
Cook, D.J., Holder, L.B., Djoko, S.: Knowledge discovery from structural data. J. Intell. Inf. Syst. 5(3), 229–248 (1995)
DB-Engines: Trend of graph dbms popularity. http://db-engines.com/en/ranking_trend/graph+dbms. Accessed 03 Feb 2017
Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)
Miller, J.J.: Graph database applications and concepts with neo4j. In: Proceedings of the Southern Association for Information Systems Conference, Atlanta, GA, USA, vol. 2324 (2013)
Abay, N.C., Mutlu, A., Karagoz, P.: A path-finding based method for concept discovery in graphs. In: 6th International Conference on Information, Intelligence, Systems and Applications, IISA 2015, Corfu, Greece, 6–8 July, 2015, pp. 1–6 (2015)
Abay, N.C., Mutlu, A., Karagoz, P.: A graph-based concept discovery method for n-ary relations. In: Madria, S., Hara, T. (eds.) DaWaK 2015. LNCS, vol. 9263, pp. 391–402. Springer, Cham (2015). doi:10.1007/978-3-319-22729-0_30
Dzeroski, S.: Multi-relational data mining: an introduction. SIGKDD Explor. 5(1), 1–16 (2003)
Muggleton, S., Raedt, L.D., Poole, D., Bratko, I., Flach, P.A., Inoue, K., Srinivasan, A.: ILP turns 20 - biography and future challenges. Mach. Learn. 86(1), 3–23 (2012)
Ketkar, N.S., Holder, L.B., Cook, D.J.: Subdue: compression-based frequent pattern discovery in graph data. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 71–76. ACM (2005)
Matsuda, T., Motoda, H., Washio, T.: Graph-based induction and its applications. Adv. Eng. Inf. 16(2), 135–143 (2002)
Gao, Z., Zhang, Z., Huang, Z.: Learning relations by path finding and simultaneous covering. In: CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31–April 2, 2009, Los Angeles, California, USA, vol. 7, pp. 539–543 (2009)
Ong, I.M., Castro Dutra, I., Page, D., Costa, V.S.: Mode directed path finding. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 673–681. Springer, Heidelberg (2005). doi:10.1007/11564096_68
Gao, Z., Zhang, Z., Huang, Z.: Extensions to the relational paths based learning approach RPBL. In: First Asian Conference on Intelligent Information and Database Systems, ACIIDS 2009, Dong hoi, Quang binh, Vietnam, 1–3 April, 2009, pp. 214–219 (2009)
Cattuto, C., Quaggiotto, M., Panisson, A., Averbuch, A.: Time-varying social networks in a graph database: a Neo4j use case. In: First International Workshop on Graph Data Management Experiences and Systems, GRADES 2013, co-loated with SIGMOD/PODS 2013, New York, NY, USA, 24 June, 2013, p. 11 (2013)
Drakopoulos, G., Kanavos, A., Makris, C., Megalooikonomou, V.: On converting community detection algorithms for fuzzy graphs in neo4j. In: CoRR (2016). arXiv:abs/1608.02235
Lee, H., Kwon, J.: Efficient recommender system based on graph data for multimedia application. Int. J. Multimed. Ubiquitous Eng. 8(4) (2013)
Neo4j: the worlds leading graph database. https://neo4j.com. Accessed 03 Feb 2017
Jiang, B.: Traversing graphs in a paging environment, BFS or DFS? Inf. Process. Lett. 37(3), 143–147 (1991)
Mutlu, A., Senkul, P., Kavurucu, Y.: Improving the scalability of ilp-based multi-relational concept discovery system through parallelization. Knowl. Based Syst. 27, 352–368 (2012)
Larson, J., Michalski, R.S.: Inductive inference of VL decision rules. SIGART Newsl. 63, 38–44 (1977)
Kavurucu, Y., Senkul, P., Toroslu, I.H.: Ilp-based concept discovery in multi-relational data mining. Expert Syst. Appl. 36(9), 11418–11428 (2009)
Kavurucu, Y., Senkul, P., Toroslu, I.H.: Concept discovery on relational databases: new techniques for search space pruning and rule quality improvement. Knowl. Based Syst. 23(8), 743–756 (2010)
Peker, N., Mutlu, A.: A graph-path counting approach for learning head output connected relations. In: Nguyen, N.-T., Manolopoulos, Y., Iliadis, L., Trawiński, B. (eds.) ICCCI 2016. LNCS (LNAI), vol. 9876, pp. 387–396. Springer, Cham (2016). doi:10.1007/978-3-319-45246-3_37
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Goz, F., Mutlu, A. (2017). Concept Discovery in Graph Databases. In: Martínez de Pisón, F., Urraca, R., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2017. Lecture Notes in Computer Science(), vol 10334. Springer, Cham. https://doi.org/10.1007/978-3-319-59650-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-59650-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59649-5
Online ISBN: 978-3-319-59650-1
eBook Packages: Computer ScienceComputer Science (R0)