757 search results - page 39 / 152 » Associative Clustering |
NIPS
2001
14 years 11 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—A novel microarray value imputation method, HICCUP1 , is presented. HICCUP improves upon existing value imputation methods in the several ways. (1) By judiciously integr...
ICCS
2003
Springer
15 years 3 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
JCP
2008
14 years 9 months ago
2008
Taking the design of data analyzing software for imaging brain function -- SPM (Statistical Parameters Mapping) for reference, this study combined MATLAB, GIS and SDM organically, ...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...