Sciweavers

1313 search results - page 198 / 263
» Data Discretization Unification
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
ICML
2009
IEEE
16 years 29 days ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
CPAIOR
2009
Springer
16 years 22 days ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
GECCO
2007
Springer
214views Optimization» more  GECCO 2007»
16 years 10 days ago
Portfolio allocation using XCS experts in technical analysis, market conditions and options market
Schulenburg [15] first proposed the idea to model different trader types by supplying different input information sets to a group of homogenous LCS agent. Gershoff [12] investigat...
Sor Ying (Byron) Wong, Sonia Schulenburg
COMPGEOM
2006
ACM
16 years 4 days ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir