隨著資訊科技與資料自動收集設備的快速發展，已有大量的資料被收集並儲存在各式各樣的儲存設備上。從這些大量的資料中萃取出有價值的資訊加以運用，已成為企業組織提升競爭力的重要關鍵。資料探勘提供了在大量資料庫中挖掘出重要的、未知的以及可用的資訊的一些自動化方法。而頻繁型樣探勘在資料探勘領域中一直是個相當重要的研究議題。
已有許多方法被提出來探勘各式各樣的頻繁型樣。這些型樣包括：頻繁項目集、關聯規則、序列型樣和相關規則等。本論文提出三個演算法分別探勘三種新型的頻繁型樣：負相序列型樣、負相模糊序列型樣和模糊相關規則。
我們所提的負相序列型樣探勘演算法，有別於傳統的序列型樣演算法，不僅考慮到交易紀錄中有出現的項目，同時也把沒有出現在交易紀錄上的項目考慮進來。在探勘過程中,我們運用先驗法則來減少多餘候選序列的產生。並且，我們定義了一個以條件機率為基礎的蘊義衡量函數(Interestingness measure),藉以找出涵義較高的負相序列型樣。
因為大多數實際的交易資料都是數量型資料，為了分析資料庫中具有數量值的項目，我們結合模糊集合論與前述負相序列型樣探勘演算法，提出另一演算法:負相模糊型樣探勘演算法。該演算法將數量型項目模糊化為模糊項目，從而在數量型資料庫中找出負相模糊序列型樣。
此外，我們也針對模糊相關規則的探勘提出演算法。該演算法藉由模糊相關分析來判斷兩個模糊項目集在資料庫中的相關性，從而在數量型資料庫中探勘出模糊相關規則。
實驗顯示，我們所提的三個演算法能夠有效避免產生大量多餘的候選項目集和候選序列，並且能夠找出數量較精簡、涵意較高的頻繁型樣。

Due to rapid developments in information technology and automatic data collection tools, a large amount of data has been collected and stored in various data repositories. To extract valuable information from these data is the key to improve business competition. Data mining offers ways to automatically find nontrivial, previously unknown, and potentially useful knowledge from large databases. Mining of frequent patterns plays an essential role in data mining. 
Many methods have been proposed for discovering various types of frequent patterns such as frequent itemsets, association rules, correlation rules, and sequential patterns. In this dissertation, three types of frequent patterns, namely, negative sequential patterns, negative fuzzy sequential patterns, and fuzzy correlation rules, have been introduced. 
We propose an algorithm for mining negative sequential patterns, which consider not only the occurrence of itemsets in transactions in databases but also their absence. In this algorithm, we have designed a candidate generation procedure employing the apriori principle to eliminate many redundant candidates during the mining task. Moreover, in this method, we also define a function based on the conditional probability theory to measure the interestingness of sequences in order to find more interesting negative sequential patterns.
Additionally, most transaction data in real-world applications usually consist of quantitative values. In order to investigate various types of data in quantitative databases and then discover negative sequential patterns from such databases, we propose an algorithm, which combines fuzzy-set theory and negative sequential pattern concept, for mining negative fuzzy sequential patterns from quantitative databases. 
Furthermore, we propose a method for mining fuzzy correlation rules, which applies fuzzy correlation analysis to determine whether two sub-fuzzy itemsets in a fuzzy itemset are dependent, and then extract more interesting fuzzy correlation rules from quantitative databases.
Experiments in the three proposed algorithms show that our algorithms can prune a lot of redundant candidates during the process of mining tasks and can effectively extract frequent patterns that are actually interesting.

Table of Contents-----------------------------------------------------------------I
List of Figures---------------------------------------------------------------------IV
List of Tables-----------------------------------------------------------------------V
Chapter 1 Introduction-----------------------------------------------------------1
1.1 Motivation--------------------------------------------------------------------1
1.2 Research Objective----------------------------------------------------------3
1.3 Organization of this Dissertation------------------------------------------4
Chapter 2 Background Knowledge---------------------------------------------5
2.1 Data Mining------------------------------------------------------------------5
2.1.1 Classification---------------------------------------------------------7
2.1.2 Clustering Analysis--------------------------------------------------7
2.1.3 Outlier Analysis------------------------------------------------------8
2.1.4 Evolution Analysis---------------------------------------------------8
2.2 Frequent Pattern Mining----------------------------------------------------9
2.2.1 Association Rules and Correlation Rules------------------------9
2.2.2 Sequential Patterns-------------------------------------------------15
Chapter 3 Mining Negative Sequential Patterns---------------------------16
3.1 Preliminary------------------------------------------------------------------16
3.2 Problem Statement---------------------------------------------------------16
3.2.1 Sequential Patterns------------------------------------------------16
3.2.2 Negative Sequential Patterns------------------------------------18
3.3 Related Work---------------------------------------------------------------20
3.4 Algorithm NSPM-----------------------------------------------------------21
3.4.1 Procedure NSP-----------------------------------------------------21
3.4.2 Candidates Generation-------------------------------------------22
3.5 Example Experiment-------------------------------------------------------29
3.6 Summary---------------------------------------------------------------------35
Chapter 4 Mining Negative Fuzzy Sequential Patterns------------------36
4.1 Preliminary------------------------------------------------------------------36
4.2 Problem Statement---------------------------------------------------------36
4.2.1 Sequential Patterns--------------------------------------------------36
4.2.2 Negative Sequential Patterns---------------------------------------38
4.2.3 Fuzzy Sequential Patterns------------------------------------------39
4.2.4 Negative Fuzzy Sequential Patterns-------------------------------40
4.3 Related Work---------------------------------------------------------------41
4.4 Algorithm NFSPM---------------------------------------------------------43
4.4.1 Procedure NFSP------------------------------------------------------44
4.4.2 Candidates Generation-----------------------------------------------45
4.5 Example Experiment-------------------------------------------------------51
4.6 Summary--------------------------------------------------------------------58
Chapter 5 Mining Fuzzy Correlation Rules---------------------------------59
5.1 Preliminary------------------------------------------------------------------59
5.2 Problem Statement---------------------------------------------------------60
5.3 Fuzzy Correlation Analysis-----------------------------------------------63
5.4 The Proposed Method-----------------------------------------------------65
5.5 Example Experiment-------------------------------------------------------67
5.6 Summary--------------------------------------------------------------------71
Chapter 6 Conclusion and Future Work------------------------------------73
6.1 Conclusion------------------------------------------------------------------73
6.2 Future Work-----------------------------------------------------------------74
References--------------------------------------------------------------------------75

 
List of Figures

Fig. 2.1 The process of knowledge discovery in databases--------------------6
Fig. 2.2 The apriori algorithm--------------------------------------------------11
Fig. 2.3 Procedure apriori_gen--------------------------------------------------12
Fig. 2.4 An example of the process of the Apriori algorithm---------------13
Fig. 3.1 Algorithm NSPM---------------------------------------------------------25
Fig. 3.2 Procedure NSP-----------------------------------------------------------26
Fig. 3.3 Procedure p_gen---------------------------------------------------------27
Fig. 3.4 Procedure n_ge-----------------------------------------------------------28
Fig. 4.1 Algorithm NFSPM-------------------------------------------------------47
Fig. 4.2 Procedure NFSP----------------------------------------------------------48
Fig. 4.3 Procedure cp_gen-------------------------------------------------------49
Fig. 4.4 Procedure cn_gen--------------------------------------------------------50
Fig. 4.5 The fuzzy membership functions for the fuzzy sets of items------52
 
List of Tables

Table 2.1 An example transaction database D---------------------------------12
Table 2.2 All the association rule candidates generated from itemset {B, C, E}, and their confidence-------------------------------------------14
Table 2.3 All association rules found from the example database ----------14
Table 3.1 The notations used in algorithm NSPM and the related procedures-----------------------------------------------------------24
Table 3.2 A transaction dataset--------------------------------------------------30
Table 3.3 A customer sequence database transformed from Table 3.2-----30
Table 3.4 Large items-------------------------------------------------------------31
Table 3.5 Recorded large items--------------------------------------------------31
Table 3.6 1-Sequences------------------------------------------------------------31
Table 3.7 Positive 2-sequence----------------------------------------------------32
Table 3.8 Negative 2-sequences-------------------------------------------------32
Table 3.9 Positive 3-sequences---------------------------------------------------33
Table 3.10 Negative 3-sequences------------------------------------------------34
Table 3.11 Obtianed negative sequential patterns after calling the NSP procedure-------------------------------------------------------------34
Table 3.12 Obtained interesting negative sequential patterns----------------35
Table 4.1 The notations used in algorithm NFSPM and the related procedures-----------------------------------------------------------46
Table 4.2 A quantitative transaction dataset------------------------------------51
Table 4.3 Fuzzy sets transformed from Table 4.2-----------------------------52
Table 4.4 Large 1-Fuzzy items---------------------------------------------------53
Table 4.5 Large 2-Fuzzy items---------------------------------------------------53
Table 4.6 Mapped large fuzzy itemsets-----------------------------------------53
Table 4.7 1-sequences-------------------------------------------------------------54
Table 4.8 Positive 2-sequences---------------------------------------------------54
Table 4.9 Negative 2-sequences-------------------------------------------------55
Table 4.10 Positive 3-sequences-------------------------------------------------56
Table 4.11 Negative 3-sequence-------------------------------------------------57
Table 4.12 Obtained interesting negative sequential patterns----------------57
Table 5.1 A random sample with 12 fuzzy records---------------------------68
Table 5.2 The fuzzy supports of fuzzy items in F-----------------------------68
Table 5.3 The fuzzy support, fuzzy correlation coefficient and t valueof testing the fuzzy correlation coefficient of each element of C2------------------------------------------------------------------------69
Table 5.4 The fuzzy support, fuzzy correlation coefficient and t valueof testing the fuzzy correlation coefficient of each element of C3------------------------------------------------------------------------70
Table 5.5 The fuzzy confidences of candidate fuzzy correlation rules-----70
Table 5.6 Obtained fuzzy correlation rules-------------------------------------71

[1] R. Agrawal, T. Imielinski, and A. Swami, “Database Mining: A Performance Perspective,” IEEE Transaction on Knowledge and Data Engineering, special 161 issue on Learning & Discovery in Knowledge-Based Databases, Chile, Vol.5, No. 6, pp.914-925, Dec. 1993.
[2] M. S. Chen, J. Han, and P. S. Yu, “Data Mining: An Overview from Database Perspective,” IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 6, pp. 866-883, 1996.
[3] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proceedings of the 11th International Conference on Data Engineering, Taipei, Taiwan, pp. 3-14, March 1995.
[4] J. Ayres, J. E. Gehrke, T. Yiu, and J. Flannick, “Sequential PAttern Mining Using Bitmaps,” Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Alberta, Canada, July 2002.
[5] M. N. Garofalakis, R. Rastogi, and K. Shim, “SPIRIT: Sequential Pattern Mining with Regular Expression Constraints,” Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, pp. 223-234, 1999.
[6] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal and M.-C. Hsu, “FreeSpan: Frequent Pattern-projected Sequential Pattern Mining,” Proceedings of the 6th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 355-359, 2000.
[7] F. Masseglia, F. Cathala, and P. Poncelet, “The PSP Approach for Mining Sequential Patterns,” Proceedings of 1998 2nd European Symposium on Principles of Data Mining and Knowledge Discovery, Vol. 1510, Nantes, France, pp. 176-184, Sep. 1998.
[8] A. M. Mueller, Fast Sequential and Parallel Algorithm for Association Rule Mining: A Comparison, Technical report CS-TR-3515, University of Maryland, 1995.
[9] Han, J. and Kamber, M., Data Mining Concepts and Techniques, Morgan Kanufmann, 2000.
[10] Murthy, S. K., “Automatic construction of decision trees from data: A multi-disciplinary survey,” Data Mining and Knowledge Discovery 2, 4, pp. 345-389, 1998.
[11] Duda, R. and Hart, Pattern Classification and Scene Analysis, Wiley&Sons, Inc., 1973.
[12] James, M., Classification Algorithms, Wiley&Sons, Inc., 1985.
[13] Berkhin, P., Survey of clustering data mining techniques, Tech. rep., Accrue Software, San Jose, CA, 2002.
[14] R. Agrawal, T. Imielinski, A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proceedings of the 1993 ACM SIGMOD Conference on Management of Data, Washington D.C., pp. 207-216, May 1993.
[15] R. Srikant and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements, “Proceedings of the Fifth International conference, Extending Database Technology (EDBT’96), pp. 3-17, 1996. 
[16] J. Han, G. Dong, Y. Yin, “Efficient Mining of Partial Periodic Patterns in Time Series Database, “ Proceedings of Fifth International Conference on Data Engineering, Sydney, Australia, IEEE Computer Society, pp.106-115, 1999.
[17] J. S. Park, M. S. Chen, and P. S. Yu., “An Effective Hash based Algorithm for Mining Association Rules,” Proceedings ACM SIGMOD International Conference on Management of Data, pp. 175-186 ,May 1995.
[18] J. Pei, B. Motazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M-C. Hsu, “Prefixsapn Mining Sequential Patterns Efficiently by Prefix Prejected Pattern Growth,” Proceeding of the International Conference of Data Engineering, pp. 215-224, 2001.
[19] R. Srikant, R. Agrwal, “Mining Assoiation Rules with Item Constraints,” Proceedings of the Third International Conference on Knowledge Discovery in Database and Data Mining, 1997. 
[20] M. J. Zaki, “Efficient Enumeration of Frequent Sequences,”  Proceedings of the Seventh CIKM, 1998.
[21] X. Yan, J. Han, and R. Afshar, “CloSpan: Mining Closed Sequential Patterns in Large Datasets,” Proceedings of 2003 SIAM International Conference Data Mining (SDM’03), pp. 166-177, 2003.
[22] M. Zaki, “SPADE: An Efficient Algorithm for Mining Frequent sequences,” Machine Learning, vol. 40, pp. 31-60, 2001.
[23] M. Zaki, “Efficient Enumeration of Frequent Sequences,” Proceedings of the Seventh International Conference Information and Knowledge Management (CIKM’98), pp. 68-75, 1998.
[24] T. Hong, K. Lin and S. Wang, “Mining fuzzy sequential patterns from multiple-items transactions, “ Proceedings of the Joint ninth IFSA World Congress and twentieth NAFIPS International Conference, pp. 1317-1321, 2001.
[25] R.-S. Chen, G.-H. Tzeng, C.-C. Chen, and Y.-C. Hu, “Discovery of fuzzy sequential patterns for fuzzy partitions in quantitative attributes,” ACS/IEEE International Conference on Computer Systems and Applications (AICCSA), pp. 144-150, 2001.
[26] Y.-C. Hu, R.-S. Chen, G.-H. Tzeng, and J.-H. Shieh, “A fuzzy data mining algorithm for finding sequential patterns,” International Journal of Uncertainty Fuzziness Knowledge-Based Systems, vol. 11, no.2, pp. 173-193, 2003.
[27] A. Fu, M. Wong, S. Sze, W. Wong, W. Wong, and W. Yu. “Finding fuzzy sets for the mining of fuzzy association rules for numerical attributes,” proceeding of the First International Symposium on Intelligent Data Engineering and Learning, Hong Kong, pp.263-268, October 1998. 
[28] C. M. Kuok, A. Fu, and M. H. Wong, “Mining Fuzzy Association Rules in Databases,” SIGMOD Record, pp. 41-46, Mar. 1998. 
[29] R.Srikant, R. Agrawal, “Mining quantitative association rules in large relational tables,” Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, pp. 1-12, 1996.
[30] R.-S. Chen, Y.-Chung Hu, “A Novel Method for Discovering Fuzzy Sequential Patterns Using the Simple Fuzzy Partition Method,” Journal of the American Society for Information Science and Technology, vol. 54, no.7, pp. 660-670, 2003.
[31] Wai-Ho Au, K.C.C. Chan, “An effective algorithm for discovering fuzzy rules in relational databases,” proceeding of IEEE World Congress on Computational Intelligence, pp.1314 –1319, 1998.
[32] S. Brin, R. Motwani, and C. Silverstein, “Beyond market baskets: Generalizing association rules to correlations,” proceeding of the ACM SIGMOD International Conference on Management of Data, pp. 265-276, 1997. 
[33] M. H. Dunham, Data mining, Introductory and Advanced Topics, Pearson Education, Inc., 2003. 
[34] J. Han, M. Kamber, Data mining: Concepts and Techniques, Academic Press, 2001. 
[35] R. Srikant, R. Agrawal, “Mining Generalized Association Rules,” Future Generation Computer Systems, Volume 13(2-3), December 1997, pp.161-180. 
[36] X Wu, C Zhang, S Zhang, “Efficient mining of both positive and negative association rules,” ACM Transactions on Information Systems, Vol. 22 , Issue 3, pp.381–405, July 2004. 
[37] P. Bosc, D. Dubois, O. Pivert, and H. Prade, “On fuzzy association rules based on fuzzy cardinalities,” proceeding of IEEE International Fuzzy Systems Conference, Melbourne, 2001. 
[38] K.C.C. Chan, A.K.C. Wong, “Mining Fuzzy Association Rules,” proceeding of the sixth international conference on Information and knowledge management , Las Vegas, Nevada, United States, pp.209-215, November 1997. 
[39] M. Delgado, N. Marin, D. Sanchez, and M. Vila, “Fuzzy Association Rules: General Model and Applications,” IEEE Transactions on Fuzzy Systems, Vol. 11, No. 2, pp.214- 225, April 2003. 
[40] J.M. de Graaf, W.A. Kosters and J.J.W. Witteman, “Interesting Fuzzy Association Rules in Quantitative Databases,” proceeding of PKDD 2001 (The 5th European Conference on Principles of Data Mining and Knowledge Discovery), Springer Lecture Notes in Computer Science 2168, Freiburg, Germany, pp.140-151, September 2001. 
[41] H. Ishibuchi, T. Nakashima and T. Yamamoto, “Fuzzy association rules for handling continuous attributes,” proceeding of the IEEE International Symposium on Industrial Electronics, pp.118-121, 2001. 
[42] W. Zhang, “Mining Fuzzy Quantitative Association Rules,” proceeding of the 11th IEEE International Conference on Tools with Artificial Intelligence, pp.99-102, 1999. 
[43] H. Bustince, P. Burillo, “Correlation of interval valued intuitionistic fuzzy sets,” Fuzzy sets and systems, Vol. 74, pp.237-244, 1995. 
[44] D. A. Chiang, N. P. Lin, “Correlation of Fuzzy Sets,” Fuzzy Sets and System, Vol. 102, pp.221-226, 1999. 
[45] D. H. Hong, S. Y. Hwang, “Correlation of intuitionistic fuzzy sets in probability spaces,” Fuzzy Sets and Systems, Vol.75, pp.77- 81, 1995. 
[46] C. Yu, “Correlation of fuzzy numbers,” Fuzzy Sets and Systems, Vol. 55, pp.303-307, 1993. 
[47] S. F. Arnold, Mathematical Statistics, Prentice- Hall, New Jersey, 1990. 
[48] M. De Cock, C. Cornelis, and E.E. Kerre, “Elicitation of fuzzy association rules from positive and negative examples,” Fuzzy Sets and Systems, Vol. 149, pp.73–85, 2005. 
[49] D. Dubois, E. Hullermeier and H. Prade, “A Note on Quality Measures for Fuzzy Association Rules,” proceeding of the 10th International Fuzzy Systems Association World Congress (IFSA-03), Lecture Notes in Artificial Intelligence 2715, Springer-Verlag, pp.346-353, 2003. 
[50] R. C. Agarwal, C. C. Aggarwal, and V.V.V. Prasad, “A Tree Projection Algorithmfor Generation of Frequent Item Sets,” Journal of Parallel and DistributedComputing, Vol. 61, No. 3, pp. 350-371, 2001.
[51] R. C. Agarwal, C. C. Aggarwal, “Depth First Generation of Long Patterns,”Proceedings of 2000 ACM International Conference on Knowledge Discovery in Databases, pp. 108-118, 2000.
[52] C. C. Aggarwal and P. S. Yu, “Online Generation of Association Rules,” Proceedings of the 14th International Conference on Data Engineering, Orlando, Florida, USA, pp. 402-411, Feb. 1998.
[53] R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, “Fast Discovery of Association Rules,” Advances in Knowledge Discovery and Data Mining, Chapter 12, AAAI/MIT Press, 1995.
[54] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, pp. 487-499, Sep. 1994.
[55] A. Amir, R. Feldman, and R. Kashi, “A New and Versatile Method for Association Generation,” Information Systems, Vol. 22, No. 6/7, pp. 333-347, 1997.
[56] N. F. Ayan, A. U. Tansel and E. Arkun, “An Efficient Algorithm to Update Large Itemsets with Early Pruning,” ACM SIGKDD Intl. Conf. on Knowledge Discovery in Data and Data Mining, San Diego, California, pp. 287-291, Aug. 1999.
[57] R. J. Bayardo Jr., “Efficiently Mining Long Patterns from Databases,” Proceedings of the 1998 ACM-SIGMOD International Conference on Management of Data, pp. 85-93, 1998. 
[58] C. Bettini, X. S. Wang, and S. Jajodia, “Mining Temporal Relationships with Multiple Granularities in Time Sequences,” Data Engineering Bulletin, Vol. 21, pp. 32-38, 1998.
[59] S. Brin, R. Motwani, J. Ullman, and S. Tsur, “Dynamic Itemset Counting and Implication Rule for Market Basket Data,” Proceedings of the 1997 SIGMOD Conference on Management of Data, pp. 255-264, 1997. 
[60] M. S. Chen, J. S. Park, P. S. Yu, “Efficient Data Mining for Path Traversal Patterns,” IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 2, pp. 209-221, 1998. 162 
[61] M. S. Chen, J. S. Park and P. S. Yu, ”Data mining for path traversal patterns in a web environment,” Proceedings of 16th International Conference on Distributed Computing Systems, pp. 385-392, May 1996.
[62] D. W. Cheung, J. Han, V. Ng, and C. Y. Wong, “Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique,” Proceedings of 12th IEEE International Conference on Data Engineering, pp. 106-114, 1996.
[63] D. W. Cheung, S. D. Lee, and B. Kao, “A general incremental technique for maintaining discovered association rules,” Proceedings of the 5th International Conference on Database Systems for Advanced Applications, pp. 185-194, 1997.
[64] R. Feldman, Y. Aumann, A. Amir, and H. Mannila, “Efficient Algorithms for Discovering Frequent Sets in Incremental Databases,” 2nd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, May 1997.
[65] J. L. Feng and Y. Feng, “Binary partition based algorithms for mining association rules,” Proceedings IEEE International Forum on Research and Technology –Advances in Digital Libraries (ADL'98), pp. 30-34, Apr. 1998.
[66] Y. Fu and J. Han, “Metarule-guided Mining of Association Rules in Relational Databases,” Proceedings of the 1995 International Workshop on Knowledge Discovery and Deductive and Object-Oriented Databases, Singapore, Dec. 1995.
[67] T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, “Mining Optimized Association Rules for Numeric Attributes,” Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems,, pp. 182-191, 1996. 163
[68] J. Han, Y. Cai, and N. Cercone, “Data-Driven Discovery of Quantitative Rules in Relational Databases” IEEE Transactions on Knowledge and Data Engineering, Vol. 5, No. 1, pp.29-40, 1993.
[69] J. Han, Y. Cai, and N. Cercone, “Knowledge Discovery in Databases: An Attribute-Oriented Approach,” Proceeding of the 18th VLDB Conference, pp.547-559, 1992.
[70] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, Dallas, Texas, USA, pp. 1-12, May 2000.
[71] C. Hidber, “Online Association Rule Mining,” Technical Report UCB/CSD-98-1004, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1998. 
[72] J. Hipp, U. Güntzer, and G. Nakhaeizadeh, “Algorithms for Association Rule Mining – A General Survey and Comparison,” SIGKDD Explorations, Vol. 2, Issue 1, pp. 58-64, 2000.
[73] M. Houtsma and A. Swami, “Set-Oriented Mining of Association Rules in Relational Databases,” Int’l Conference on Data Engineering, pp. 25-33, Taipei, Taiwan, March 1995.
[74] H. Kan, D. W. Cheung, and S. W. Xia, “Efficient parallel mining of association 164 rules on shared-memory multiple-processor machine,” IEEE International Conference on Intelligent Processing Systems, pp. 1133-1137, Oct. 1997.
[75] K. Koperski and J. Han, “Discovery of Spatial Association Rules in Geographic Information Databases," SSD, pp. 47-66, 1995.
[76] M. Klemettinen, H. Mannila, P. Ronkainen, and H. Toivonen, “Finding Interesting Rules from Large Sets of Discovered Association Rules,” 3rd International Conference on Information and Knowledge Management, pp. 401-407, Nov. 1994.
[77] G. Lee, K.L. Lee and A.L.P. Chen, “Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases,” Knowledge and Information Systems, Springer-Verlag, Vol. 3, 2001, pp.338-355.
[78] C.-H. Lee, P. S. Yu and M.-S. Chen, “Causality Rules: Exploring the Relationship between Triggering and Consequential Events in a Database of Short Transactions,” Proceedings of the 2nd SIAM International Conference on Data Mining (SDM-02), April 11-13, 2002, pp. 403-419. 
[79] C.-H. Lee, C.-R. Lin and M.-S. Chen, “On Mining General Temporal Association Rules in a Publication Database,” Proceedings of the First IEEE International Conference on Data Mining (ICDM-01), Nov. 29 – Dec. 2, 2001.
[80] C.-H. Lee, C.-R. Lin and M.-S. Chen, “Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining,” Proceedings of the ACM 10th International Conference on Information and Knowledge Management (CIKM-01), Nov. 5-10, 2001, pp. 263-270. 
[81] S. D. Lee, D. Cheung, and B. Kao, "A General Incremental Technique For Maintaining Discovered Association Rules," Proceedings of the 5th International 165 Conference On Database Systems For Advanced Applications, pp. 185-194, Melbourne, Australia, Apr. 1997. 
[82] C.-R. Lin, C.-H. Yun and M.-S. Chen, “Utilizing Slice Scan and Selective Hash for Episode Mining,” KDD-01 Workshop on Temporal Data Mining, August 26-29, 2001. 
[83] J. L. Lin and M. H. Dunham, “Mining association rules: anti-skew algorithms,” Proceedings 14th International Conference on Data Engineering, Orlando, FL, USA., pp. 486-493, Feb. 1998.
[84] B. Liu, W. Hsu, and Y. Ma, “Mining Association Rules with Multiple Minimum Supports,” SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 1999.
[85] D. J. Lubinsky, “Discovery from Databases: A Review of AI and Statistical Techniques,” IJCAI-89 Workshop on Knowledge Discovery in Databases, pp.204-218, Aug. 1989.