Sciweavers

255 search results - page 21 / 51
» Data Clustering with a Relational Push-Pull Model
Sort
View
NIPS
2003
14 years 11 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
CANDC
2004
ACM
14 years 9 months ago
The difficult interpretation of transcriptome data: the case of the GATC regulatory network
Genomic analyses on part of Escherichia coli's chromosome had suggested the existence of a GATC regulated network. This has recently been confirmed through a transcriptome an...
Alessandra Riva, Marie-Odile Delorme, Tony Chevali...
BMCBI
2011
14 years 1 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
15 years 11 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu