Sciweavers

4255 search results - page 109 / 851
» On Learning Boolean Functions
Sort
View
TCS
2008
14 years 9 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
IJCAI
2001
14 years 11 months ago
Neural Logic Network Learning using Genetic Programming
Neural Logic Network or Neulonet is a hybrid of neural network expert systems. Its strength lies in its ability to learn and to represent human logic in decision making using comp...
Chew Lim Tan, Henry Wai Kit Chia
IJCSA
2007
104views more  IJCSA 2007»
14 years 9 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
DNA
2005
Springer
118views Bioinformatics» more  DNA 2005»
15 years 3 months ago
Molecular Learning of wDNF Formulae
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
Byoung-Tak Zhang, Ha-Young Jang
AAAI
2007
15 years 7 days ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic