259 search results - page 48 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
111
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
AVI
2004
14 years 11 months ago
2004
Visualization interfaces that offer multiple coordinated views on a particular set of data items are useful for navigating and exploring complex information spaces. In this paper ...
91
Voted
JMLR
2010
14 years 4 months ago
2010
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
130
click to vote
SBBD
2008
14 years 11 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...