302 search results - page 22 / 61 » Efficient frequent pattern mining over data streams |
108
click to vote
TKDE
2011
14 years 4 months ago
2011
—Classification has been used for modeling many kinds of data sets, including sets of items, text documents, graphs, and networks. However, there is a lack of study on a new kind...
104
click to vote
DAWAK
2010
Springer
14 years 10 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ISMIS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Novelty detection in data stream mining denotes the identification of new or unknown situations in a stream of data elements flowing continuously in at rapid rate. This...
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
108
click to vote
ICDM
2002
IEEE
15 years 2 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...