44 search results - page 3 / 9 » A probability analysis for candidate-based frequent itemset ... |
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
PAKDD
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
CINQ
2004
Springer
13 years 10 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
CIVR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a method for mining frequently occurring objects and scenes from videos. Object candidates are detected by finding recurring spatial arrangements of affine cov...
FIMI
2003
13 years 6 months ago
2003
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...