Lookahead and discretization in ILP | Zendy

Hendrik Blockeel | Zendy; Luc De Raedt | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Lookahead and discretization in ILP

Author(s) -

Hendrik Blockeel,

Luc De Raedt

Publication year - 1997

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-63514-9

DOI - 10.1007/3540635149_36

Subject(s) - discretization , computer science , simple (philosophy) , mathematical optimization , quality (philosophy) , theoretical computer science , algorithm , artificial intelligence , mathematics , mathematical analysis , philosophy , epistemology

. We present and evaluate two methods for improving the performanceof ILP systems. One of them is discretization of numerical attributes,based on Fayyad and Irani's text [9], but adapted and extendedin such a way that it can cope with some aspects of discretization thatonly occur in relational learning problems (when indeterminate literalsoccur). The second technique is lookahead. It is a well-known problem inILP that a learner cannot always assess the quality of a refinement without...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research