Sciweavers

Share
88 search results - page 1 / 18
» On Approximating Minimum Infrequent and Maximum Frequent Set...
Sort
View
DIS
2007
Springer
12 years 3 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley
IDA
2007
Springer
11 years 9 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
12 years 11 months ago
Discriminative Frequent Pattern Analysis for Effective Classification
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
11 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
books