Sciweavers

144 search results - page 21 / 29
» Mining Comprehensible Clustering Rules with an Evolutionary ...
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
BMCBI
2008
104views more  BMCBI 2008»
13 years 7 months ago
Evolutionary Pareto-optimization of stably folding peptides
Background: As a rule, peptides are more flexible and unstructured than proteins with their substantial stabilizing hydrophobic cores. Nevertheless, a few stably folding peptides ...
Wolfram Gronwald, Tim Hohm, Daniel Hoffmann
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
CLUSTER
2005
IEEE
14 years 1 months ago
A pipelined data-parallel algorithm for ILP
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
Nuno A. Fonseca, Fernando M. A. Silva, Víto...