| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Yen,Show-Jane;Chen,Arbee L.P. | en_US |
| dc.date (日期) | 2001-09 | en_US |
| dc.date.accessioned | 21-Aug-2014 15:08:51 (UTC+8) | - |
| dc.date.available | 21-Aug-2014 15:08:51 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-Aug-2014 15:08:51 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69150 | - |
| dc.description.abstract (摘要) | Mining 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.extent | 369298 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Knowledge and Data Engineering (EI,SCI),13(5),839-845 | en_US |
| dc.subject (關鍵詞) | Data mining; knowledge discovery; association rule; association pattern; graph-based approach | en_US |
| dc.title (題名) | A Graph-Based Approach for Discovering Various Types of Association Rules | en_US |
| dc.type (資料類型) | article | en |
