Responsive image
博碩士論文 etd-0129108-164840 詳細資訊
Title page for etd-0129108-164840
論文名稱
Title
模糊時間性與週期性關聯法則的探勘
Discovery of fuzzy temporal and periodic association rules
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
138
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2008-01-16
繳交日期
Date of Submission
2008-01-29
關鍵字
Keywords
關聯法則、模糊曆法、模糊週期性、模糊時間性
fuzzy temporal pattern, association rule, fuzzy calendar, fuzzy periodic pattern
統計
Statistics
本論文已被瀏覽 5840 次,被下載 1518
The thesis/dissertation has been browsed 5840 times, has been downloaded 1518 times.
中文摘要
在本論文中,我們主要提出了兩種新形式的時間性知識,也就是模糊時間性關聯法則和模糊週期性關聯法則,我們並提出了針對這兩種新知識的探勘方法。
在我們日常生活中所使用的時間觀念通常都具有不確定性,沒有很嚴格的定義,因此我們發展了模糊曆法代數,以便使用者能夠簡單有效地描述有興趣的時間。同時,經由模糊曆法代數,我們能夠找出所需的時間單元,並從中探勘出模糊時間性和週期性關聯法則。為了能漸進地探勘出模糊時間性關聯法則,我們發展出一個以border為基礎的探勘方法。藉由將有用的資訊儲存在border之中,我們能夠更有效地找出candidate itemset。這些資訊也能更進一步地節省不必要的計算和資料庫讀取的次數。為了找出模糊週期性關聯法則,我們發展了能找出具有週期的pattern的技術。具有週期的pattern會有規律地出現在時間單元上,因此我們除了找尋pattern外,也需找尋週期,而這個問題的困難之處,在於如何找出這些週期。在實際應用所蒐集到的資料庫中所出現的週期,通常都不會太精準,而且時間單位可能具有多重架構。為了找出帶有非同步週期,也就是模糊週期的pattern,我們利用同步週期pattern的資訊以求得一個lower bound,然後利用這個lower bound來產生模糊週期pattern的可能候選。實驗結果證實我們的方法可以有效地找出模糊時間性和模糊週期性關聯法則。
Abstract
With the rapidly growing volumes of data from various sources, new tools and computational theories are required to extract useful information (knowledge) from large databases. Data mining techniques such as association rules have been proved to be effective in searching hidden knowledge in a large database. However, if we want to extract knowledge from data with temporal components, it becomes necessary to incorporate temporal semantics with the traditional data mining techniques. As mining techniques evolves, mathematical techniques become more involved to help improve the quality and diversity of mining. Fuzzy theory is one that has been adopted for this purpose. Up to now, many approaches have been proposed to discover temporal association rules or fuzzy association rules, respectively. However, no work is contributed on mining fuzzy temporal patterns.
We propose in this thesis two data mining systems for discovering fuzzy temporal association rules and fuzzy periodic association rules, respectively. The mined patterns are expressed in fuzzy temporal and periodic association rules which satisfy the temporal requirements specified by the user. Temporal requirements specified by human beings tend to be ill-defined or uncertain. To deal with this kind of uncertainty, a fuzzy calendar algebra is developed to allow users to describe desired temporal requirements in fuzzy calendars easily and naturally. Moreover, the fuzzy calendar algebra helps the construction of desired time intervals in which interesting patterns are discovered and presented in terms of fuzzy temporal and periodic association rules.
In our system of mining fuzzy temporal association rules, a border-based mining algorithm is proposed to find association rules incrementally. By keeping useful information of the database in a border, candidate itemsets can be computed in an efficient way. Updating of the discovered knowledge due to addition and deletion of transactions can also be done efficiently. The kept information can be used to help save the work of counting and unnecessary scans over the updated database can be avoided. Simulation results show the effectiveness of the proposed system for mining fuzzy temporal association rules.
In our mining system for discovering fuzzy periodic association rules, we develop techniques for discovering patterns with periodicity. Patterns with periodicity are those that occur at regular time intervals, and therefore there are two aspects to the problem: finding the pattern, and determining the periodicity. The difficulty of the task lies in the problem of discovering these regular time intervals, i.e., the periodicity. Periodicites in the database are usually not very precise and have disturbances, and might occur at time intervals in multiple time granularities. To discover the patterns with fuzzy periodicity, we utilize the information of crisp periodic patterns to obtain a lower bound for generating candidate itemsets with fuzzy periodicities. Experimental results have shown that our system is effective in discovering fuzzy periodic association rules.
目次 Table of Contents
1 Introduction 1
1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Association Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2.1 Apriori . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.2 Incremental Mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Fuzzy Calendars . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.1 Fuzzy Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.2 Fuzzy Temporal Calendars . . . . . . . . . . . . . . . . . . . . . . . . . . 13
1.3.3 Fuzzy Periodic Calendars . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.4 Literature Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
1.4 Mining Fuzzy Temporal Association Rules . . . . . . . . . . . . . . . . . . . . . . 19
1.5 Mining Fuzzy Periodic Association Rules . . . . . . . . . . . . . . . . . . . . . . . 20
1.6 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2 Fuzzy Calendars 23
2.1 Fuzzy Calendar Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
2.2 Fuzzy Temporal Calendar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
2.3 Fuzzy Periodic Calendar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
3 Discovery of Fuzzy Temporal Association Rules 37
3.1 Our System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
3.2 Mining Fuzzy Temporal Association Rules . . . . . . . . . . . . . . . . . . . . . . 41
3.2.1 Single Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
3.2.2 Incremental Updating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
4 An Illustration of Mining Fuzzy Temporal Association Rules 51
4.1 For Single Database D . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
4.2 For Additions and Deletions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
5 Experimental Results of Mining Fuzzy Temporal Association Rules 61
5.1 Experiment 1: Calendars . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
5.2 Experiment 2: Synthetic data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
5.3 Experiment 3: KDD CUP 2000 Dataset . . . . . . . . . . . . . . . . . . . . . . . 68
6 Discovery of Fuzzy Periodic Association Rules 73
6.1 Our Mining System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
6.1.1 Association Rules in Time Intervals . . . . . . . . . . . . . . . . . . . . . 74
6.1.2 Fuzzy Periodic Association Rules . . . . . . . . . . . . . . . . . . . . . . . 75
6.2 Mining Fuzzy Periodic Association Rules . . . . . . . . . . . . . . . . . . . . . . . 80
6.2.1 Discovering Crisp Periodic Patterns . . . . . . . . . . . . . . . . . . . . . 81
6.2.2 Discovering Fuzzy Periodic Patterns . . . . . . . . . . . . . . . . . . . . . 87
6.2.3 Incremental Mining of Crisp and Fuzzy Periodic Patterns . . . . . . . . . 88
7 An Illustration of Mining Fuzzy Periodic Association Rules 90
7.1 For Crisp Periodic Patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
7.2 For Fuzzy Periodic Patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
8 Experimental Results of Mining Fuzzy Periodic Association Rules 100
8.1 Experiment 1: Synthetic Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . 101
8.1.1 Discovering Crisp Periodic Association Rules . . . . . . . . . . . . . . . . 103
8.1.2 Discovering Fuzzy Periodic Association Rules . . . . . . . . . . . . . . . . 104
8.2 Experiment 2: KDD CUP 2000 Dataset . . . . . . . . . . . . . . . . . . . . . . . 107
8.2.1 Discovering Crisp Periodic Association Rules . . . . . . . . . . . . . . . . 109
8.2.2 Discovering Fuzzy Periodic Association Rules . . . . . . . . . . . . . . . . 111
9 Conclusion 114
Bibliography 117
參考文獻 References
[1] R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 207–216, Washington D.C., USA, May 1993.
[2] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the International Very Large Database Conference, pages 487–499, Santiago de Chile, Chile, Sep. 1994.
[3] R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering, pages 3–14, Taipei, Taiwan, Sep. 1995.
[4] W. G. Aref, M. G. Elfeky, and A. K. Elmagarmid. Incremental, online, and merge mining of partial periodic patterns in time-series databases. IEEE Trans. Knowledge and Data Engineering, 16(3):335–345, 2004.
[5] W. H. Au and K. C. C. Chan. Farm: A data mining system for discovering fuzzy association rules. In Proceedings of the 8th IEEE International Conference on Fuzzy Systems, pages 1217–1222, Seoul, Korea, Aug. 1999.
[6] N. F. Ayan. Updating Large Itemsets With Early Pruning. M.Sc. Thesis, Bilkent University, 1999.
[7] G. Becher, F. Clerin-Debart, and P. Enjalbert. A model for time granularity in natural language. In Proceedings of the 5th International Workshop on Temporal Representation and Reasoning, pages 29–36, Sanibel, Florida, USA, May 1998.
[8] C. Bettini. Web services for time granularity reasoning. In Proceedings of the 10th International Symposium on Temporal Representation and Reasoning, pages 1–3, Cairns, Queensland, Australia, Jul. 2003.
[9] C. Bettini, C. Dyreson, W. Evans, and R. Snodgrass. A glossary of time granularity concepts. Temporal Databases: Research and Practice, Lecture Notes in Computer Science, 1399:406–413,1998.
[10] C. Bettini and R. D. Sibi. Symbolic representation of user-defined time granularities. Annals of Mathematics and Artificial Intelligence, 30(1-4):53–92, 2000.
[11] C. Bettini, X. S. Wang, and S. Jajodia. A general framework for time granularity and its application to temporal reasoning. Annals of Mathematics and Artificial Intelligence, 22(1-2):29–58, 1998.
[12] C. Bettini, X. S. Wang, and S. Jajodia. Temporal semantic assumptions and their use in databases. IEEE Trans. Knowledge and Data Engineering, 10(2):277–296, 1998.
[13] J. P. Buckley and J. Seitzer. A paradigm for detecting cycles in large data sets via fuzzy mining. In Proceedings of the Knowledge and Data Engineering Exchange Workshop, pages 68–74, Chicago, Illinois, USA, Nov. 1999.
[14] C. H. Cai, A.W. C. Fu, C. H. Cheng, and W.W. Kwong. Mining association rules with weighted items. In Proceedings of the International Database Engineering and Application Symposium, pages 68–77, Cardiff, Wales, UK, Jul. 1998.
[15] R. Chandra, A. Segev, and M. Stonebraker. Implementing calendars and temporal rules in next generation databases. In Proceedings of the 10th International Conference on Data Engineering, pages 264–273, Houston, Texas, USA, Feb. 1994.
[16] C. H. Chang and S. H. Yang. Enhancing SWF for incremental association mining by itemset maintenance. In Proceedings of the 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 301–312, Seoul, Korea, Apr.–May 2003.
[17] D. W. Cheung, S. D. Lee, and B. Kao. A general incremental technique for maintaining discovered association rules. In Proceedings of the 5th International Conference on Database Systems for Advanced Applications, pages 185–194, Melbourne,
Australia, Apr. 1997.
[18] C. Combi, M. Franceschet, and A. Peron. A logical approach to represent and reason about calendars. In Proceedings of the 9th International Symposium on Temporal Representation and Reasoning, pages 134–140, Manchester, UK, Jul. 2002.
[19] C. E. Dyreson, W. S. Evans, H. Lin, and R. T. Snodgrass. Efficiently supporting temporal granularities. IEEE Trans. Knowledge and Data Engineering, 12(4):568–587, 2000.
[20] C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu. Mining Frequent Patterns in Data Streams at Multiple Time Granularities. H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), Next Generation Data Mining, 2003.
[21] I. A. Goralwalla, Y. Leontiev, M. T. Ozsu, D. Szafron, and C. Combi. Temporal granularity: Completing the puzzle. Journal of Intelligent Information Systems, 16(1):41–63, 2001.
[22] K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In Proceedings of the International Conference on Data Mining, pages 163–170, San Jose, California, USA, Nov.–Dec. 2001.
[23] J. Han, G. Dong, and Y. Yin. Efficiently mining of partial periodic patterns in time series databases. In Proceedings of the International Conference on Data Engineering, pages 106–115, Sydney, Australia, Mar. 1999.
[24] K. Y. Huang and C. H. Chang. Asynchronous periodic patterns mining in temporal databases. In Proceedings of the IASTED International Conference on Database and Applications, pages 43–48, Innsbruck, Australia, 2004.
[25] K. Y. Huang and C. H. Chang. SMCA: a general model for mining asynchronous periodic patterns in temporal databases. IEEE Trans. Knowledge and Data Engineering, 17(6):774–785, 2005.
[26] F. Klawonn, Fuzzy sets and vague environments, Fuzzy Sets and Systems, 66:207–221, 1994.
[27] R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers’ report: Peeling the onion. SIGKDD Explorations, 2(2):86–98, 2000.
[28] C. M. Kuok, A. W. C. Fu, and M. H. Wong. Mining fuzzy association rules in databases. SIGMOD Record, 27(1):41–46, 1998.
[29] C. H. Lee, C. R. Lin, and M. S. Chen. Sliding-window filtering: An efficient algorithm for incremental mining. In Proceedings of the ACM 10th International Conference on Information and Knowledge Management, pages 263–270, Atlanta, Georgia, USA,
Nov. 2001.
[30] C. H. Lee, J. C. Ou, andM. S. Chen. Progressive weighted miner: An efficient method for time constraint mining. In Proceedings of the 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 449–460, Seoul, Korea, Apr.–May 2003.
[31] W. J. Lee and S. J. Lee. An efficient mining method for incremental updation in large databases. In Proceedings of the 4th International Conference on Intelligent Data Engineering and Automated Learning, pages 630–637, Hong Kong, China, Mar. 2003.
[32] W. J. Lee and S. J. Lee. Disocvery of fuzzy temporal association rules. IEEE Trans. System, Man, and Cybernetics-PartB:Cybernetics, 34(6):2330–2342, 2004.
[33] Y. Li, P. Ning, X. S.Wang, and S. Jajodia. Discovering calendar-based temporal association rules. Data and Knowledge Engineering, 44(2):193–218, 2003.
[34] S. Ma and J. L. Hellerstein. Mining partially periodic event patterns with unknown periods. In Proceedings of the 17th International Conference on Data Engineering, pages 205–214, Heidelberg, Germany, 2001.
[35] I. Merlo, E. Bertino, E. Ferrari, S. Gadia, and G. Guerrini. Querying multiple temporal granularity data. In Proceedings of the 7th International Workshop on Temporal Representation and Reasoning, pages 103–114, Nova Scotia, Canada, Jul. 2000.
[36] P. Ning, X. S.Wang, and S. Jajodia. An algebraic representation of calendars. Annals of Mathematics and Artificial Intelligence, 36(1-2):5–38, 2002.
[37] B. Ozden, S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In Proceedings of the 15th International Conference on Data Engineering, pages 412–421, Orlando, Florida, USA, Feb. 1998.
[38] S. Ramaswamy, S. Mahajan, and A. Silberschatz. On the discovery of interesting patterns in association rules. In Proceedings of the International Very Large Database Conference, pages 368–379, New York, USA, Aug. 1998.
[39] N. L. Sarda and N. V. Srinivas. An adaptive algorithm for incremental mining of association rules. In Proceedings of DEXA Workshop, pages 240–245, Vienna, Austria, Aug. 1998.
[40] X. Z. Sun, M. E. Orlowska, and X. Li. Introducing uncertainty into pattern discovery in temporal event sequences. In Proceedings of the Third IEEE International Conference on Data Mining, pages 299–306, Florida, USA, 2003.
[41] M. D. Soo, R. Snodgrass, C. Dyreson, C. S. Jensen, and N.Kline. Architectural extensions to support multiple calendars. Technical Report TR-32, Computer Science Department, University of Arizona, 1992.
[42] P. Terenziani. Symbolic user-defined periodicity in temporal reational databases. IEEE Trans. Knowledge and Data Engineering, 15(2):489–509, 2003.
[43] S. Tomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules in large databases. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, pages 263–266, Newport Beach, California, USA, Aug. 1997.
[44] I. H. Toroslu. Repetition support and mining cyclic patterns. Expert Systems with Applications, 25(3):303–311, 2003.
[45] J. Yang, W. Wang and P. S. Yu. Infominer: mining surprising periodic patterns. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 395–400, CA, USA, 2001.
[46] J. Yang, W. Wang and P. S. Yu. Mining asynchronous periodic patterns in time series data. IEEE Trans. Knowledge and Data Engineering, 15(3):613–628, 2003.
[47] L. A. Zadeh. Fuzzy sets. Information and Control, 8:338–353, 1965.
[48] M. J. Zaki and C. Hsiao. CHARM: An Efficient Algorithm for Closed Association Rule Mining. Technical Report 99-10. Rensselaer Polytechnic Institute, 1999.
[49] R. J. Zhang and E.Unger. Calendar algebra. Technical Report TR-CS-96-1, Kansas State University, 1996.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code