Sciweavers

425 search results - page 76 / 85
» Mining high-speed data streams
Sort
View
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 2 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 5 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 2 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
BMCBI
2002
134views more  BMCBI 2002»
15 years 1 months ago
CoreGenes: A computational tool for identifying and cataloging "core" genes in a set of small genomes
Background: Improvements in DNA sequencing technology and methodology have led to the rapid expansion of databases comprising DNA sequence, gene and genome data. Lower operational...
Nikhat Zafar, Raja Mazumder, Donald Seto
143
Voted
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 1 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting