3823 search results - page 2 / 765 » Experiments with Random Projection |
INCDM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
125
click to vote
RECOMB
2001
Springer
15 years 9 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
108
click to vote
ACMSE
2009
ACM
15 years 4 months ago
2009
ACM
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...