Sciweavers

7868 search results - page 144 / 1574
» Learning by Answer Sets
Sort
View
IJCAI
2007
15 years 6 months ago
On Mining Closed Sets in Multi-Relational Data
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
Gemma C. Garriga, Roni Khardon, Luc De Raedt
COCOON
2007
Springer
15 years 10 months ago
Dimension, Halfspaces, and the Density of Hard Sets
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
Ryan C. Harkins, John M. Hitchcock
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 10 months ago
Modeling XCS in class imbalances: population size and parameter settings
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
Albert Orriols-Puig, David E. Goldberg, Kumara Sas...
PODS
2006
ACM
177views Database» more  PODS 2006»
16 years 4 months ago
Equivalence of queries combining set and bag-set semantics
The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag-set semantics. However, SQL queries often combine set and bag-set semantic...
Sara Cohen
ICTAI
2006
IEEE
15 years 10 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...