Synthesizing N-ary Relations from Web Tables

被引:6
|
作者
Lehmberg, Oliver [1 ]
Bizer, Christian [1 ]
机构
[1] Univ Mannheim, Data & Web Sci Grp, Mannheim, Germany
关键词
Web Tables; Schema Matching; Schema Extension; FUNCTIONAL-DEPENDENCIES; LARGE-SCALE; EXTRACTION; DISCOVERY;
D O I
10.1145/3326467.3326480
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Web contains a large number of relational HTML tables, which cover a multitude of different, often very specific topics. This rich pool of data has motivated a growing body of research on methods that use web table data to extend local tables with additional attributes or add missing facts to knowledge bases. Nearly all existing approaches for these tasks are limited to the extraction of binary relations from web tables, e.g. an unemployment number may only depend on the state. Inspecting randomly chosen tables on the Web quickly reveals that many relations in the tables are non-binary, e.g. unemployment numbers also depend on the point in time and the profession. Treating such n-ary relations as binary leads to data that cannot be interpreted correctly. The extraction of n-ary relations from web tables is complicated by two factors: 1. important attributes might be stated outside of the table; 2. relational web tables are usually too small for functional dependency discovery. This paper presents a method to synthesize n-ary relations from web tables for the use case of knowledge base extension. The method exploits information from the page around the table and stitches (combines) multiple tables from the same website. We apply the method to a corpus of 5 million web tables originating from 80 thousand different web sites and find that 38% of the synthesized relations are non-binary. We find different relations for the same dependent attribute, e.g. relations providing unemployment numbers based on time, location, or profession. By identifying groups of websites which provide these relations, we lay the foundation for applications in knowledge base augmentation and data search, which allow for a specific selection of relations that determine an attribute according to the applications' data requirements.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Condensed Representations of Association Rules in n-Ary Relations
    Bazin, Alexandre
    Gros, Nicolas
    Bertaux, Aurelie
    Nicolle, Christophe
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (05) : 4598 - 4607
  • [22] NEW TYPES OF FUZZY n-ARY SUBHYPERGROUPS OF AN n-ARY HYPERGROUP
    Yin, Y.
    Zhan, J.
    Davvaz, B.
    IRANIAN JOURNAL OF FUZZY SYSTEMS, 2012, 9 (05): : 105 - 124
  • [23] Generalized fuzzy n-ary subhypergroups of a commutative n-ary hypergroup
    Yin, Yunqiang
    Zhan, Jianming
    Huang, Xiaokun
    MATHEMATICA SLOVACA, 2012, 62 (02) : 201 - 230
  • [24] Combinatorial aspects of n-ary polygroups and n-ary color schemes
    Anvariyeh, S. M.
    Mirvakili, S.
    Davvaz, B.
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (02) : 207 - 216
  • [25] N-ary hypergroups
    Davvaz, B.
    Vougiouklis, T.
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2006, 30 (A2): : 165 - +
  • [26] N-ary Relations of Association in Class Diagrams: Design Patterns
    Sergievskiy, Maxim
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (02) : 265 - 268
  • [27] Semilattice strongly regular relations on ordered n-ary semihypergroups
    Daengsaen, Jukkrit
    Leeratanavalee, Sorasak
    AIMS MATHEMATICS, 2022, 7 (01): : 478 - 498
  • [28] A generic disjunctive/conjunctive decomposition model for n-ary relations
    Leenen, I
    Van Mechelen, I
    De Boeck, P
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1999, 43 (01) : 102 - 122
  • [29] Closed and noise-tolerant patterns in n-ary relations
    Loïc Cerf
    Jérémy Besson
    Kim-Ngan T. Nguyen
    Jean-François Boulicaut
    Data Mining and Knowledge Discovery, 2013, 26 : 574 - 619
  • [30] Xart: Discovery of correlated arguments of n-ary relations in text
    Berrahou, Soumia Lilia
    Buche, Patrice
    Dibie, Juliette
    Roche, Mathieu
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 73 : 115 - 124