Sciweavers

160 search results - page 13 / 32
» kdd 2008
Sort
View
ISI
2008
Springer
13 years 8 months ago
Anomaly detection in high-dimensional network data streams: A case study
In this paper, we study the problem of anomaly detection in high-dimensional network streams. We have developed a new technique, called Stream Projected Ouliter deTector (SPOT), t...
Ji Zhang, Qigang Gao, Hai H. Wang
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 10 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 9 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
KDD
2008
ACM
155views Data Mining» more  KDD 2008»
14 years 10 months ago
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are ana...
Yehuda Koren
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 10 months ago
iSAX: indexing and mining terabyte sized time series
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
Jin Shieh, Eamonn J. Keogh