Horn axiomatizations for sequential data

DOI10.1016/j.tcs.2006.11.009zbMath1108.68098OpenAlexW2107587857MaRDI QIDQ870272

N. E. Zubov

Publication date: 12 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.009

zbMATH Keywords

sequential patternsclosure operatorsassociation rulespropositional Horn theories

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Related Items (2)

Mining closed patterns in relational, graph and network data ⋮ Resolution based algorithms for the transversal hypergraph generation problem

Uses Software

• SPADE
• PrefixSpan
• CloSpan
• BIDE

Cites Work

• Model theory.
• Functional dependencies in relational databases: A lattice point of view
• Horn approximations of empirical data
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Database Theory - ICDT 2005
• Discovery Science
• SPADE: An efficient algorithm for mining frequent sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Horn axiomatizations for sequential data