本論文中提出一個漸進式演算法藉由區域網路使流量記錄挖掘使用者存取型樣，因為記錄網路流量資料庫很大，我們需要發展一個較快速的關聯法則演算法以有效的獲得使用者存取型樣並使用屬性關係圖形來表示網路使用者之間的關係。關係圖的改變意指網路環境的變化，隨著時間的變化，為了不需較多的計算時間產生使用者存取型樣，我們提出一個漸進式方式提供區網管理者容的追蹤網路使用狀況以及便於網管人員管理網路

This thesis proposes an incremental algorithm to discover regional network access patterns from traffic data of a regional network. Because the size of network traffic database is very large, we need to develop a fast algorithm of association rules in order to efficiently generate user access patterns. Attributed relational graph is used to represent user access patterns on the network. The change of relational graph indicates the access pattern of a regional network is changed. In order to keep the network access pattern up to date without spending great computation costs, we propose an incremental procedure to generalize network access patterns from time to time. The results can be used for supporting network administrators to easily keep track of network usage patterns and better manage regional networks

CHAPTER 1 1
INTRODUCTION 1
1.1 RESEARCH MOTIVATION AND OBJECTIVE 1
1.2 RESEARCH FRAMEWORK 5
CHAPTER 2 8
LITERATURE REVIEW 8
2.1 ASSOCIATION RULE 8
2.2 LAG (LARGE ACCESS GRAPH) 12
2.3 COLUMN-WISE 14
2.4 FUP2 16
CHAPTER 3 20
THE IMPROVEMENT OF THE DISCOVERY OF LARGE ACCESS GRAPH 20
3.1 THE CONCEPT OF LAG2 ALGORITHM 20
3.2 THE LAG2 ALGORITHM 20
CHAPTER 4 26
THE INCREMENTAL APPROACH TO DISCOVERING PATTERNS 26
4.1 THE CONCEPT OF ILAG 26
4.2 THE ILAG ALGORITHM 26
CHAPTER 5 29
THE DETERMINATION OF TIME INTERVALS FOR COMMON ACCESS PATTERNS 29
5.1 THE CYCLE EXISTING IN A REGIONAL NETWORK 29
5.2 THE SIMULATION OF TRAFFIC DATA WITH A CYCLE 29
CHAPTER 6 34
PERFORMANCE EVALUATION 34
6.1 THE DEMONSTRATION OF NETWORK ACCESS PATTERN 34
6.2 THE PERFORMANCE COMPARISON BETWEEN LAG AND LAG2 37
6.3 THE PERFORMANCE COMPARISON BETWEEN ILAG AND LAG2 37
CHAPTER 7 40
CONCLUSIONS AND FUTURE RESEARCH 40
REFERENCES 42

Agrawal, R. and Srikant, R. (1994), “Fast Algorithm for Mining Association Rules in Large Databases”, In Proc. 1994 Int’l Conf. VLDB, 1994, pp. 487-499.
Agrawal, R., Imilienski, T. and Swami, A. (1993), “Mining Association Rules between Sets of Items in Large Databases”, Proc. Of the ACM SIGMOD Int’l Conf. On Management of Data, 1993, pp. 207-216.
Brin, S., Motwani, R., Ullman, J. and Tsur, S. (1997), “Dynamic Itemset Counting and Implication Rules for Market Basket Data”, Proc, of SIGMOD’97, Pp. 255-264.
Cheung D.W.L., Lee S.D. and Kao B. (1997), “A general incremental technique for maintaining discovered association rules”, Proceedings of the Fifth International Conference on Database Systems for Advanced Applications, Melbourne, Australia, 1997, pp. 185-194.
Cheung, D. W., Han, J., Ng, V. T., and Wong, C.Y. (1996), “Maintenance of discovered association rules in large databases: An incremental updating technique”, Proceedings of the Twelfth International Conference on Data Engineering, 1996.
Cooley, R., Mobasher, B. and Srivastava, J. (1997), “Web Mining Information and Pattern Discovery on the World Wide Web”, Proceedings of Ninth IEEE International Conference on Tools with Artificial Intelligence, 1997, pp. 558 – 567.
Dunkel, B. and Soparkar, N. (199), “Data Organization and Access for Efficient Data Mining”, ICDE 1999, Sydney, Australia, 1999.
Lee, S.D., Cheung, David W. and Kao, Ben (1998), “IS Sampling Useful in Data Mining? A Case in the Maintenance of Discovered Association Rules”, Data Mining and Knowledge Discovery 2, 1998, pp. 233-262.
Lin, F.-r., Chang, S. T. (2000), “Mining User Access Patterns from Network Flow on the Internet”, ICIM 2000, 2000.
Lin, I. Y., Huang, X. M. and Chen (2000), “M. S., Capturing User Access Patterns in the Web for Data Mining”, Proceedings of 11th IEEE International Conference on Tools with Artificial Intelligence, 9-11 Nov. 1999, pp. 345 – 348.
Park, J. S., Chen, M. S. and Yu, P. S. (1995), “An Effective Hash Based Algorithm for Mining Association Rules”, Proc. ACM SIGMOD, 1995, pp. 175-186.
Rainford, Chris P., Mohania, Mukesh K. and Roddick, John F. (1997), “A Temporal windowing technique for the incremental maintenance of association rules”, In 8th International Database Workshop, Data Mining, Data Ware housing and Client/Server Databases, 1997.
Rainsford, Chris P., Mohania, Mukesh K. and Roddick, John F. (1997), “A temporal windowing technique for the incremental maintenance of association rules”. In 8th incremental database workshop, data Mining, Data ware housing and Client/Server Databases, 1997.
Sanil, A., Banks, D. and Carley, K. (1995), “Models for evolving fixed node networks: model fitting and model testing”, Social Networks, 1995, pp. 65-81.
Savasere, A., Omiecinski, E. and Navathe, S. (1995), “An Efficient Algorithm for Mining Association Rules in Large Databases”, Proc. Of the 21 st VLDB Conference, 1995, pp. 432-444.
Shoubridge, P., Kraetzl, M., and Ray, D. (1999), “Detection of abnormal change in dynamic networks, Proceedings of Information”, Decision and Control, 1999 (IDC 99), 8-10 Feb. 1999, pp. 557 – 562.
Tang, Jian (1998); “Using incremental pruning to increase the efficiency of dynamic itemset counting for mining association rules”, Proceedings of the 1998 ACM 7th international conference on Information and knowledge management, 1998, pp. 273 – 280.
Toivonen, H. (1996), “Sampling Large Databases for Association Rules”, VLDB, 1996, pp. 134-145.
Zaiance, O. R., Xin, M. and Han, J. (1998), “Discovering Web access patterns and trends by applying OLAP and data mining technology on Web logs”, Proceedings of IEEE International Forum on Research and Technology Advances in Digital Libraries (ADL 1998), 2-24 Apr. 1998, pp. 9-29.