Please use this identifier to cite or link to this item:
Title: Mining the most reliable association rules with composite items
Authors: Wang, KE
Liu, JNK
Ma, WM
Keywords: Data mining
Trees (mathematics)
Issue Date: 2006
Publisher: IEEE
Source: Sixth IEEE International Conference on Data Mining Workshops, 2006 : ICDM Workshops 2006, December 2006, Hong Kong, p. 749-754 How to cite?
Abstract: The issue of mining association rules with composite items was proposed several years ago. Algorithms with composite items have the potential to discover rules which cannot be found out by other algorithms without composite items. However, much redundant rules which are of trivial significance or even incorrect will be also discovered by these algorithms in certain cases. In this paper, the authors design a novel frequent-pattern tree for finding large composite items first. And then how to measure the reliability of these discovered rules with composite items in order to find out the most reliable association rules is discussed
ISBN: 0-7695-2702-7
DOI: 10.1109/ICDMW.2006.117
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Jan 14, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.