Sciweavers

13306 search results - page 2215 / 2662
» Theoretical Computer Science
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 8 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
16 years 8 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
218
Voted
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 8 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
189
Voted
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
16 years 8 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
« Prev « First page 2215 / 2662 Last » Next »