Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/69150
DC FieldValueLanguage
dc.contributor資科系en_US
dc.creator陳良弼zh_TW
dc.creatorYen,Show-Jane;Chen,Arbee L.P.en_US
dc.date2001-09en_US
dc.date.accessioned2014-08-21T07:08:51Z-
dc.date.available2014-08-21T07:08:51Z-
dc.date.issued2014-08-21T07:08:51Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/69150-
dc.description.abstractMining association rules is an important task for knowledge discovery. We can analyze past transaction data to discover customer behaviors such that the quality of business decision can be improved. Various types of association rules may exist in a large database of customer transactions. The strategy of mining association rules focuses on discovering large itemsets, which are groups of items which appear together in a sufficient number of transactions. In this paper, we propose a graph-based approach to generate various types of association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Empirical evaluations show that our algorithms outperform other algorithms which need to make multiple passes over the database.en_US
dc.format.extent369298 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.relationIEEE Transactions on Knowledge and Data Engineering (EI,SCI),13(5),839-845en_US
dc.subjectData mining; knowledge discovery; association rule; association pattern; graph-based approachen_US
dc.titleA Graph-Based Approach for Discovering Various Types of Association Rulesen_US
dc.typearticleen
item.cerifentitytypePublications-
item.grantfulltextrestricted-
item.fulltextWith Fulltext-
item.openairetypearticle-
item.languageiso639-1en_US-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
839-845.pdf360.64 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


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