https://scholars.lib.ntu.edu.tw/handle/123456789/147087
標題: | On Mining General Temporal Association Rules in a Publication Database | 作者: | Lee, Chang-Hung Lin, Cheng-Ru Chen, Ming-Syan |
公開日期: | 十一月-2001 | 出版社: | 臺北市:國立臺灣大學電機工程學系 | 摘要: | In this paper, we explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundamental problems, i.e., (1) lack of consideration of the exhibition period of each individual item; (2) lack of an equitable support counting basis for each item. To remedy this, we propose an innovative algorithm Progressive-Partition-Miner (abbreviatedly as PPM) to discover general temporal association rules in a publication database. The basic idea of PPM is to first partition the publication database in light of exhibition periods of items and then progressively accumulate the occurrence count of each candidate 2-itemset based on the intrinsic partitioning characteristics. Algorithm PPM is also designed to employ a filtering threshold in each partition to early prune out those cumulatively infrequent 2-itemsets. Explicitly, the execution time of PPM is, in orders of magnitude, smaller than those required by the schemes which are directly extended from existing methods. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/20060927122754523633 | 其他識別: | 20060927122754523633 |
顯示於: | 電機工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
0901icdm01.pdf | 298.33 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。