Efficient Mining of Association Rules From Merged Itemsets
碩士 === 逢甲大學 === 資訊工程所 === 91 === Mining for association rules between items in a large database of sales transactions has been widely investigated recently. In this thesis we use three kinds of data preprocess methods to merge itemsets in a database and present an algorithm to mine association rules...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/r3e978 |
id |
ndltd-TW-091FCU05392058 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091FCU053920582018-06-25T06:06:39Z http://ndltd.ncl.edu.tw/handle/r3e978 Efficient Mining of Association Rules From Merged Itemsets 在合併的項目集中有效率的進行關聯式法則挖掘之研究 Shi-Qin Weng 翁世親 碩士 逢甲大學 資訊工程所 91 Mining for association rules between items in a large database of sales transactions has been widely investigated recently. In this thesis we use three kinds of data preprocess methods to merge itemsets in a database and present an algorithm to mine association rules from merged itemsets. One of data preprocesses method is using sort to group the similar transactions. The other two are used a simplified dynamic programming algorithm to merge transactions. Compared to the other algorithms for mining association rules, our methods reduce a lot of I/O overhead. The results of our experiment show that it only costs one pass of scanning database. Therefore, our methods are especially suitable for very large size databases. They are also ideal for mining association rules with updated databases. Dong-Lin Yang 楊東麟 2003 學位論文 ; thesis 50 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 逢甲大學 === 資訊工程所 === 91 === Mining for association rules between items in a large database of sales transactions has been widely investigated recently. In this thesis we use three kinds of data preprocess methods to merge itemsets in a database and present an algorithm to mine association rules from merged itemsets. One of data preprocesses method is using sort to group the similar transactions. The other two are used a simplified dynamic programming algorithm to merge transactions. Compared to the other algorithms for mining association rules, our methods reduce a lot of I/O overhead. The results of our experiment show that it only costs one pass of scanning database. Therefore, our methods are especially suitable for very large size databases. They are also ideal for mining association rules with updated databases.
|
author2 |
Dong-Lin Yang |
author_facet |
Dong-Lin Yang Shi-Qin Weng 翁世親 |
author |
Shi-Qin Weng 翁世親 |
spellingShingle |
Shi-Qin Weng 翁世親 Efficient Mining of Association Rules From Merged Itemsets |
author_sort |
Shi-Qin Weng |
title |
Efficient Mining of Association Rules From Merged Itemsets |
title_short |
Efficient Mining of Association Rules From Merged Itemsets |
title_full |
Efficient Mining of Association Rules From Merged Itemsets |
title_fullStr |
Efficient Mining of Association Rules From Merged Itemsets |
title_full_unstemmed |
Efficient Mining of Association Rules From Merged Itemsets |
title_sort |
efficient mining of association rules from merged itemsets |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/r3e978 |
work_keys_str_mv |
AT shiqinweng efficientminingofassociationrulesfrommergeditemsets AT wēngshìqīn efficientminingofassociationrulesfrommergeditemsets AT shiqinweng zàihébìngdexiàngmùjízhōngyǒuxiàolǜdejìnxíngguānliánshìfǎzéwājuézhīyánjiū AT wēngshìqīn zàihébìngdexiàngmùjízhōngyǒuxiàolǜdejìnxíngguānliánshìfǎzéwājuézhīyánjiū |
_version_ |
1718706406605979648 |