Sciweavers

279 search results - page 26 / 56
» Methods for finding frequent items in data streams
Sort
View
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 7 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 9 months ago
SPOT: A System for Detecting Projected Outliers From High-dimensional Data Streams
In this paper, we present a new technique, called Stream Projected Ouliter deTector (SPOT), to deal with outlier detection problem in high-dimensional data streams. SPOT is unique ...
Ji Zhang, Qigang Gao, Hai H. Wang
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 9 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
VL
2005
IEEE
135views Visual Languages» more  VL 2005»
14 years 1 months ago
Easing Program Comprehension by Sharing Navigation Data
Large software projects often require a programmer to make changes to unfamiliar source code. This paper describes a set of tools, called Team Tracks, designed to ease program com...
Robert DeLine, Mary Czerwinski, George G. Robertso...