Discovery of the D-basis in binary tables based on hypergraph dualization

详细信息    查看全文

• 作者：K. Adaricheva^a ; ^b ; ^{kira.adaricheva@nu.edu.kz} ; ^{adariche@yu.edu} ; J.B. Nation^c ; ^{jb@math.hawaii.edu}
• 关键词：Binary table ; Galois lattice ; Implicational basis ; Hypergraph dualization ; Association rules
• 刊名：Theoretical Computer Science
• 出版年：2017
• 出版时间：7 January 2017
• 年：2017
• 卷：658
• 期：part_PB
• 页码：307-315
• 全文大小：374 K
• 卷排序：658

文摘

Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. We introduce a novel approach for the discovery of a specific set of implications, called the D-basis, that provides a representation for a reduced binary table, based on the structure of its Galois lattice. At the core of the method are the D-relation defined in a lattice theoretic framework and the hypergraph dualization algorithm that allows us to effectively produce the set of transversals for a given Sperner hypergraph. The latter algorithm, first developed by specialists from Rutgers Center for Operations Research, has already found numerous applications in solving optimization problems in data base theory, artificial intelligence and game theory. One application of the method is for analysis of gene expression data related to a particular phenotypic variable, and some initial testing is done for data provided by the University of Hawaii Cancer Center.