Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
The VLDB Journal
Erschienen in: The VLDB Journal 6/2015

01.12.2015 | Regular Paper

Fast rule mining in ontological knowledge bases with AMIE\(+\)

verfasst von: Luis Galárraga, Christina Teflioudi, Katja Hose, Fabian M. Suchanek

Erschienen in: The VLDB Journal | Ausgabe 6/2015

Einloggen

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

search-config
loading …

Abstract

Recent advances in information extraction have led to huge knowledge bases (KBs), which capture knowledge in a machine-readable format. Inductive logic programming (ILP) can be used to mine logical rules from these KBs, such as “If two persons are married, then they (usually) live in the same city.” While ILP is a mature field, mining logical rules from KBs is difficult, because KBs make an open-world assumption. This means that absent information cannot be taken as counterexamples. Our approach AMIE (Galárraga et al. in WWW, 2013) has shown how rules can be mined effectively from KBs even in the absence of counterexamples. In this paper, we show how this approach can be optimized to mine even larger KBs with more than 12M statements. Extensive experiments show how our new approach, AMIE\(+\), extends to areas of mining that were previously beyond reach.
Nächster Artikel Data generation for testing and grading SQL queries

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Fußnoten
2
RDF schema has only positive rules and no disjointness constraints or similar concepts.
 
4
In these cases, the pruning precision in Table 6 was computed by comparing the output of AMIE\(+\) to the output of AMIE on the mined subset.
 
5
We used the YAGO3 [28] types because the type signatures in older versions of YAGO were too general. For example, the relation livesIn is defined from person to location in YAGO2s, whereas in YAGO3 it is defined from person to city.
 
Literatur
1.
Abedjan Z., Naumann F.: Synonym analysis for predicate expansion. In: ESWC (2013)
2.
Abedjan, Z., Lorey, J., Naumann, F.: Reconciling ontologies and the web of data. In: CIKM (2012)
3.
Adé, H., Raedt, L., Bruynooghe, M.: Declarative bias for specific-to-general ilp systems. Mach. Learn. 20, 119–154 (1995)
4.
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD (1993)
5.
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining (1996)
6.
Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: DBpedia: a nucleus for a Web of open data. In: ISWC (2007)
7.
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Jr., E.R.H., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: AAAI (2010)
8.
Chasseur, C., Patel, J.M.: Design and evaluation of storage organizations for read-optimized main memory databases. Proc. VLDB Endow. 6(13), 1474–1485 (2013)CrossRef
9.
Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining: an overview. Fundam. Inf. 66(1–2), 26–37 (2004)MathSciNet
10.
Cimiano, P., Hotho, A., Staab, S.: Comparing conceptual, divisive and agglomerative clustering for learning taxonomies from text. In: ECAI (2004)
11.
d’Amato, C., Bryl, V., Serafini, L.: Data-driven logical reasoning. In: URSW (2012)
12.
d’Amato, C., Fanizzi, N., Esposito, F.: Inductive learning for the semantic web: what does it buy? Semant. Web 1(1,2), 53–59 (2010)
13.
David, J., Guillet, F., Briand, H.: Association rule ontology matching approach. Int. J. Semant. Web Inf. Syst. 3(2), 27–49 (2007)CrossRef
14.
Dehaspe, L., Toironen, H.: Discovery of relational association rules. In: Relational Data Mining. Springer, New York (2000)
15.
Dehaspe, L., Toivonen, H.: Discovery of frequent DATALOG patterns. Data Min. Knowl. Discov. 3(1), 7–36 (1999)CrossRef
16.
Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., Zhang, W.: Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: KDD (2014)
17.
Galárraga, L.A., Teflioudi, C., Hose, K., Suchanek, F.M.: AMIE: association rule mining under incomplete evidence in ontological knowledge bases. In: WWW (2013)
18.
Goethals, B., Van den Bussche, J.: Relational association rules: getting WARMER. In: Pattern Detection and Discovery, vol. 2447. Springer, Berlin (2002)
19.
Grice, P.: Logic and conversation. J. Syntax Semant. 3, 41–58 (1975)
20.
Grimnes, G.A., Edwards, P., Preece, A.D.: Learning meta-descriptions of the FOAF network. In: ISWC (2004)
21.
Hellmann, S., Lehmann, J., Auer, S.: Learning of OWL class descriptions on very large knowledge bases. Int. J. Semant. Web Inf. Syst. 5(2), 25–48 (2009)CrossRef
22.
Huang, Y., Tresp, V., Bundschus, M., Rettinger, A., Kriegel, H.P.: Multivariate prediction for learning on the semantic web. In: ILP (2011)
23.
Jozefowska, J., Lawrynowicz, A., Lukaszewski, T.: The role of semantics in mining frequent patterns from knowledge bases in description logics with rules. Theory Pract. Log. Program. 10(3), 251–289 (2010)MATHMathSciNetCrossRef
24.
Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM. IEEE Computer Society (2001)
25.
Lehmann, J.: DL-learner: learning concepts In Description logics. J. Mach. Learn. Res. (JMLR) 10, 2639–2642 (2009)MATH
26.
Lisi, F.A.: Building rules on top of ontologies for the semantic web with inductive logic programming. TPLP 8(3), 271–300 (2008)MATHMathSciNet
27.
Maedche, A., Zacharias, V.: Clustering ontology-based metadata in the semantic web. In: PKDD (2002)
28.
Mahdisoltani, F., Biega, J., Suchanek, F.M.: Yago3: a knowledge base from multilingual wikipedias. In: CIDR (2015)
29.
Mamer, T., Bryant, C., McCall, J.: L-modified ilp evaluation functions for positive-only biological grammar learning. In: Zelezny, F., Lavrac, N. (eds.) Inductive logic programming, No. 5194 in LNAI. Springer, Berlin (2008)
30.
McGuinness, D.L., Fikes, R., Rice, J., Wilder, S.: An environment for merging and testing large ontologies. In: KR (2000)
31.
Muggleton, S.: Inverse entailment and progol. New Gener. Comput. 13(3&4), 245–286 (1995)CrossRef
32.
Muggleton, S.: Learning from positive data. In: ILP (1997)
33.
Nakashole, N., Sozio, M., Suchanek, F., Theobald, M.: Query-time reasoning in uncertain rdf knowledge bases with soft and hard rules. In: Workshop on Very Large Data Search (VLDS) at VLDB (2012)
34.
Nebot, V., Berlanga, R.: Finding association rules in semantic web data. Knowl Based Syst. 25(1), 51–62 (2012)CrossRef
35.
Nickel, M., Tresp, V., Kriegel, H.P.: Factorizing yago: scalable machine learning for linked data. In: WWW (2012)
36.
Noy, N.F., Musen, M.A.: PROMPT: algorithm and tool for automated ontology merging and alignment. In: AAAI/IAAI. AAAI Press (2000)
37.
Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1–2), 107–136 (2006)CrossRef
38.
Schoenmackers, S., Etzioni, O., Weld, D.S., Davis, J.: Learning first-order Horn clauses from web text. In: EMNLP (2010)
39.
Suchanek, F.M., Abiteboul, S., Senellart, P.: PARIS: probabilistic alignment of relations, instances, and schema. PVLDB 5(3), 157–168 (2011)
40.
Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW (2007)
41.
Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: KDD (2002)
42.
43.
Völker, J., Niepert, M.: Statistical schema induction. In: ESWC (2011)
44.
45.
Zeng, Q., Patel, J., Page, D.: QuickFOIL: scalable inductive logic programming. In: VLDB (2014)
Metadaten
Titel
Fast rule mining in ontological knowledge bases with AMIE
verfasst von
Luis Galárraga
Christina Teflioudi
Katja Hose
Fabian M. Suchanek
Publikationsdatum
01.12.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
The VLDB Journal / Ausgabe 6/2015
Print ISSN: 1066-8888
Elektronische ISSN: 0949-877X
DOI
https://doi.org/10.1007/s00778-015-0394-1

Weitere Artikel der Ausgabe 6/2015

The VLDB Journal 6/2015 Zur Ausgabe

Regular Paper

Data generation for testing and grading SQL queries

Regular Paper

S-TM: scalable streaming short text matching

Regular Paper

Querying streams using regular expressions: some semantics, decidability, and efficiency issues

Regular Paper

Geo-Social Ranking: functions and query processing

Regular Paper

AP-Tree: efficiently support location-aware Publish/Subscribe

Regular Paper

The matrix mechanism: optimizing linear counting queries under differential privacy

Premium Partner

    Bildnachweise