Sciweavers

63 search results - page 5 / 13
» Finding frequent items in data streams
Sort
View
DASFAA
2005
IEEE
133views Database» more  DASFAA 2005»
14 years 1 months ago
Mining Frequent Tree-Like Patterns in Large Datasets
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...
Tzung-Shi Chen, Shih-Chun Hsu
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 17 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
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...
Masakazu Seno, George Karypis
ACSW
2004
13 years 9 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
DAWAK
2008
Springer
13 years 9 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh