29 search results - page 5 / 6 » Faster Algorithms for Constructing a Concept (Galois) Lattic... |
DSVIS
2005
Springer
15 years 3 months ago
2005
Springer
The design and construction of navigation menus for websites have traditionally been performed manually according to the intuition of a web developer. This paper introduces a new a...
ICDT
2010
ACM
14 years 8 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
FSS
2010
14 years 8 months ago
2010
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
104
click to vote
KDD
2007
ACM
15 years 3 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...