Abstract
Entity Resolution is the process of identifying whether or not various entities from different sources are referring to the same real-world entity. Entity Resolution hasn't been extensively researched in graph databases, whereas it has been for relational databases. This paper focuses on providing comparisons of experiments on various datasets to determine the most appropriate method used in the Entity Resolution process from among literature's similarity algorithms, graph embedding techniques, and graph embedding algorithms combined to link prediction. Moreover, if the embedding algorithm employed has an impact on the given results. The results show that the Entity Resolution process performed better when graph embedding techniques were paired with link prediction, and the chosen graph embedding algorithm also has an impact on the results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
