Block-Wise Construction of Acyclic Relational Features with Monotone Irreducibility and Relevancy Properties
published: Aug. 26, 2009, recorded: June 2009, views: 2788
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which preserve the monotonicity of frequency, our block-wise approach preserves a form of monotonicity of the irreducibility and relevancy feature properties, which are important in propositionalization employed in the context of classiﬁcation learning. With pruning based on these properties, our block-wise approach efﬁciently scales to features including tens of ﬁrst-order literals, far beyond the reach of state-of-the art propositionalization or inductive logic programming systems.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !