7015 search results - page 426 / 1403 » Approximation algorithms for co-clustering |
184
click to vote
DAGSTUHL
2007
2007
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
15 years 8 months ago
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
215
click to vote
CIARP
2010
Springer
15 years 5 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 ...
217
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
209
click to vote
WIRN
2005
Springer
16 years 10 days 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...
131
click to vote
COMPUTING
2006
15 years 6 months ago
2006
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...