88 search results - page 1 / 18 » On Approximating Minimum Infrequent and Maximum Frequent Set... |
DIS
2007
Springer
13 years 10 months ago
2007
Springer
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...
IDA
2007
Springer
13 years 4 months ago
2007
Springer
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...
AAIM
2007
Springer
13 years 10 months ago
2007
Springer
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
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...
WDAG
2010
Springer
13 years 2 months ago
2010
Springer
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...