Fetching the paper…
Reading the bibliography…
Entity Resolution (ER) is a constitutional part for integrating different knowledge graphs in order to identify entities referring to the same real-world object.
1906
Earlier work this paper cites.
M. G. Elfeky, A. K. Elmagarmid, and V. S. Verykios, “Tailor: A record linkage tool box,” in ICDE , 2002
2002
Earlier work this paper cites.
S. Sarawagi and A. Bhamidipaty, “Interactive deduplication using active learning,” in KDD , 2002
2002
Earlier work this paper cites.
P. Domingos, “Multi-relational record linkage,” in In Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining , 2004, pp. 31–48
2004
Earlier work this paper cites.
I. Bhattacharya and L. Getoor, “Collective entity resolution in relational data,” IEEE Data Eng. Bull. , vol. 29, pp. 4–12, 2006
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
J. Demšar, “Statistical comparisons of classifiers over multiple data sets,” Journal of Machine Learning Research , vol. 7, pp. 1–30, 2006
2006
Earlier work this paper cites.
A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios, “Duplicate record detection: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 19, pp. 1–16, 2007
2007
Earlier work this paper cites.
J. Volz, C. Bizer, M. Gaedke, and G. Kobilarov, “Silk - a link discovery framework for the web of data,” in LDOW , 2009
2009
Earlier work this paper cites.
H. Köpcke, A. Thor, and E. Rahm, “Evaluation of entity resolution approaches on real-world match problems,” Proceedings of the VLDB Endowment , 2010
2010
Earlier work this paper cites.
P. Christen, Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection . Springer Publishing Company, Incorporated, 2012
2012
Earlier work this paper cites.
A. Nikolov, M. d’Aquin, and E. Motta, “Unsupervised learning of link discovery configuration,” in ESWC , 2012
2012
Earlier work this paper cites.
R. Isele and C. Bizer, “Learning expressive linkage rules using genetic programming,” PVLDB , vol. 5, pp. 1638–1649, 2012
2012
Earlier work this paper cites.
A.-C. N. Ngomo and K. Lyko, “Eagle: Efficient active learning of link specifications using genetic programming,” in ESWC , 2012
2012
Cited alongside, same era.
A.-C. N. Ngomo and K. Lyko, “Unsupervised learning of link specifications: deterministic vs. non-deterministic,” in OM , 2013
2013
Cited alongside, same era.
S. Lacoste-Julien, K. Palla, A. Davies, G. Kasneci, T. Graepel, and Z. Ghahramani, “Sigma: simple greedy matching for aligning large knowledge bases,” in KDD , 2013
2013
Cited alongside, same era.
A. Bordes, N. Usunier, A. Garcia-Durán, J. Weston, and O. Yakhnenko, “Translating embeddings for modeling multi-relational data,” in Advances in Neural Information Processing Systems , 2013
2013
Cited alongside, same era.
T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimation of word representations in vector space,” 2013
2013
T. Chen and C. Guestrin, “XGBoost: A scalable tree boosting system,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , ser. KDD ’16. ACM, 2016, pp. 785–794. [Online]. Available: http://doi.acm.org/10.1145/2939672.2939785
2016
Later among the works it cites.
M. A. Sherif, A.-C. N. Ngomo, and J. Lehmann, “Wombat - a generalization approach for automatic link discovery,” in ESWC , 2017
2017
Later among the works it cites.
M. Nentwig, M. Hartung, A.-C. N. Ngomo, and E. Rahm, “A survey of current link discovery frameworks,” Semantic Web , vol. 8, pp. 419–436, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Z. Wang, J. Zhang, J. Feng, and Z. Chen, “Knowledge graph embedding by translating on hyperplanes,” 2014. [Online]. Available: https://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8531
2014
Cited alongside, same era.
M. Pershina, M. Yakout, and K. Chakrabarti, “Holistic entity matching across knowledge graphs,” 2015 IEEE International Conference on Big Data (Big Data) , pp. 1585–1590, 2015
2015
Cited alongside, same era.
Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, “Learning entity and relation embeddings for knowledge graph completion,” 2015. [Online]. Available: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9571
2015
Cited alongside, same era.
G. Ji, S. He, L. Xu, K. Liu, and J. Zhao, “Knowledge graph embedding via dynamic mapping matrix,” in Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) . Beijing, China: Association for Computational Linguistics, Jul. 2015, pp. 687–696. [Online]. Available: https://www.aclweb.org/anthology/P15-1067
2015
Cited alongside, same era.
P. Konda, S. Das, P. S. G. C., A. Doan, A. Ardalan, J. R. Ballard, H. Li, F. Panahi, H. Zhang, J. F. Naughton, S. Prasad, G. Krishnan, R. Deep, and V. Raghavendra, “Magellan: Toward building entity matching management systems,” Proc. VLDB Endow. , vol. 9, no. 12, pp. 1197–1208, 2016. [Online]. Available: http://www.vldb.org/pvldb/vol9/p1197-pkonda.pdf
2016
Cited alongside, same era.
L. Zhu, M. Ghasemi-Gol, P. A. Szekely, A. Galstyan, and C. A. Knoblock, “Unsupervised entity resolution on multi-type graphs,” in ISWC , 2016
2016
Cited alongside, same era.
T. Trouillon, J. Welbl, S. Riedel, Éric Gaussier, and G. Bouchard, “Complex embeddings for simple link prediction,” 2016
2016
Cited alongside, same era.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” 2017
2017
Later among the works it cites.
S. Mudgal, H. Li, T. Rekatsinas, A. Doan, Y. Park, G. Krishnan, R. Deep, E. Arcaute, and V. Raghavendra, “Deep learning for entity matching: A design space exploration,” in Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018 . ACM, 2018, pp. 19–34. [Online]. Available: https://doi.org/10.1145/3183713.3196926
2018
Later among the works it cites.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in The Semantic Web . Cham: Springer International Publishing, 2018, pp. 593–607
2018
Later among the works it cites.
Z. Sun, W. Hu, Q. Zhang, and Y. Qu, “Bootstrapping entity alignment with knowledge graph embedding,” IJCAI International Joint Conference on Artificial Intelligence , vol. 2018-July, pp. 4396–4402, 2018
2018
Later among the works it cites.
Z. Sun, Z.-H. Deng, J.-Y. Nie, and J. Tang, “Rotate: Knowledge graph embedding by relational rotation in complex space,” 2019
2019
Later among the works it cites.
Y. Wu, X. Liu, Y. Feng, Z. Wang, R. Yan, and D. Zhao, “Relation-aware entity alignment for heterogeneous knowledge graphs,” Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence , Aug 2019. [Online]. Available: http://dx.doi.org/10.24963/ijcai.2019/733
2019
Later among the works it cites.
Z. Sun, Q. Zhang, W. Hu, C. Wang, M. Chen, F. Akrami, and C. Li, “A benchmarking study of embedding-based entity alignment for knowledge graphs,” Proceedings of the VLDB Endowment , vol. 13, no. 11, pp. 2326–2340, 2020. [Online]. Available: http://www.vldb.org/pvldb/vol13/p2326-sun.pdf
2020
Later among the works it cites.
S. Herbold, “Autorank: A python package for automated ranking of classifiers,” Journal of Open Source Software , vol. 5, no. 48, p. 2173, 2020. [Online]. Available: https://doi.org/10.21105/joss.02173
2020
Later among the works it cites.