112 search results - page 13 / 23 » Efficient Approximate Mining of Frequent Patterns over Trans... |
200
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
IS
2007
14 years 9 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
99
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...