Sciweavers

359 search results - page 49 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
COLT
2003
Springer
14 years 29 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
DLOG
2006
13 years 9 months ago
On the Scalability of Description Logic Instance Retrieval
Abstract Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the onto...
Ralf Möller, Volker Haarslev, Michael Wessel
GECCO
2006
Springer
138views Optimization» more  GECCO 2006»
13 years 11 months ago
Does overfitting affect performance in estimation of distribution algorithms
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
Hao Wu, Jonathan L. Shapiro
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
14 years 5 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick