Sciweavers

37 search results - page 5 / 8
» A Fast Algorithm for Approximate Quantiles in High Speed Dat...
Sort
View
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 4 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
TKDE
2010
151views more  TKDE 2010»
13 years 5 months ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
INFOCOM
1995
IEEE
13 years 11 months ago
Analysis of One-Way Reservation Algorithms
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
Israel Cidon, Raphael Rom, Yuval Shavitt
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 7 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,...