197 search results - page 3 / 40 » Improved Approximation Algorithms for Bipartite Correlation ... |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
GECCO
2005
Springer
13 years 11 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...
IWANN
2005
Springer
13 years 11 months ago
2005
Springer
CIARP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
WIRN
2005
Springer
13 years 11 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...