Sciweavers

1301 search results - page 44 / 261
» Default Clustering from Sparse Data Sets
Sort
View
BIOCOMP
2006
13 years 10 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
ICMLA
2008
13 years 10 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
BMCBI
2008
142views more  BMCBI 2008»
13 years 8 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
IDA
2005
Springer
14 years 2 months ago
Biological Cluster Validity Indices Based on the Gene Ontology
With the invention of biotechnological high throughput methods like DNA microarrays and the analysis of the resulting huge amounts of biological data, clustering algorithms gain ne...
Nora Speer, Christian Spieth, Andreas Zell
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 10 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon