Skip to main content

2016 | OriginalPaper | Buchkapitel

A Self-Adaptive and Incremental Approach for Data Profiling in the Semantic Web

verfasst von : Kenza Kellou-Menouer, Zoubida Kedad

Erschienen in: Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIX

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The increasing adoption of linked data principles has led to the availability of a huge amount of datasets on the Web. However, the use of these datasets is hindered by the lack of descriptive information about their content. Indeed, interlinking, matching or querying them requires some knowledge about the types and properties they contain.
In this paper, we tackle the problem of describing the content of an RDF dataset by profiling its entities, which consists in discovering the implicit types and providing their description. Each type is described by a profile composed of properties and their probabilities. Our approach relies on a clustering algorithm. It is self-adaptive, as it can automatically detect the most appropriate similarity threshold according to the dataset. Our algorithms generate overlapping clusters, enabling the detection of several types for an entity. As a dataset may evolve, our approach is incremental and can assign a type to a new entity and update the type profiles without browsing the whole dataset. We also present some experimental evaluations to demonstrate the effectiveness of our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Resource Description Framework: http://​www.​w3.​org/​RDF/​.
 
3
 
4
Knofuss: technologies.kmi.open.ac.uk/knofuss.
 
5
Silk: wifo5-03.informatik.uni-mannheim.de/bizer/silk.
 
6
Conference: data.semanticweb.org/dumps/conferences/dc-2010-complete.rdf.
 
7
BNF: datahub.io/fr/dataset/data-bnf-fr.
 
8
DBpedia: dbpedia.org.
 
Literatur
2.
Zurück zum Zitat Abedjan, Z., Gruetze, T., Jentzsch, A., Naumann, F.: Profiling and mining RDF data with ProLOD++. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 1198–1201. IEEE (2014) Abedjan, Z., Gruetze, T., Jentzsch, A., Naumann, F.: Profiling and mining RDF data with ProLOD++. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 1198–1201. IEEE (2014)
3.
Zurück zum Zitat Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. ACM Sigmod Record 28, 49–60 (1999). ACMCrossRef Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. ACM Sigmod Record 28, 49–60 (1999). ACMCrossRef
4.
Zurück zum Zitat Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: A nucleus for a web of open data the semantic web. The Semantic Web (2007) Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: A nucleus for a web of open data the semantic web. The Semantic Web (2007)
5.
Zurück zum Zitat Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Record 19, 322–331 (1990). ACMCrossRef Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Record 19, 322–331 (1990). ACMCrossRef
6.
Zurück zum Zitat Bezdek, J.C., Ehrlich, R., Full, W.: FCM: The fuzzy C-Means clustering algorithm. Comput. Geosci. 10, 191–203 (1984)CrossRef Bezdek, J.C., Ehrlich, R., Full, W.: FCM: The fuzzy C-Means clustering algorithm. Comput. Geosci. 10, 191–203 (1984)CrossRef
7.
Zurück zum Zitat Böhm, C., Lorey, J., Naumann, F.: Creating void descriptions for web-scale data. Web Semant. Sci. Serv. Agents World Wide Web 9(3), 339–345 (2011)CrossRef Böhm, C., Lorey, J., Naumann, F.: Creating void descriptions for web-scale data. Web Semant. Sci. Serv. Agents World Wide Web 9(3), 339–345 (2011)CrossRef
8.
Zurück zum Zitat Böhm, C., Naumann, F., Abedjan, Z., Fenz, D., Grütze, T., Hefenbrock, D., Pohl, M., Sonnabend, D.: Profiling linked open data with ProLOD. In: 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW), pp. 175–178. IEEE (2010) Böhm, C., Naumann, F., Abedjan, Z., Fenz, D., Grütze, T., Hefenbrock, D., Pohl, M., Sonnabend, D.: Profiling linked open data with ProLOD. In: 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW), pp. 175–178. IEEE (2010)
9.
Zurück zum Zitat Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41338-4_18 CrossRef Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013). doi:10.​1007/​978-3-642-41338-4_​18 CrossRef
10.
Zurück zum Zitat Christodoulou, K., Paton, N.W., Fernandes, A.A.A.: Structure inference for linked data sources using clustering. In: Hameurlain, A., Küng, J., Wagner, R., Bianchini, D., Antonellis, V., Virgilio, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XIX. LNCS, vol. 8990, pp. 1–25. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46562-2_1 Christodoulou, K., Paton, N.W., Fernandes, A.A.A.: Structure inference for linked data sources using clustering. In: Hameurlain, A., Küng, J., Wagner, R., Bianchini, D., Antonellis, V., Virgilio, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XIX. LNCS, vol. 8990, pp. 1–25. Springer, Heidelberg (2015). doi:10.​1007/​978-3-662-46562-2_​1
11.
Zurück zum Zitat Clerkin, P., Cunningham, P., Hayes, C.: Ontology discovery for the semantic web using hierarchical clustering. Semantic Web Min. 1, 17 (2001) Clerkin, P., Cunningham, P., Hayes, C.: Ontology discovery for the semantic web using hierarchical clustering. Semantic Web Min. 1, 17 (2001)
12.
Zurück zum Zitat Dasarathy, B.V.: Nearest neighbor (NN) norms: NN pattern classification techniques (1991) Dasarathy, B.V.: Nearest neighbor (NN) norms: NN pattern classification techniques (1991)
13.
Zurück zum Zitat Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. 39, 1–38 (1977)MathSciNetMATH Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. 39, 1–38 (1977)MathSciNetMATH
14.
Zurück zum Zitat Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proceedings of the 24th International Conference on Very Large Data Bases, pp. 323–333. Morgan Kaufmann Publishers Inc. (1998) Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proceedings of the 24th International Conference on Very Large Data Bases, pp. 323–333. Morgan Kaufmann Publishers Inc. (1998)
15.
Zurück zum Zitat Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996) Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)
16.
Zurück zum Zitat Fanizzi, N., Amato, C.D., Esposito, F.: Metric-based stochastic conceptual clustering for ontologies. Inf. Syst. 34(8), 792–806 (2009)CrossRef Fanizzi, N., Amato, C.D., Esposito, F.: Metric-based stochastic conceptual clustering for ontologies. Inf. Syst. 34(8), 792–806 (2009)CrossRef
17.
Zurück zum Zitat Fetahu, B., Dietze, S., Pereira Nunes, B., Antonio Casanova, M., Taibi, D., Nejdl, W.: A scalable approach for efficiently generating structured dataset topic profiles. In: Presutti, V., d’Amato, C., Gandon, F., d’Aquin, M., Staab, S., Tordai, A. (eds.) ESWC 2014. LNCS, vol. 8465, pp. 519–534. Springer, Heidelberg (2014). doi:10.1007/978-3-319-07443-6_35 CrossRef Fetahu, B., Dietze, S., Pereira Nunes, B., Antonio Casanova, M., Taibi, D., Nejdl, W.: A scalable approach for efficiently generating structured dataset topic profiles. In: Presutti, V., d’Amato, C., Gandon, F., d’Aquin, M., Staab, S., Tordai, A. (eds.) ESWC 2014. LNCS, vol. 8465, pp. 519–534. Springer, Heidelberg (2014). doi:10.​1007/​978-3-319-07443-6_​35 CrossRef
18.
Zurück zum Zitat Fisher, D.H.: Knowledge acquisition via incremental conceptual clustering. Mach. Learn. 2(2), 139–172 (1987) Fisher, D.H.: Knowledge acquisition via incremental conceptual clustering. Mach. Learn. 2(2), 139–172 (1987)
19.
Zurück zum Zitat Heath, T., Bizer, C.: Linked data: Evolving the web into a global data space. Synth. Lect. Semant. Web Theor. Technol. 1(1), 1–136 (2011)CrossRef Heath, T., Bizer, C.: Linked data: Evolving the web into a global data space. Synth. Lect. Semant. Web Theor. Technol. 1(1), 1–136 (2011)CrossRef
20.
Zurück zum Zitat Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31, 651–666 (2010)CrossRef Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31, 651–666 (2010)CrossRef
21.
Zurück zum Zitat Kaufman, L., Rousseeuw, P.: Clustering by Means of Medoids. Reports of the Faculty of Mathematics and Informatics, Faculty of Mathematics and Informatics (1987) Kaufman, L., Rousseeuw, P.: Clustering by Means of Medoids. Reports of the Faculty of Mathematics and Informatics, Faculty of Mathematics and Informatics (1987)
22.
Zurück zum Zitat Kellou-Menouer, K., Kedad, Z.: Evaluating the gap between an RDF dataset and its schema. In: Jeusfeld, M.A., Karlapalem, K. (eds.) ER 2015. LNCS, vol. 9382, pp. 283–292. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25747-1_28 CrossRef Kellou-Menouer, K., Kedad, Z.: Evaluating the gap between an RDF dataset and its schema. In: Jeusfeld, M.A., Karlapalem, K. (eds.) ER 2015. LNCS, vol. 9382, pp. 283–292. Springer, Heidelberg (2015). doi:10.​1007/​978-3-319-25747-1_​28 CrossRef
23.
Zurück zum Zitat Kellou-Menouer, K., Kedad, Z.: Schema discovery in RDF data sources. In: Johannesson, P., Lee, M.L., Liddle, S.W., Opdahl, A.L., López, Ó.P. (eds.) ER 2015. LNCS, vol. 9381, pp. 481–495. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25264-3_36 CrossRef Kellou-Menouer, K., Kedad, Z.: Schema discovery in RDF data sources. In: Johannesson, P., Lee, M.L., Liddle, S.W., Opdahl, A.L., López, Ó.P. (eds.) ER 2015. LNCS, vol. 9381, pp. 481–495. Springer, Heidelberg (2015). doi:10.​1007/​978-3-319-25264-3_​36 CrossRef
24.
Zurück zum Zitat Konrath, M., Gottron, T., Staab, S., Scherp, A.: Schemex: efficient construction of a data catalogue by stream-based indexing of linked data. Web Semant. Sci. Serv. Agents on the World Wide Web 16, 52–58 (2012)CrossRef Konrath, M., Gottron, T., Staab, S., Scherp, A.: Schemex: efficient construction of a data catalogue by stream-based indexing of linked data. Web Semant. Sci. Serv. Agents on the World Wide Web 16, 52–58 (2012)CrossRef
26.
Zurück zum Zitat Maali, F., Campinas, S., Decker, S.: Gagg: a graph aggregation operator. In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudré-Mauroux, P., Zimmermann, A. (eds.) ESWC 2015. LNCS, vol. 9088, pp. 491–504. Springer, Heidelberg (2015). doi:10.1007/978-3-319-18818-8_30 CrossRef Maali, F., Campinas, S., Decker, S.: Gagg: a graph aggregation operator. In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudré-Mauroux, P., Zimmermann, A. (eds.) ESWC 2015. LNCS, vol. 9088, pp. 491–504. Springer, Heidelberg (2015). doi:10.​1007/​978-3-319-18818-8_​30 CrossRef
27.
Zurück zum Zitat Michalewicz, Z.: Genetic algorithms + data structures = evolution programs. Springer Science & Business Media (2013) Michalewicz, Z.: Genetic algorithms + data structures = evolution programs. Springer Science & Business Media (2013)
28.
Zurück zum Zitat Naumann, F.: Data profiling revisited. ACM SIGMOD Record 42(4), 40–49 (2014)CrossRef Naumann, F.: Data profiling revisited. ACM SIGMOD Record 42(4), 40–49 (2014)CrossRef
29.
Zurück zum Zitat Nestorov, S., Abiteboul, S., Motwani, R.: Extracting schema from semistructured data. ACM SIGMOD Record 27, 295–306 (1998). ACMCrossRef Nestorov, S., Abiteboul, S., Motwani, R.: Extracting schema from semistructured data. ACM SIGMOD Record 27, 295–306 (1998). ACMCrossRef
30.
Zurück zum Zitat Pena, P.: Determining the similarity threshold for clustering algorithms in the logical combinatorial pattern recognition through a dendograme. In: 4th Iberoamerican Simposium of Pattern Recognition, pp. 259–265 (1999) Pena, P.: Determining the similarity threshold for clustering algorithms in the logical combinatorial pattern recognition through a dendograme. In: 4th Iberoamerican Simposium of Pattern Recognition, pp. 259–265 (1999)
31.
Zurück zum Zitat Quilitz, B., Leser, U.: Querying distributed RDF data sources with SPARQL. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 524–538. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68234-9_39 CrossRef Quilitz, B., Leser, U.: Querying distributed RDF data sources with SPARQL. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 524–538. Springer, Heidelberg (2008). doi:10.​1007/​978-3-540-68234-9_​39 CrossRef
32.
Zurück zum Zitat Reyes-Gonzalez, R., Ruiz-Shulcloper, J.: An algorithm for restricted structuralization of spaces. Proc. IV SIARP 267 (1999) Reyes-Gonzalez, R., Ruiz-Shulcloper, J.: An algorithm for restricted structuralization of spaces. Proc. IV SIARP 267 (1999)
33.
Zurück zum Zitat Rizzo, G., Fanizzi, N., d’Amato, C., Esposito, F.: Prediction of class and property assertions on OWL ontologies through evidence combination. In: Proceedings of the International Conference on Web Intelligence, Mining and Semantics, p. 45. ACM (2011) Rizzo, G., Fanizzi, N., d’Amato, C., Esposito, F.: Prediction of class and property assertions on OWL ontologies through evidence combination. In: Proceedings of the International Conference on Web Intelligence, Mining and Semantics, p. 45. ACM (2011)
34.
Zurück zum Zitat Sánchez-Díaz, G., Martínez-Trinidad, J.F.: Determination of similarity threshold in clustering problems for large data sets. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol. 2905, pp. 611–618. Springer, Heidelberg (2003). doi:10.1007/978-3-540-24586-5_75 CrossRef Sánchez-Díaz, G., Martínez-Trinidad, J.F.: Determination of similarity threshold in clustering problems for large data sets. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol. 2905, pp. 611–618. Springer, Heidelberg (2003). doi:10.​1007/​978-3-540-24586-5_​75 CrossRef
35.
Zurück zum Zitat Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web (2007) Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web (2007)
36.
Zurück zum Zitat Wang, Q.Y., Yu, J.X., Wong, K.-F.: Approximate graph schema extraction for semi-structured data. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 302–316. Springer, Heidelberg (2000). doi:10.1007/3-540-46439-5_21 CrossRef Wang, Q.Y., Yu, J.X., Wong, K.-F.: Approximate graph schema extraction for semi-structured data. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 302–316. Springer, Heidelberg (2000). doi:10.​1007/​3-540-46439-5_​21 CrossRef
Metadaten
Titel
A Self-Adaptive and Incremental Approach for Data Profiling in the Semantic Web
verfasst von
Kenza Kellou-Menouer
Zoubida Kedad
Copyright-Jahr
2016
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-54037-4_4

Premium Partner