Sciweavers

2010 search results - page 249 / 402
» Feature Subset Selection Using a Genetic Algorithm
Sort
View
JDCTA
2010
159views more  JDCTA 2010»
14 years 10 months ago
QSPR Study Of Mineral Crystal Lattice Energy Based On Gene Expression Programming
In this study, gene expression programming (GEP), a novel genetic algorithm, is used to develop quantitative model as potential screening mechanism for mineral crystal lattice ene...
Yuntao Zhang, Wenbin Dai, Zhengjun Cheng
IJCAI
2003
15 years 4 months ago
Active Learning with Strong and Weak Views: A Case Study on Wrapper Induction
Multi-view learners reduce the need for labeled data by exploiting disjoint sub-sets of features (views), each of which is sufficient for learning. Such algorithms assume that eac...
Ion Muslea, Steven Minton, Craig A. Knoblock
DLOG
2001
15 years 4 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 3 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
BMCBI
2006
202views more  BMCBI 2006»
15 years 3 months ago
Integrated biclustering of heterogeneous genome-wide datasets for the inference of global regulatory networks
Background: The learning of global genetic regulatory networks from expression data is a severely under-constrained problem that is aided by reducing the dimensionality of the sea...
David J. Reiss, Nitin S. Baliga, Richard Bonneau