<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Lutov, Artem</dc:creator>
  <dc:creator>Roshankish, Soheil</dc:creator>
  <dc:creator>Khayati, Mourad</dc:creator>
  <dc:creator>Cudré-Mauroux, Philippe</dc:creator>
  <dc:date>2018-12-01</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">Large knowledge bases typically contain data adhering to various schemas with  incomplete and/or noisy type information. This seriously complicates further  integration and post-processing efforts, as type information is crucial in correctly  handling the data. In this paper, we introduce a novel statistical type inference  method, called StaTIX, to effectively infer instance types in Linked Data sets in a fully  unsupervised manner. Our inference technique leverages a new hierarchical  clustering algorithm that is robust, highly effective, and scalable. We introduce a novel  approach to reduce the processing complexity of the similarity matrix specifying the  relations between various instances in the knowledge base. This approach speeds up  the inference process while also improving the correctness of the inferred types due to  the noise attenuation in the input data. We further optimize the clustering process by  introducing a dedicated hash function that speeds up the inference process by orders  of magnitude without negatively affecting its accuracy. Finally, we describe a new  technique to identify representative clusters from the multi-scale output of our  clustering algorithm to further improve the accuracy of the inferred types. We  empirically evaluate our approach on several real-world datasets and compare it to  the state of the art. Our results show that StaTIX is more efficient than existing  methods (both in terms of speed and memory consumption) as well as more effective.  StaTIX reduces the F1-score error of the predicted types by about 40% on average  compared to the state of the art and improves the execution time by orders of  magnitude.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://folia.unifr.ch/global/documents/307777</dc:identifier>
  <dc:identifier>https://folia.unifr.ch/documents/307777/files/cud_sst.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1109/BigData.2018.8622285</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:source>2018 IEEE International Conference on Big Data (Big Data). - 2018, p. 2253–2262</dc:source>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns1="xml" ns1:lang="en">Statix - statistical type inference on linked data</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
</oai_dc:dc>
