Fast relational learning using bottom clause propositionalization with artificial neural networks

Author： França Manoel   Zaverucha Gerson   d’Avila Garcez Artur  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.94, Iss.1, 2014-01, pp. : 81-104

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

Fast learning artificial neural networks for continuous input applications

By Evans D.J.   Tay L.P.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 24, Iss. 3, 1995-03 ,pp. : 11-23

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Complexity of learning in artificial neural networks

By Engel A.  

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 285-306

Elsevier

Access to resources Recommend Favorite

Neural networks for relational learning: an experimental comparison

By Uwents Werner   Monfardini Gabriele   Blockeel Hendrik   Gori Marco   Scarselli Franco  

Machine Learning, Vol. 82, Iss. 3, 2011-03 ,pp. : 315-349

Springer Publishing Company

Access to resources Recommend Favorite

Forecast Combination by Using Artificial Neural Networks

By Aladag Cagdas  

Neural Processing Letters, Vol. 32, Iss. 3, 2010-12 ,pp. : 269-276

Springer Publishing Company

Access to resources Recommend Favorite

Training Artificial Neural Networks Using Taguchi Methods

By Macleod C.   Dror G.   Maxwell G.  

Artificial Intelligence Review, Vol. 13, Iss. 3, 1999-06 ,pp. : 177-184

Springer Publishing Company

Access to resources Recommend Favorite