Skip to main content

2019 | OriginalPaper | Buchkapitel

Revealing the Conceptual Schemas of RDF Datasets

verfasst von : Subhi Issa, Pierre-Henri Paris, Fayçal Hamdi, Samira Si-Said Cherfi

Erschienen in: Advanced Information Systems Engineering

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

RDF-based datasets, thanks to their semantic richness, variety and fine granularity, are increasingly used by both researchers and business communities. However, these datasets suffer a lack of completeness as the content evolves continuously and data contributors are loosely constrained by the vocabularies and schemes related to the data sources. Conceptual schemas have long been recognized as a key mechanism for understanding and dealing with complex real-world systems. In the context of the Web of Data and user-generated content, the conceptual schema is implicit. In fact, each data contributor has an implicit personal model that is not known by the other contributors. Consequently, revealing a meaningful conceptual schema is a challenging task that should take into account the data and the intended usage. In this paper, we propose a completeness-based approach for revealing conceptual schemas of RDF data. We combine quality evaluation and data mining approaches to find a conceptual schema for a dataset, this model meets user expectations regarding data completeness constraints. To achieve that, we propose LOD-CM; a web-based completeness demonstrator for linked datasets.

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!

Literatur
2.
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., De Antonellis, V., De Virgilio, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XIX. LNCS, vol. 8990, pp. 1–25. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46562-2_1CrossRef 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., De Antonellis, V., De Virgilio, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XIX. LNCS, vol. 8990, pp. 1–25. Springer, Heidelberg (2015). https://​doi.​org/​10.​1007/​978-3-662-46562-2_​1CrossRef
4.
Zurück zum Zitat Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM 2001, pp. 163–170. IEEE Computer Society, Washington, DC (2001) Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM 2001, pp. 163–170. IEEE Computer Society, Washington, DC (2001)
5.
Zurück zum Zitat Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) FIMI 2003, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA, CEUR Workshop Proceedings, vol. 90. CEUR-WS.org (2003) Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) FIMI 2003, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA, CEUR Workshop Proceedings, vol. 90. CEUR-WS.org (2003)
6.
Zurück zum Zitat Hamdi, F., Cherfi, S.S.S.: An approach for measuring rdf data completeness. BDA 2015 Gestion de Données-Principes, Technologies et Applications 29 septembre au 2 octobre 2015 \(\hat{}\)Ile de Porquerolles p. 32 (2015) Hamdi, F., Cherfi, S.S.S.: An approach for measuring rdf data completeness. BDA 2015 Gestion de Données-Principes, Technologies et Applications 29 septembre au 2 octobre 2015 \(\hat{}\)Ile de Porquerolles p. 32 (2015)
7.
Zurück zum Zitat Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 16–18 May 2000, Dallas, Texas, USA, pp. 1–12. ACM (2000) Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 16–18 May 2000, Dallas, Texas, USA, pp. 1–12. ACM (2000)
8.
Zurück zum Zitat Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)MathSciNetCrossRef Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)MathSciNetCrossRef
11.
Zurück zum Zitat Bayardo Jr., R.J: Efficiently mining long patterns from databases. In: Haas, L.M., Tiwary, A. (eds.) SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, 2–4 June 1998, Seattle, Washington, USA, pp. 85–93. ACM Press (1998) Bayardo Jr., R.J: Efficiently mining long patterns from databases. In: Haas, L.M., Tiwary, A. (eds.) SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, 2–4 June 1998, Seattle, Washington, USA, pp. 85–93. ACM Press (1998)
13.
Zurück zum Zitat Klyne, G., Carroll, J.J.: Resource description framework (RDF): Concepts and abstract syntax (2006) Klyne, G., Carroll, J.J.: Resource description framework (RDF): Concepts and abstract syntax (2006)
14.
Zurück zum Zitat Levandoski, J.J., Mokbel, M.F.: RDF data-centric storage. In: IEEE International Conference on Web Services, ICWS 2009, pp. 911–918. IEEE (2009) Levandoski, J.J., Mokbel, M.F.: RDF data-centric storage. In: IEEE International Conference on Web Services, ICWS 2009, pp. 911–918. IEEE (2009)
16.
Zurück zum Zitat Lukyanenko, R., Parsons, J., Samuel, B.M.: Representing instances: the case for reengineering conceptual modelling grammars. Eur. J. Inf. Syst. 28(1), 68–90 (2019)CrossRef Lukyanenko, R., Parsons, J., Samuel, B.M.: Representing instances: the case for reengineering conceptual modelling grammars. Eur. J. Inf. Syst. 28(1), 68–90 (2019)CrossRef
18.
Zurück zum Zitat Pham, M., Passing, L., Erling, O., Boncz, P.A.: Deriving an emergent relational schema from RDF data. In: Gangemi, A., Leonardi, S., Panconesi, A. (eds.) Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, 18–22 May 2015, pp. 864–874. ACM (2015). http://doi.acm.org/10.1145/2736277.2741121 Pham, M., Passing, L., Erling, O., Boncz, P.A.: Deriving an emergent relational schema from RDF data. In: Gangemi, A., Leonardi, S., Panconesi, A. (eds.) Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, 18–22 May 2015, pp. 864–874. ACM (2015). http://​doi.​acm.​org/​10.​1145/​2736277.​2741121
19.
Zurück zum Zitat Rolland, C., Prakash, N.: From conceptual modelling to requirements engineering. Ann. Softw. Eng. 10(1–4), 151–176 (2000)CrossRef Rolland, C., Prakash, N.: From conceptual modelling to requirements engineering. Ann. Softw. Eng. 10(1–4), 151–176 (2000)CrossRef
20.
Zurück zum Zitat Töpper, G., Knuth, M., Sack, H.: Dbpedia ontology enrichment for inconsistency detection. In: Proceedings of the 8th International Conference on Semantic Systems, pp. 33–40. ACM (2012) Töpper, G., Knuth, M., Sack, H.: Dbpedia ontology enrichment for inconsistency detection. In: Proceedings of the 8th International Conference on Semantic Systems, pp. 33–40. ACM (2012)
23.
Zurück zum Zitat Zaveri, A., et al.: Quality assessment methodologies for linked open data. Semant. Web J. (2013, submitted) Zaveri, A., et al.: Quality assessment methodologies for linked open data. Semant. Web J. (2013, submitted)
Metadaten
Titel
Revealing the Conceptual Schemas of RDF Datasets
verfasst von
Subhi Issa
Pierre-Henri Paris
Fayçal Hamdi
Samira Si-Said Cherfi
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-21290-2_20

Premium Partner