An Induction-based Compaction of Sets of Association Rules among Web Concepts

DSpace/Manakin Repository

An Induction-based Compaction of Sets of Association Rules among Web Concepts

Show simple item record

dc.contributor.author Minuto Espil, Mauricio
dc.contributor.author Ale, Juan M.
dc.date.accessioned 2017-04-12T13:24:20Z
dc.date.available 2017-04-12T13:24:20Z
dc.date.issued 2017-04-12
dc.identifier.uri https://riu.austral.edu.ar/handle/123456789/433
dc.description.abstract Association rules are nowadays regarded as robust vehicles for creating Web recommendations. We present an induction-based technique for creating a compact representation of sets of association rules, particularly intended for publishing the compact representation in the Web. Our technique efficiently induces a defeasible logic program from a set of association rules, in a manner that the complete set of the given associations can be concluded, when integrating the induced compact program within a defeasible logic reasoning framework. en_US
dc.language.iso en en_US
dc.title An Induction-based Compaction of Sets of Association Rules among Web Concepts en_US
dc.type Paper en_US


Files in this item

Files Size Format View Description
An induction....pdf 113.5Kb PDF View/Open Texto completo

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account