Sciweavers

22 search results - page 2 / 5
» Mining Implications from Lattices of Closed Trees
Sort
View
LICS
1997
IEEE
13 years 9 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
ICCS
2004
Springer
13 years 10 months ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
ICFCA
2009
Springer
14 years 6 days ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 7 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
JAISE
2010
182views Algorithms» more  JAISE 2010»
13 years 7 days ago
Exploring semantics in activity recognition using context lattices
Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor ...
Juan Ye, Simon Dobson