| 摘要(英) |
Current research on periodic pattern mining focuses on mining asynchronous but simple single-evnet patterns. However, in real-life situation, there are more than one events happening at one time. In this paper, we propose a thoroughly-new algorithm to really solve the problem we would experience in livelihood. Three parameters min_rep, max_dis and total_rep are employed to specify the constraints a significant pattern must satisfy. Min_rep specify the minimum number of repetitions that is required within each segment of non-disrupted pattern occurrences, max_dis specify the maximum allowed disturbance between any two successive valid segments, and total_rep claims the minimum overall repetitions that is needed within a valid subsequence.
Our algorithm is composed of two individual parts. One is called 1-pattern mining, and the other is called pattern growth. In the first part, a sliding window method is devised to find the entire potential valid segment matched by 1-patterns. The second part, we make use of the concept of BFS to gain valid subsequences in the overall time series dataset. Finally in experiments, our algorithm is shown efficient and stable with scale-up dataset size. |
| 參考文獻 |
[1] Jiawei Han, Wan Gong, Yiwen Yin, "Mining Segment-Wise Periodic Patterns in Time-Related Databases", International Conference on Knowledge Discovery and Data Mining, pp. 214-218, 1998.
[2] Jiawei Han, Guozhu Dong, Yiwen Yin, "Efficient Mining of Partial Periodic Patterns in Time Series Database", International Conference on Data Engineering, pp. 106-115, 1999.
[3] Herman J. Loether and Donald G. McTavish, "Descriptive and Inferential Statistics: An Introduction", Allyn and Bacon, 1993.
[4] Banu Ozden, Sridhar Ramaswamy, and Abraham Silberschatz, "Cyclic Association Rules", International Conference on Data Engineering, pp. 412-421, 1998.
[5] Sridhar Ramaswamy, Sameer Mahajan, Avi Silberschatz, "On the Discovery of Interesting Patterns in Association Rules", International Conference on Very Large Data Bases, pp. 368-379, 1998.
[6] Jiong Yang, Wei Wang, Philip S. Yu, "Mining Asynchronous Periodic Patterns in Time Series Data", Internationl Conference on Knowledge Discovery and Data Mining, pp. 275-279, 2000.
[7] Wei Wang, Jiong Yang, "Mining Patterns in Long Sequential Data with Noise", International Conference on Knowledge Discovery and Data Mining (SIGKDD Explorations), pp. 28-33, 2000.
[8] Wei Wang, Jiong Yang, Philip S. Yu, "Meta-Patterns: Revealing Hidden Periodic Patterns", International Conference on Knowledge Discovering and Data Mining, pp. 550-557, 2001.
[9] Rakesh Agrawal, Ramakrishnan Srikant, "Fast Algorithms for Mining Association Rules in Large Databases", International Conference on Very Large Data Bases, pp. 487-499, 1994.
[10] Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami, "Mining Association Rules between Sets of Items in Large Databases", International Conference on Management of Data, pp. 207-216, 1993.
[11] Osmar R. Zaiane, Man Xin, Jiawei Han, "Discovering Web Access Patterns and Trends by Applying OLAP and Data Mining Technology on Web Logs", Advances in Digital Libraries, pp. 19-29, 1998.
[12] Sheng Ma, Joseph L. Hellerstein, "Mining Partially Periodic Event Patterns With Unknown Periods", International Conference on Data Engineering, pp. 205-214, 2000. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit