41 search results - page 3 / 9 » Finding frequent items in probabilistic data |
ADC
2003
Springer
13 years 9 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper, we propose a novel data mining scheme to explore the frequent hierarchical structure patterns, named tree-like patterns, with the relationship of each item on a sequ...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
PAKDD
2007
ACM
13 years 10 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...
SAC
2006
ACM
13 years 10 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...