Sciweavers

492 search results - page 2 / 99
» Fast data stream algorithms using associative memories
Sort
View
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
13 years 11 months ago
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun ...
CGI
2009
IEEE
13 years 8 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 9 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
13 years 11 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
PAKDD
2004
ACM
137views Data Mining» more  PAKDD 2004»
13 years 10 months ago
Fast and Light Boosting for Adaptive Mining of Data Streams
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
Fang Chu, Carlo Zaniolo