Sciweavers

927 search results - page 75 / 186
» Algorithms for Finding Gene Clusters
Sort
View
121
Voted
ICPR
2008
IEEE
16 years 4 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang
154
Voted
TCBB
2008
107views more  TCBB 2008»
15 years 3 months ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon
94
Voted
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 3 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
132
Voted
BMCBI
2006
144views more  BMCBI 2006»
15 years 3 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...
196
Voted
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 3 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...