An Efficient Algorithm for Mining Association Rules
碩士 === 南台科技大學 === 資訊管理系 === 91 === Due to the improvement of information technologies and popularization of computers, collecting information becomes easier, rapider and more convenient than before. As the time goes by, database cumulates huge and hiding information. Therefore, how to correctly unco...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/94139240649049674349 |
id |
ndltd-TW-091STUT0396010 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091STUT03960102016-11-22T04:12:33Z http://ndltd.ncl.edu.tw/handle/94139240649049674349 An Efficient Algorithm for Mining Association Rules 高效率之關聯法則探勘演算法 I-pei chien 錢依佩 碩士 南台科技大學 資訊管理系 91 Due to the improvement of information technologies and popularization of computers, collecting information becomes easier, rapider and more convenient than before. As the time goes by, database cumulates huge and hiding information. Therefore, how to correctly uncover and efficiently mining from those hiding information becomes a very important issue. Hence the technology of data mining becomes one of the solutions. In the technologies of data mining, association rules mining is one of the most popular technology to be used. Association rule mining explores the approaches to extract the frequent itemsets from large database. Further, derives the knowledge behind implicitly. The Apriori algorithm is one of the most frequently used algorithms. Although the Apriori algorithm can successful derive the association rules from database, the Apriori algorithm has two major defects: First, the Apriori algorithm will produce large amounts of candidate itemsets during extracting the frequent itemsets from large database. Second, frequently scanning whole database lead to inefficient performance. Many researches try to improve the performance of the Apriori algorithm, but still not escape from the frame of the Apriori algorithm and lead to a little improvement of the performance. In this paper we propose QDT and ICI which escape the frame of Apriori algorithm, and it only needs to scan whole database once during extracting the frequent itemsets from large database. Therefore, the QDT and ICI algorithm can efficiently reduce the I/O time, and rapidly extract during extracting the frequent itemsets from large database, and make data mining more efficient than before. 黃仁鵬 2003 學位論文 ; thesis 63 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 南台科技大學 === 資訊管理系 === 91 === Due to the improvement of information technologies and popularization of computers, collecting information becomes easier, rapider and more convenient than before. As the time goes by, database cumulates huge and hiding information. Therefore, how to correctly uncover and efficiently mining from those hiding information becomes a very important issue. Hence the technology of data mining becomes one of the solutions. In the technologies of data mining, association rules mining is one of the most popular technology to be used. Association rule mining explores the approaches to extract the frequent itemsets from large database. Further, derives the knowledge behind implicitly. The Apriori algorithm is one of the most frequently used algorithms. Although the Apriori algorithm can successful derive the association rules from database, the Apriori algorithm has two major defects: First, the Apriori algorithm will produce large amounts of candidate itemsets during extracting the frequent itemsets from large database. Second, frequently scanning whole database lead to inefficient performance. Many researches try to improve the performance of the Apriori algorithm, but still not escape from the frame of the Apriori algorithm and lead to a little improvement of the performance.
In this paper we propose QDT and ICI which escape the frame of Apriori algorithm, and it only needs to scan whole database once during extracting the frequent itemsets from large database. Therefore, the QDT and ICI algorithm can efficiently reduce the I/O time, and rapidly extract during extracting the frequent itemsets from large database, and make data mining more efficient than before.
|
author2 |
黃仁鵬 |
author_facet |
黃仁鵬 I-pei chien 錢依佩 |
author |
I-pei chien 錢依佩 |
spellingShingle |
I-pei chien 錢依佩 An Efficient Algorithm for Mining Association Rules |
author_sort |
I-pei chien |
title |
An Efficient Algorithm for Mining Association Rules |
title_short |
An Efficient Algorithm for Mining Association Rules |
title_full |
An Efficient Algorithm for Mining Association Rules |
title_fullStr |
An Efficient Algorithm for Mining Association Rules |
title_full_unstemmed |
An Efficient Algorithm for Mining Association Rules |
title_sort |
efficient algorithm for mining association rules |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/94139240649049674349 |
work_keys_str_mv |
AT ipeichien anefficientalgorithmforminingassociationrules AT qiányīpèi anefficientalgorithmforminingassociationrules AT ipeichien gāoxiàolǜzhīguānliánfǎzétànkānyǎnsuànfǎ AT qiányīpèi gāoxiàolǜzhīguānliánfǎzétànkānyǎnsuànfǎ AT ipeichien efficientalgorithmforminingassociationrules AT qiányīpèi efficientalgorithmforminingassociationrules |
_version_ |
1718396051448135680 |