Skip to content

REFERENCES 💡

  • [Achichi2017] Achichi, M., Bellahsene, Z., & Todorov, K. (2017). Legato: Results for oaei 2017. In OM ISWC.

  • [Alhajj20014] Alhajj, R., & Rokne, J. (2014). Encyclopedia of social network analysis and mining. Springer Publishing Company, Incorporated.

  • [Beek2018] Beek, W., Raad, J., Wielemaker, J., & Van Harmelen, F. (2018, June). sameas. cc: The closure of 500m owl: sameas statements. In European semantic web conference (pp. 65-80). Springer, Cham.

  • [Choi2009] Choi, H., Katake, A., Choi, S., Kang, Y., & Choe, Y. (2009, December). Probabilistic combination of multiple evidence. In International Conference on Neural Information Processing (pp. 302-311). Springer, Berlin, Heidelberg.

  • [Euzenat2013] J. Euzenat and P. Shvaiko. Ontology matching. Springer-Verlag, Heidelberg (DE), 2nd edition, 2013.

  • [Frege1952] Frege, G., Geach, P., & Black, M. (1952). Translations from the philosophical writings of Gottlob Frege. Philosophical Library.

  • [Halpin2010] Halpin, H., Hayes, P., McCusker, J., McGuinness, D., & Thompson, H. (2010). When owl: sameas isn’t the same: An analysis of identity in linked data. In International semantic web conference (pp. 305–320).

  • [Idrissou2017] Idrissou, A. K. et al. (2017) ‘Is my:sameAs the same as your:sameAs?’, in Proceedings of the Knowledge Capture Conference on - K-CAP 2017. New York, New York, USA: ACM Press, pp. 1–8. doi: 10.1145/3148011.3148029.

  • [Idrissou2018] Idrissou, A. K., van Harmelen, F. and van den Besselaar, P. (2018) ‘Network metrics for assessing the quality of entity resolution between multiple datasets’, in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, pp. 147–162. doi: 10.1007/978-3-030-03667-6_10.

  • [Idrissou2019] Idrissou, A. et al. (2019) ‘Contextual entity disambiguation in domains with weak identity criteria: Disambiguating golden age amsterdamers’, in K-CAP 2019 - Proceedings of the 10th International Conference on Knowledge Capture. Association for Computing Machinery, Inc, pp. 259–262. doi: 10.1145/3360901.3364440.

  • [Jin2018] Jin, Y., & JáJá, J. F. (2018). Network summarization with preserved spectral properties. CoRR, abs/1802.04447.

  • [Kovalerchuk2017] Kovalerchuk, B. (2017). Relationships Between Probability and Possibility Theories. In Uncertainty Modeling (pp. 97-122). Springer, Cham.

  • [Linked Data] T. Berners-Lee. Linked Data – Design issues. 27 July 2006. URL: https://www.w3.org/DesignIssues/LinkedData.html

  • [Lukasiewicz2008] Lukasiewicz, T., & Straccia, U. (2008). Managing uncertainty and vagueness in description logics for the semantic webJournal of Web Semantics, 6(4), 291–308.

  • [Nguyen2014] Nguyen, V., Bodenreider, O., & Sheth, A. (2014). Don’t like RDF reification? making statements about statements using singleton property. In Proceedings of the 23rd international conference on World wide web (pp. 759–770).

  • [N-ary Relations] Rector, A. and Noy, N. (2006) Defining N-ary Relations on the Semantic Web. Available at: https://www.w3.org/TR/2006/NOTE-swbp-n-aryRelations-20060412/.

  • [OpenPhacts] Batchelor, C. et al. (2014) ‘Scientific Lenses to Support Multiple Views over Linked Chemistry Data’, in. Springer International Publishing, pp. 98–113. doi: 10.1007/978-3-319-11964-9_7.

  • [Raad2018] Raad, J., Beek, W., Van Harmelen, F., Pernelle, N., & Saïs, F. (2018, October). Detecting erroneous identity links on the web using network metrics. In International semantic web conference (pp. 391-407). Springer, Cham.

  • [Raad2020] Raad, J., Beek, W., van Harmelen, F., Wielemaker, J., Pernelle, N., & Saïs, F. (2020). Constructing and Cleaning Identity Graphs in the LOD Cloud. Data Intelligence, 2(3), 323-352.

  • [RDF11-CONCEPTS] Richard Cyganiak, David Wood, Markus Lanthaler. RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation, 25 February 2014. URL: http://www.w3.org/TR/2014/REC-rdf11-concepts-20140225/. The latest edition is available at http://www.w3.org/TR/rdf11-concepts/

  • [RFC2141] R. Moats. URN Syntax. May 1997. RFC. URL: http://www.ietf.org/rfc/rfc2141.txt

  • [RFC3305] M. Mealling; R. Denenberg. Report from the Joint W3C/IETF URI Planning Interest Group: Uniform Resource Identifiers (URIs), URLs, and Uniform Resource Names (URNs): Clarifications and Recommendations. August 2002. RFC. URL: http://www.ietf.org/rfc/rfc3305.txt

  • [RFC3986] T. Berners-Lee; R. Fielding; L. Masinter. Uniform Resource Identifier (URI): Generic Syntax. January 2005. RFC. URL: http://www.ietf.org/rfc/rfc3986.txt

  • [RFC3987] M. Dürst; M. Suignard. Internationalized Resource Identifiers (IRIs). January 2005. RFC. URL: http://www.ietf.org/rfc/rfc3987.txt

  • [RDF*]

  • [Schoenfisch2014] Schoenfisch, J. (2014). Querying probabilistic ontologies with SPARQLInformatik 2014.s

  • [Sentz2002] Sentz, K., & Ferson, S. (2002). Combination of evidence in Dempster-Shafer theory (Vol. 4015). Albuquerque: Sandia National Laboratories.

  • [Shen2010] Shen, H. W., & Cheng, X. Q. (2010). Spectral methods for the detection of network community structure: a comparative analysis. Journal of Statistical Mechanics: Theory and Experiment, 2010(10), P10020.

  • [Toivonen2011] Toivonen, H., Zhou, F., Hartikainen, A., & Hinkka, A. (2011). Compression of weighted graphs. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 965–973).

  • [VoID] K. Alexander, R. Cyganiak, M. Hausenblas, and J. Zhao. Describing LinkedDatasets with the VoID Vocabulary. Technical report, 2011. W3C Note. URL:https://www.w3.org/TR/void/.

  • [Volz2009] Volz, J., Bizer, C., Gaedke, M., & Kobilarov, G. (2009). Silk-a link discovery framework for the web of data.LDOW, 538, 53.