Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the learnability of disjunctive normal form formulas

From MaRDI portal
Publication:1900981
Jump to:navigation, search

zbMath0831.68094MaRDI QIDQ1900981

Leonard Pitt, Howard Aizenstein

Publication date: 29 October 1995

Published in: Machine Learning (Search for Journal in Brave)


zbMATH Keywords

disjunctive normal formgreedy heuristiclearnability


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items (6)

Learning random monotone DNF ⋮ SAT-based invariant inference and its relation to concept learning ⋮ Grafting for combinatorial binary model using frequent itemset mining ⋮ Proper learning of \(k\)-term DNF formulas from satisfying assignments ⋮ A new abstract combinatorial dimension for exact learning via queries ⋮ Version spaces and the consistency problem




This page was built for publication: On the learnability of disjunctive normal form formulas

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1900981&oldid=14310615"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki