Skip to main content

2017 | OriginalPaper | Buchkapitel

Acquisition of Terminological Knowledge from Social Networks in Description Logic

verfasst von : Francesco Kriegel

Erschienen in: Formal Concept Analysis of Social Networks

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

The Web Ontology Language (OWL) has gained serious attraction since its foundation in 2004, and it is heavily used in applications requiring representation of as well as reasoning with knowledge. It is the language of the Semantic Web, and it has a strong logical underpinning by means of so-called Description Logics (DLs). DLs are a family of conceptual languages suitable for knowledge representation and reasoning due to their strong logical foundation, and for which the decidability and complexity of common reasoning problems are widely explored. In particular, the reasoning tasks allow for the deduction of implicit knowledge from explicitly stated facts and axioms, and plenty of appropriate algorithms were developed, optimized, and implemented, e.g., tableaux algorithms and completion algorithms. In this document, we present a technique for the acquisition of terminological knowledge from social networks. More specifically, we show how OWL axioms, i.e., concept inclusions and role inclusions in DLs, can be obtained from social graphs in a sound and complete manner. A social graph is simply a directed graph, the vertices of which describe the entities, e.g., persons, events, messages, etc.; and the edges of which describe the relationships between the entities, e.g., friendship between persons, attendance of a person to an event, a person liking a message, etc. Furthermore, the vertices of social graphs are labeled, e.g., to describe properties of the entities, and also the edges are labeled to specify the concrete relationships. As an exemplary social network we consider Facebook, and show that it fits our use case.

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
For a subset XP of a quasi-ordered set (P,  ≤ ), we use the expression Min(X) to denote the set of all those elements in X which are minimal with respect to ≤, i.e., x Min(X) if, and only if, xX and there is no other element yX such that yx and yx.
 
2
Please note that https://static-content.springer.com/image/chp%3A10.1007%2F978-3-319-64167-6_5/MediaObjects/419186_1_En_5_Figdw_HTML.gif .
 
Literatur
1.
Zurück zum Zitat Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Gottlob, G., Walsh, T. (eds.) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 319–324, Acapulco, 9–15 August 2003. Morgan Kaufmann, San Francisco (2003). http://dblp.uni-trier.de/rec/bib/conf/ijcai/Baader03 Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Gottlob, G., Walsh, T. (eds.) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 319–324, Acapulco, 9–15 August 2003. Morgan Kaufmann, San Francisco (2003). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ijcai/​Baader03
2.
Zurück zum Zitat Baader, F., Distel, F.: A finite basis for the set of \(\mathcal{E\!L}\)-implications holding in a finite model. In: Medina, R., Obiedkov, S.A. (eds.) Formal Concept Analysis, Proceedings of the 6th International Conference, ICFCA 2008, Montreal, 25–28 February 2008. Lecture Notes in Computer Science, vol. 4933, pp. 46–61. Springer, Heidelberg (2008). DOI 10.1007/978-3-540-78137-0∖_4. http://dblp.uni-trier.de/rec/bib/conf/icfca/BaaderD08 Baader, F., Distel, F.: A finite basis for the set of \(\mathcal{E\!L}\)-implications holding in a finite model. In: Medina, R., Obiedkov, S.A. (eds.) Formal Concept Analysis, Proceedings of the 6th International Conference, ICFCA 2008, Montreal, 25–28 February 2008. Lecture Notes in Computer Science, vol. 4933, pp. 46–61. Springer, Heidelberg (2008). DOI 10.1007/978-3-540-78137-0∖_4. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​BaaderD08
3.
Zurück zum Zitat Baader, F., Distel, F.: Exploring finite models in the description logic \(\mathcal{E\!L}_{\mathrm{gfp}}\). In: Ferré, S., Rudolph, S. (eds.) Formal Concept Analysis, Proceedings of the 7th International Conference, ICFCA 2009, Darmstadt, 21–24 May 2009. Lecture Notes in Computer Science, vol. 5548, pp. 146–161. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-01815-2∖_12. http://dblp.uni-trier.de/rec/bib/conf/icfca/BaaderD09 Baader, F., Distel, F.: Exploring finite models in the description logic \(\mathcal{E\!L}_{\mathrm{gfp}}\). In: Ferré, S., Rudolph, S. (eds.) Formal Concept Analysis, Proceedings of the 7th International Conference, ICFCA 2009, Darmstadt, 21–24 May 2009. Lecture Notes in Computer Science, vol. 5548, pp. 146–161. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-01815-2∖_12. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​BaaderD09
4.
Zurück zum Zitat Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Dean, T. (ed.) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, pp. 96–103, Stockholm, 31 July–6 August 1999. 2 Volumes, 1450 pages. Morgan Kaufmann, San Francisco (1999). http://dblp.uni-trier.de/rec/bib/conf/ijcai/BaaderKM99 Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Dean, T. (ed.) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, pp. 96–103, Stockholm, 31 July–6 August 1999. 2 Volumes, 1450 pages. Morgan Kaufmann, San Francisco (1999). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ijcai/​BaaderKM99
6.
Zurück zum Zitat Babin, M.A., Kuznetsov, S.O.: Recognizing pseudo-intents is coNP-complete. In: Kryszkiewicz, M., Obiedkov, S.A. (eds.) Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, 19–21 October 2010. CEUR Workshop Proceedings, vol. 672, pp. 294–301. CEUR-WS.org (2010). http://dblp.uni-trier.de/rec/bib/conf/cla/BabinK10 Babin, M.A., Kuznetsov, S.O.: Recognizing pseudo-intents is coNP-complete. In: Kryszkiewicz, M., Obiedkov, S.A. (eds.) Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, 19–21 October 2010. CEUR Workshop Proceedings, vol. 672, pp. 294–301. CEUR-WS.org (2010). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​cla/​BabinK10
10.
Zurück zum Zitat Borchmann, D.: Towards an error-tolerant construction of \(\mathcal{EL}^{\!\perp }\)-ontologies from data using formal concept analysis. In: Cellier, P., Distel, F., Ganter, B. (eds.) Formal Concept Analysis, Proceedings of the 11th International Conference, ICFCA 2013, Dresden, 21–24 May 2013. Lecture Notes in Computer Science, vol. 7880, pp. 60–75. Springer, Heidelberg (2013). DOI 10.1007/978-3-642-38317-5∖_4. http://dblp.uni-trier.de/rec/bib/conf/icfca/Borchmann13 Borchmann, D.: Towards an error-tolerant construction of \(\mathcal{EL}^{\!\perp }\)-ontologies from data using formal concept analysis. In: Cellier, P., Distel, F., Ganter, B. (eds.) Formal Concept Analysis, Proceedings of the 11th International Conference, ICFCA 2013, Dresden, 21–24 May 2013. Lecture Notes in Computer Science, vol. 7880, pp. 60–75. Springer, Heidelberg (2013). DOI 10.1007/978-3-642-38317-5∖_4. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​Borchmann13
15.
Zurück zum Zitat Distel, F.: Hardness of enumerating pseudo-intents in the lectic order. In: Kwuida, L., Sertkaya, B. (eds.) Formal Concept Analysis, Proceedings of the 8th International Conference, ICFCA 2010, Agadir, 15–18 March 2010. Lecture Notes in Computer Science, vol. 5986, pp. 124–137. Springer, Heidelberg (2010). DOI 10.1007/978-3-642-11928-6∖_9. http://dblp.uni-trier.de/rec/bib/conf/icfca/Distel10 CrossRef Distel, F.: Hardness of enumerating pseudo-intents in the lectic order. In: Kwuida, L., Sertkaya, B. (eds.) Formal Concept Analysis, Proceedings of the 8th International Conference, ICFCA 2010, Agadir, 15–18 March 2010. Lecture Notes in Computer Science, vol. 5986, pp. 124–137. Springer, Heidelberg (2010). DOI 10.1007/978-3-642-11928-6∖_9. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​Distel10 CrossRef
18.
Zurück zum Zitat Donini, F.M., Colucci, S., Noia, T.D., Sciascio, E.D.: A tableaux-based method for computing least common subsumers for expressive description logics. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 739–745, Pasadena, CA, 11–17 July 2009 (2009). http://dblp.uni-trier.de/rec/bib/conf/ijcai/DoniniCNS09 Donini, F.M., Colucci, S., Noia, T.D., Sciascio, E.D.: A tableaux-based method for computing least common subsumers for expressive description logics. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 739–745, Pasadena, CA, 11–17 July 2009 (2009). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ijcai/​DoniniCNS09
21.
Zurück zum Zitat Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint 831, Technische Hochschule Darmstadt, Darmstadt (1984) Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint 831, Technische Hochschule Darmstadt, Darmstadt (1984)
23.
Zurück zum Zitat Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) Formal Concept Analysis, Proceedings of the 8th International Conference, ICFCA 2010, Agadir, 15–18 March 2010. Lecture Notes in Computer Science, vol. 5986, pp. 312–340. Springer, Heidelberg (2010). DOI 10.1007/978-3-642-11928-6∖_22. http://dblp2.uni-trier.de/rec/bib/conf/icfca/Ganter10 CrossRef Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) Formal Concept Analysis, Proceedings of the 8th International Conference, ICFCA 2010, Agadir, 15–18 March 2010. Lecture Notes in Computer Science, vol. 5986, pp. 312–340. Springer, Heidelberg (2010). DOI 10.1007/978-3-642-11928-6∖_22. http://​dblp2.​uni-trier.​de/​rec/​bib/​conf/​icfca/​Ganter10 CrossRef
25.
Zurück zum Zitat Guigues, J.L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 95, 5–18 (1986) Guigues, J.L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 95, 5–18 (1986)
29.
Zurück zum Zitat Kriegel, F.: Axiomatization of general concept inclusions from streams of interpretations with optional error tolerance. In: Kuznetsov, S.O., Napoli, A., Rudolph, S. (eds.) Proceedings of the 5th International Workshop “What can FCA do for Artificial Intelligence”? Co-located with the European Conference on Artificial Intelligence, FCA4AI@ECAI 2016, The Hague, 30 August 2016. CEUR Workshop Proceedings, vol. 1703, pp. 9–16. CEUR-WS.org (2016). http://dblp.uni-trier.de/rec/bib/conf/ecai/Kriegel16 Kriegel, F.: Axiomatization of general concept inclusions from streams of interpretations with optional error tolerance. In: Kuznetsov, S.O., Napoli, A., Rudolph, S. (eds.) Proceedings of the 5th International Workshop “What can FCA do for Artificial Intelligence”? Co-located with the European Conference on Artificial Intelligence, FCA4AI@ECAI 2016, The Hague, 30 August 2016. CEUR Workshop Proceedings, vol. 1703, pp. 9–16. CEUR-WS.org (2016). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ecai/​Kriegel16
30.
31.
Zurück zum Zitat Kriegel, F.: Parallel attribute exploration. In: Haemmerlé, O., Stapleton, G., Faron-Zucker, C. (eds.) Graph-Based Representation and Reasoning - Proceedings of the 22nd International Conference on Conceptual Structures, ICCS 2016, Annecy, 5–7 July 2016. Lecture Notes in Computer Science, vol. 9717, pp. 91–106. Springer, Heidelberg (2016). DOI 10.1007/978-3-319-40985-6∖_8. http://dblp2.uni-trier.de/rec/bib/conf/iccs/Kriegel16 CrossRef Kriegel, F.: Parallel attribute exploration. In: Haemmerlé, O., Stapleton, G., Faron-Zucker, C. (eds.) Graph-Based Representation and Reasoning - Proceedings of the 22nd International Conference on Conceptual Structures, ICCS 2016, Annecy, 5–7 July 2016. Lecture Notes in Computer Science, vol. 9717, pp. 91–106. Springer, Heidelberg (2016). DOI 10.1007/978-3-319-40985-6∖_8. http://​dblp2.​uni-trier.​de/​rec/​bib/​conf/​iccs/​Kriegel16 CrossRef
32.
Zurück zum Zitat Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base. In: Ben Yahia, S., Konecny, J. (eds.) Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, 13–16 October 2015. CEUR Workshop Proceedings, vol. 1466, pp. 181–192. CEUR-WS.org (2015). http://dblp.uni-trier.de/rec/bib/conf/cla/KriegelB15 Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base. In: Ben Yahia, S., Konecny, J. (eds.) Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, 13–16 October 2015. CEUR Workshop Proceedings, vol. 1466, pp. 181–192. CEUR-WS.org (2015). http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​cla/​KriegelB15
36.
Zurück zum Zitat Kuznetsov, S.O., Obiedkov, S.A.: Counting pseudo-intents and #p-completeness. In: Missaoui, R., Schmid, J. (eds.) Formal Concept Analysis, Proceedings of the 4th International Conference, ICFCA 2006, Dresden, 13–17 February 2006. Lecture Notes in Computer Science, vol. 3874, pp. 306–308. Springer, Heidelberg (2006). DOI 10.1007/11671404∖_21. http://dblp.uni-trier.de/rec/bib/conf/icfca/KuznetsovO06 CrossRef Kuznetsov, S.O., Obiedkov, S.A.: Counting pseudo-intents and #p-completeness. In: Missaoui, R., Schmid, J. (eds.) Formal Concept Analysis, Proceedings of the 4th International Conference, ICFCA 2006, Dresden, 13–17 February 2006. Lecture Notes in Computer Science, vol. 3874, pp. 306–308. Springer, Heidelberg (2006). DOI 10.1007/11671404∖_21. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​KuznetsovO06 CrossRef
40.
Zurück zum Zitat Mantay, T.: Computing least common subsumers in expressive description logics. In: Foo, N.Y. (ed.) Advanced Topics in Artificial Intelligence, Proceedings of the 12th Australian Joint Conference on Artificial Intelligence, AI ’99, Sydney, 6–10 December 1999. Lecture Notes in Computer Science, vol. 1747, pp. 218–230. Springer, Heidelberg (1999). DOI 10.1007/3-540-46695-9∖_19. http://dblp.uni-trier.de/rec/bib/conf/ausai/Mantay99 CrossRef Mantay, T.: Computing least common subsumers in expressive description logics. In: Foo, N.Y. (ed.) Advanced Topics in Artificial Intelligence, Proceedings of the 12th Australian Joint Conference on Artificial Intelligence, AI ’99, Sydney, 6–10 December 1999. Lecture Notes in Computer Science, vol. 1747, pp. 218–230. Springer, Heidelberg (1999). DOI 10.1007/3-540-46695-9∖_19. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ausai/​Mantay99 CrossRef
41.
Zurück zum Zitat Mantay, T.: A least common subsumer operation for an expressive description logic. In: Loganantharaj, R., Palm, G. (eds.) Intelligent Problem Solving, Methodologies and Approaches, Proceedings of the 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2000, New Orleans, LA, 19–22 June 2000. Lecture Notes in Computer Science, vol. 1821, pp. 474–481. Springer, Heidelberg (2000). DOI 10.1007/3-540-45049-1∖_57. http://dblp.uni-trier.de/rec/bib/conf/ieaaie/Mantay00 Mantay, T.: A least common subsumer operation for an expressive description logic. In: Loganantharaj, R., Palm, G. (eds.) Intelligent Problem Solving, Methodologies and Approaches, Proceedings of the 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2000, New Orleans, LA, 19–22 June 2000. Lecture Notes in Computer Science, vol. 1821, pp. 474–481. Springer, Heidelberg (2000). DOI 10.1007/3-540-45049-1∖_57. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​ieaaie/​Mantay00
43.
Zurück zum Zitat Sertkaya, B.: Some computational problems related to pseudo-intents. In: Ferré, S., Rudolph, S. (eds.) Formal Concept Analysis, Proceedings of the 7th International Conference, ICFCA 2009, Darmstadt, 21–24 May 2009. Lecture Notes in Computer Science, vol. 5548, pp. 130–145. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-01815-2∖_11. http://dblp.uni-trier.de/rec/bib/conf/icfca/Sertkaya09 CrossRef Sertkaya, B.: Some computational problems related to pseudo-intents. In: Ferré, S., Rudolph, S. (eds.) Formal Concept Analysis, Proceedings of the 7th International Conference, ICFCA 2009, Darmstadt, 21–24 May 2009. Lecture Notes in Computer Science, vol. 5548, pp. 130–145. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-01815-2∖_11. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​icfca/​Sertkaya09 CrossRef
44.
Zurück zum Zitat Sertkaya, B.: Towards the complexity of recognizing pseudo-intents. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) Conceptual Structures: Leveraging Semantic Technologies, Proceedings of the 17th International Conference on Conceptual Structures, ICCS 2009, Moscow, 26–31 July 2009. Lecture Notes in Computer Science, vol. 5662, pp. 284–292. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-03079-6∖_22. http://dblp.uni-trier.de/rec/bib/conf/iccs/Sertkaya09 CrossRef Sertkaya, B.: Towards the complexity of recognizing pseudo-intents. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) Conceptual Structures: Leveraging Semantic Technologies, Proceedings of the 17th International Conference on Conceptual Structures, ICCS 2009, Moscow, 26–31 July 2009. Lecture Notes in Computer Science, vol. 5662, pp. 284–292. Springer, Heidelberg (2009). DOI 10.1007/978-3-642-03079-6∖_22. http://​dblp.​uni-trier.​de/​rec/​bib/​conf/​iccs/​Sertkaya09 CrossRef
Metadaten
Titel
Acquisition of Terminological Knowledge from Social Networks in Description Logic
verfasst von
Francesco Kriegel
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-64167-6_5