Instance Matching in Knowledge Graphs through random walks and semantics
Authors:
- Ali AssiAAAli Assi
- Wajdi DhifliWDWajdi Dhifli
- 1 October 2021
- journal article
- research article
- Published by Elsevier in Future Generation Computer Systems
- Vol. 123, 73-84
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- SERIMI: Class-Based Matching for Instance Matching Across Heterogeneous DatasetsIEEE Transactions on Knowledge and Data Engineering, 2014
- Walking the interactome for candidate prioritization in exome sequencing studies of Mendelian diseasesBioinformatics, 2014
- Large scale instance matching via multiple indexes and candidate selectionKnowledge-Based Systems, 2013
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 2013
- PARISProceedings of the VLDB Endowment, 2011
- Semi-supervised learning by disagreementKnowledge and Information Systems, 2009
- MapReduceCommunications of the ACM, 2008
- Deeper Inside PageRankInternet Mathematics, 2004
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chainsJournal of Applied Probability, 1965
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957