Finding a short and accurate decision rule in disjunctive normal form by exhaustive search

ISSN： 0885-6125

Source： Machine Learning, Vol.80, Iss.1, 2010-07, pp. : 33-62

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Learnability of Disjunctive Normal Form Formulas

By Aizenstein H.

Machine Learning, Vol. 19, Iss. 3, 1995-06 ,pp. : 183-208

Springer Publishing Company

Access to resources Recommend Favorite

Finding a form to hold the act of queuing

By Hardemo Isabel

Personal and Ubiquitous Computing, Vol. 8, Iss. 3-4, 2004-07 ,pp. : 247-254

Springer Publishing Company

Access to resources Recommend Favorite

Finding optimal subgraphs by local search

By Shimozono S.

Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. : 265-271

Elsevier

Access to resources Recommend Favorite

Construction of the tests of combinational circuit failures by analyzing the orthogonal disjunctive normal forms represented by the alternative graphs

By Matrosova A. Pleshkov A. Ubar R.

Automation and Remote Control, Vol. 66, Iss. 2, 2005-02 ,pp. : 313-327

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Search of Web Service based on Weighted Association Rule

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 7, Iss. 3, 2015-07 ,pp. : 46-57

IGI Global_journal

Access to resources Recommend Favorite