Sciweavers

927 search results - page 91 / 186
» Algorithms for Finding Gene Clusters
Sort
View
157
Voted
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 5 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
116
Voted
RECOMB
2002
Springer
16 years 3 months ago
Probabilistic hierarchical clustering for biological data
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
Eran Segal, Daphne Koller
121
Voted
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 9 months ago
Identifying valid solutions for the inference of regulatory networks
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. The problem often is multi-modal and therefore appropriate optimi...
Christian Spieth, Felix Streichert, Nora Speer, An...
127
Voted
RECOMB
1997
Springer
15 years 7 months ago
Progressive multiple alignment with constraints
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
Gene Myers, Sanford Selznick, Zheng Zhang 0004, We...
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 28 days ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor