Sciweavers

603 search results - page 70 / 121
» Advances in constrained clustering
Sort
View
NN
2002
Springer
226views Neural Networks» more  NN 2002»
13 years 9 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
ICASSP
2011
IEEE
13 years 1 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
COMPGEOM
2006
ACM
14 years 3 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
BMCBI
2007
133views more  BMCBI 2007»
13 years 10 months ago
Semi-supervised learning for the identification of syn-expressed genes from fused microarray and in situ image data
Background: Gene expression measurements during the development of the fly Drosophila melanogaster are routinely used to find functional modules of temporally co-expressed genes. ...
Ivan G. Costa, Roland Krause, Lennart Opitz, Alexa...
NOSSDAV
2010
Springer
13 years 8 months ago
Designing a tit-for-tat based peer-to-peer video-on-demand system
Video-on-demand (VoD) is a next-generation Internet application of increasing interest allowing users to start watching a movie almost instantaneously by downloading the video on-...
Kévin Huguenin, Anne-Marie Kermarrec, Vivek...