Deriving strong association mining rules using a dependency criterion, the lift measure
Traditional association mining rule algorithms have two major drawbacks: first, there is a need to repeatedly scan the dataset and second, they generate too many association rules. In this paper, we have presented a dependency-based association mining rule algorithm, implemented using an array list structure in JAVA, that does not require more than one scan of the full dataset and generates a lot less strong association mining rules. The additional dependency criterion used was the lift measure.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 1 (2009)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=282|
When requesting a correction, please mention this item's handle: RePEc:ids:injdan:v:1:y:2009:i:3:p:297-312. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.