265 search results - page 28 / 53 » Approximation algorithms for clustering uncertain data |
NIPS
2008
14 years 11 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
HICSS
2008
IEEE
15 years 4 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
ANNPR
2008
Springer
14 years 11 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...