CoChat

Knowledge graph fusion for smart systems: A Survey

Nguyen, Hoang Long, Vu, Dang Thinh, Jung, Jason J. · 2020 · Information Fusion
Cited by 114

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

The emergence of various disruptive technologies such as big data, Internet of Things, and artificial intelligence have instigated our society to generate enormous volumes of data. The effective, efficient, and transparent capture and fusion of knowledge from a massive amount data is becoming an increasingly popular and crucial topic. In this study, we aim to provide a broad, complete, and systematic overview of the definitions and challenges of the knowledge graph fusion, which represents a holistic approach for integrating, enhancing, and unifying knowledge graphs. Further, advanced techniques for handling knowledge graph fusion along with the pragmatic smart systems leveraging it are discussed as a part of multiple perspectives. We believe that this survey study can be used as a potential reference for system practitioners and researchers in surpassing current obstacles as well as shaping their future direction.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.inffus.2020.03.014

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 55

  1. Feilmayr, 2016, An analysis of ontologies and their success factors for application to business, Data & Knowledge Engineering, 101, 1, 10.1016/j.datak.2015.11.003 · DOI
  2. H.L. Nguyen, J.E. Jung, Socioscope: A framework for understanding internet of social knowledgeFuture Generation Computer Systems 83 (2018) 358–365 · DOI
  3. Wilcke, 2017, The knowledge graph as the default data model for learning on heterogeneous knowledge, Data Science, 1, 39, 10.3233/DS-170007 · DOI · Paper page
  4. Färber, 2018, Linked data quality of dbpedia, freebase, opencyc, wikidata, and yago, Semantic Web, 9, 77
  5. Paulheim, 2017, Knowledge graph refinement: A survey of approaches and evaluation methods, Semantic Web, 8, 489
  6. Ai, 2018, Learning heterogeneous knowledge base embeddings for explainable recommendation, Algorithms, 11, 137, 10.3390/a11090137 · DOI · Paper page
  7. Nurdiati, 2008, 25 years development of knowledge graph theory: the results and the challenge, Memorandum, 1876, 1
  8. Jung, 2010, Ontology mapping composition for query transformation on distributed environments, Expert Systems with Applications, 37, 8401, 10.1016/j.eswa.2010.05.041 · doi:10.1016/j.eswa.2010.05.041
  9. Hoang, 2015, An ontological framework for context-aware collaborative business process formulation, Computing and Informatics, 33, 553
  10. Jiang, 2002, A plan recognition algorithm based on plan knowledge graph, Journal of Software, 13, 686
  11. Franco-Salvador, 2016, A systematic study of knowledge graph analysis for cross-language plagiarism detection, Information Processing & Management, 52, 550, 10.1016/j.ipm.2015.12.004 · DOI
  12. Chi, 2018, Knowledge graph in smart education: A case study of entrepreneurship scientific publication management, Sustainability, 10, 995, 10.3390/su10040995 · DOI
  13. Long, 2015, Privacy-aware framework for matching online social identities in multiple social networking services, Cybernetics and Systems, 46, 69, 10.1080/01969722.2015.1007737 · DOI
  14. Bleiholder, 2009, Data fusion, ACM Computing Surveys (CSUR), 41, 1, 10.1145/1456650.1456651 · DOI · Paper page
  15. Dong, 2014, From data fusion to knowledge fusion, Proceedings of the VLDB Endowment, 7, 881, 10.14778/2732951.2732962 · DOI · Paper page
  16. Jung, 2010, Reusing ontology mappings for query routing in semantic peer-to-peer environment, Information Sciences, 180, 3248, 10.1016/j.ins.2010.04.018 · doi:10.1016/j.ins.2010.04.018
  17. Papadakis, 2012, A blocking framework for entity resolution in highly heterogeneous information spaces, IEEE Transactions on Knowledge and Data Engineering, 25, 2665, 10.1109/TKDE.2012.150 · DOI
  18. Hernández, 1998, Real-world data is dirty: Data cleansing and the merge/purge problem, Data mining and knowledge discovery, 2, 9, 10.1023/A:1009761603038 · DOI · Paper page
  19. Fellegi, 1969, A theory for record linkage, Journal of the American Statistical Association, 64, 1183, 10.1080/01621459.1969.10501049 · DOI · Paper page
  20. Cochinwala, 2001, Efficient data reconciliation, Information Sciences, 137, 1, 10.1016/S0020-0255(00)00070-0 · DOI
  21. Lehmann, 2015, Dbpedia–a large-scale, multilingual knowledge base extracted from wikipedia, Semantic Web, 6, 167
  22. Suchanek, 2011, Paris: Probabilistic alignment of relations, instances, and schema, PVLDB, 5, 157
  23. Kolda, 2009, Tensor decompositions and applications, SIAM review, 51, 455, 10.1137/07070111X · DOI · Paper page
  24. Carroll, 1970, Analysis of individual differences in multidimensional scaling via an n-way generalization of eckart-young decomposition, Psychometrika, 35, 283, 10.1007/BF02310791 · DOI · Paper page
  25. Tucker, 1966, Some mathematical notes on three-mode factor analysis, Psychometrika, 31, 279, 10.1007/BF02289464 · DOI · Paper page
  26. Harshman, 1994, Parafac: Parallel factor analysis, Computational Statistics & Data Analysis, 18, 39, 10.1016/0167-9473(94)90132-5 · DOI · Paper page
  27. Levenshtein, 1966, Binary codes capable of correcting deletions, insertions, and reversals, Soviet physics doklady, 10, 707
  28. Jaro, 1989, Advances in record-linkage methodology as applied to matching the 1985 census of tampa, florida, Journal of the American Statistical Association, 84, 414, 10.1080/01621459.1989.10478785 · DOI · Paper page
  29. Smith, 1981, Identification of common molecular subsequences, Journal of molecular biology, 147, 195, 10.1016/0022-2836(81)90087-5 · DOI · Paper page
  30. Bilenko, 2003, Adaptive name matching in information integration, IEEE Intelligent Systems, 18, 16, 10.1109/MIS.2003.1234765 · DOI · Paper page
  31. Blei, 2003, Latent dirichlet allocation, Journal of machine Learning research, 3, 993
  32. Breckon, 2014, Nndb: Tracking the entire world, Reference Reviews, 28
  33. Mohammed, 2017, Strong baselines for simple question answering over knowledge graphs with and without neural networks, Computing Research Repository
  34. Dai, 2016, Cfo: Conditional focused neural question answering with large-scale knowledge bases, Computing Research Repository
  35. Golub, 2016, Character-level question answering with attention, Computing Research Repository
  36. Ture, 2016, No need to pay attention: Simple recurrent neural networks work!(for answering” simple” questions), Computing Research Repository
  37. Jia, 2018, A practical approach to constructing a knowledge graph for cybersecurity, Engineering, 4, 53, 10.1016/j.eng.2018.01.004 · DOI · Paper page
  38. Sikos, 2018, Representing network knowledge using provenance-aware formalisms for cyber-situational awareness, Procedia Computer Science, 126, 29, 10.1016/j.procs.2018.07.206 · DOI
  39. Karidi, 2018, Tweet and followee personalized recommendations based on knowledge graphs, Journal of Ambient Intelligence and Humanized Computing, 9, 2035, 10.1007/s12652-017-0491-7 · DOI
  40. Yu, 2017, Knowledge graph for tcm health preservation: Design, construction, and applications, Artificial intelligence in medicine, 77, 48, 10.1016/j.artmed.2017.04.001 · DOI · Paper page
  41. Abdelaziz, 2017, Large-scale structural and textual similarity-based mining of knowledge graph to predict drug–drug interactions, Journal of Web Semantics, 44, 104, 10.1016/j.websem.2017.06.002 · DOI
  42. Wang, 2017, Safe medicine recommendation via medical knowledge graph embedding, Computing Research Repository abs/1710, 05980, 1
  43. Chaudhari, 2017, An entity graph based recommender system, AI Communications, 30, 141, 10.3233/AIC-170728 · DOI
  44. Noia, 2016, Sprank: Semantic path-based ranking for top-n recommendations using linked open data, ACM Transactions on Intelligent Systems and Technology, 8, 9
  45. De Gemmis, 2015, An investigation on the serendipity problem in recommender systems, Information Processing & Management, 51, 695, 10.1016/j.ipm.2015.06.008 · DOI
  46. Berners-Lee, 2001, The semantic web, Scientific american, 284, 28, 10.1038/scientificamerican0501-34 · DOI · Paper page
  47. Nguyen, 2019, Social event decomposition for constructing knowledge graph, Future Generation Computer Systems, 100, 10, 10.1016/j.future.2019.05.016 · DOI
  48. Hoffart, 2013, Yago2: A spatially and temporally enhanced knowledge base from wikipedia, Artificial Intelligence, 194, 28, 10.1016/j.artint.2012.06.001 · DOI · Paper page
  49. Bizer, 2009, Linked data: The story so far, International Journal on Semantic Web and Information Systems, 5, 1, 10.4018/jswis.2009081901 · DOI · Paper page
  50. Pérez, 2009, Semantics and complexity of sparql, ACM Transactions on Database Systems, 34, 16, 10.1145/1567274.1567278 · DOI · Paper page
  51. Liang, 2013, Lambda dependency-based compositional semantics, Computing Research Repository
  52. Weston, 2014, Memory networks, Computing Research Repository
  53. Pingle, 2019, Relext: Relation extraction using deep learning approaches for cybersecurity knowledge graph improvement, Computing Research Repository, 02497, 1
  54. Gegick, 2005, Matching attack patterns to security vulnerabilities in software-intensive system designs, ACM SIGSOFT Software Engineering Notes, 30, 1, 10.1145/1082983.1083211 · doi:10.1145/1082983.1083211
  55. Cappelli, 2009, Common sense guide to prevention and detection of insider threats, Computer Emergency Response Team, 1

Cited by

See all 114

Metadata

Authors
Nguyen, H. L., Vu, D. T., & Jung, J. J.
Venue
Information Fusion
Publisher
Elsevier BV
Published
2020-09
Volume
61
Pages
56-70
ISSN
1566-2535 (ISSN-L)
OpenAlex
W3015158377
Cited by
114
References
13
FWCI
6.06
Type
journal article
Language
en
Open access
closed
Licence
  • www.elsevier.com/tdm/userlicense/1.0/ (tdm)
  • www.elsevier.com/legal/tdmrep-license (tdm)
Funders
National Research Foundation of Korea

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.