在序列資料庫中找出具有時間間隔的混合樣式

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：31

、訪客IP：3.12.155.235

姓名

邱柏豪(Po-Hao Chiu) 查詢紙本館藏

畢業系所

資訊管理學系

論文名稱

在序列資料庫中找出具有時間間隔的混合樣式
(Discovering Time-Interval Hybrid Temporal Patterns in Sequence Database)

相關論文

★ 零售業商業智慧之探討	★ 有線電話通話異常偵測系統之建置
★ 資料探勘技術運用於在學成績與學測成果分析 -以高職餐飲管理科為例	★ 利用資料採礦技術提昇財富管理效益 -以個案銀行為主
★ 晶圓製造良率模式之評比與分析－以國內某DRAM廠為例	★ 商業智慧分析運用於學生成績之研究
★ 運用資料探勘技術建構國小高年級學生學業成就之預測模式	★ 應用資料探勘技術建立機車貸款風險評估模式之研究－以A公司為例
★ 績效指標評估研究應用於提升研發設計品質保證	★ 基於文字履歷及人格特質應用機械學習改善錄用品質
★ 以關係基因演算法為基礎之一般性架構解決包含限制處理之集合切割問題	★ 關聯式資料庫之廣義知識探勘
★ 考量屬性值取得延遲的決策樹建構	★ 從序列資料中找尋偏好圖的方法 - 應用於群體排名問題
★ 利用分割式分群演算法找共識群解群體決策問題	★ 以新奇的方法有序共識群應用於群體決策問題

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

序列樣式探勘是資料探勘技術中很重要的一項技術，其可經由時間的關係來瞭解各事件所發生的行為。在序列的資料中，事件可被區分為兩種主要的類型，分別為「點式事件」以及「區間式事件」，而當一序列可同時包含此兩種類型的事件時，我們稱這種序列為「混合事件」的序列。近來的研究中，吳以及陳博士所提出的演算法，可以用來找出混合事件的循序樣式，並且稱此樣式為混合樣式。雖然混合樣式的確可找出混合事件的時間先後關係，但卻無法從中瞭解各混合事件間的時間間隔。因此在本論文中，我們將延伸去探討混合樣式，來使得各事件的時間間隔可被顯露出來。我們提出兩種演算法ti-HPrefixSpan 和 ti-HTPM (分別修改自傳統的PrefixSpan和GSP演算法) 來找出具有時間間隔的混合樣式。在實驗中，我們透過模擬的資料與實際股市的資料來評估演算法的效能，並且從結果中知道我們所提出的兩種演算法都具有相當不錯的實驗成效。此外，相較於混合序列樣式，我們也從實驗中進一步分析出具有時間間隔的混合樣式確實能擁有更好預測準確率。

摘要(英)

Sequential pattern mining can reveal the behaviors of events along the time, and it is one of the most important approaches in data mining. In sequence data, events can be classified into two major types, where one is point-based events and the other is interval-based events. When a data sequence can contain both types of events, we say this data sequence has hybrid events. Recently, the work of Wu and Chen has proposed algorithms to discover sequential patterns of hybrid events, called hybrid temporal patterns. Although hybrid temporal patterns can reveal the temporal relationships among hybrid events, they can not tell us the time intervals among events. Therefore, this thesis extends hybrid temporal patterns so that the time intervals among events can be revealed. We call this type of extended patterns as time-interval hybrid temporal patterns. In the thesis, we proposed two algorithms, ti-HPrefixSpan and ti-HTPM, to discover time-interval hybrid temporal patterns by modifying traditional PrefixSpan and GSP algorithms, respectively. In the experiments, we evaluate the proposed methods’ performance using synthetic data and real stock price data. The results of the experiments show that the performances of the two proposed algorithms are quite satisfactory. Besides, we also show that time-interval hybrid temporal patterns can obtain higher prediction accuracy than hybrid temporal patterns.

關鍵字(中)

★ 序列樣式
★ 混合樣式
★ 資料挖掘
★ 時間間隔

關鍵字(英)

★ Sequential patterns
★ Hybrid temporal patterns
★ Data mining
★ Time interval

論文目次

CHAPTER 1　INTRODUCTION
CHAPTER 2　PREVIOUS RESEARCHES
2.1　SEQUENTIAL PATTERN MINING
2.2　HYBRID TEMPORAL PATTERN MINING
2.3　TIME-INTERVAL SEQUENTIAL PATTERN MINING
CHAPTER 3　PROBLEM DEFINITION
3.1　HYBRID SEQUENCES
3.2　HYBRID TIME GAP SEQUENCES
3.3　AUTOMATICALLY GENERATING TIME INTERVAL SET
3.4　TIME-INTERVAL HYBRID TEMPORAL PATTERN
CHAPTER 4　ALGORITHMS
4.1　THE TI-HPREFIXSPAN ALGORITHM
4.2　THE TI-HTPM ALGORITHM
CHAPTER 5　EXPERIMENTS AND PERFORMANCE EVALUATION
5.1　DATA GENERATION
5.2　DISCOVERING PATTERNS FROM POINT-BASED EVENT SEQUENCES
5.3　DISCOVERING PATTERNS FROM HYBRID EVENT SEQUENCES
5.4　REAL DATA EVALUATION
CHAPTER 6　CONCLUSIONS AND FUTURE WORKS
REFERENCES

參考文獻

[1] R. Agrawal, and R. Srikant, “Mining Sequential Patterns,” Proc. 11th Int’l Conf. on Data Eng., pp. 3-14, Mar. 1995.
[2] Pei, J., et al., “PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth,” in Data Engineering, 2001. Proceedings. 17th International Conference on, Heidelberg, Germany, pp. 215-224, 2001.
[3] Srikant, R. and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements,” in Preceedings of the 5th International Conference on Extending Database Technology (EDBT), Avignon, France, IBM Research Division, pp. 3-17, 1996.
[4] Han, J., et al., “FreeSpan: frequent pattern-projected sequential pattern mining,” in Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, Boston, Massachusetts, United States, ACM Press, pp. 355-359, 2000.
[5] Zaki, M.J., “SPADE: An Efficient Algorithm for Mining Frequent Sequences,” Machine Learning, vol. 42, no. 1, pp. 31-60, 2001.
[6] Kam, P.-s. and A.W.-c. Fu, “Discovering temporal patterns for interval-based events,” in Proceeding of Second International Conference on Data Warehousing and Knowledge Discovery, London, UK, Springer, pp. 317-326, 2000.
[7] Wu, S.-Y. and Y.-L. Chen, “Mining non-ambiguous temporal patterns for interval-based events,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 6, pp. 742-758, 2007.
[8] Wu, S.-Y. and Y.-L. Chen, “Discovering Hybrid Temporal Patterns from Sequences Consisting of Point- and Interval-Based Events,”
[9] Yu Hirate, and Hayato Yamana, “Generalized Sequential Pattern Mining with Item intervals,” Journal of Computers, vol. 1, no. 3, pp. 51-60, 2006.
[10] Q. Zhao and S. S. Bhowmick, “Sequential pattern mining: a survey,” Technical Report, CAIS, Nanyang Technological University, Singapore, No. 2003118, 2003.
[11] R. Srikant, R. Agrawal., “Mining Sequential Patterns: Generalizations and Performance Improvements,” in Proceedings of 5th Interational Conference on Extending Database Technology (EDBT), Avignon, France, pp. 3-17, 1996. (Expanded version available as IBM Research Report RJ 9994)
[12] H. Mannila, H. Toivonen, and A.I. Verkamo, “Discovering frequent episodes in sequences,” In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD ’95), Montr´eal, Canada, pp. 210-215, 1995.
[13] Y.-L. Chen, M. C. Chiang, M. T. Ko, “Discovering time-interval sequential patterns in sequence databases,” Expert Systems with Applications, vol. 25 no. 3, pp. 343-354, 2003.
[14] M. Yoshida, T. lizuka, H. Shiohara, and M. Ishiguro, “Mining Sequential Patterns Including Time Intervals,” In Proceedings of SPIE on Data Mining and Knowledge Discovery : Theory, Tools, and Technology II, Belur V. Dasarathy, vol. 4057, pp. 213-220, 2000.
[15] Y. L. Chen, and T. C. K. Huang, “Discovering fuzzy time-interval sequential patterns in sequence databases,” IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, vol. 35(5), pp. 959-972, 2005.
[16] Show-Jane Yen and Yue-Shi Lee, “Mining Time-Gap Sequential Patterns from Transaction Databases,” Journal of Computers, vol. 14, No. 2, pp. 30-46, 2002.
[17] R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, “Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications,” In Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, pp. 94-105, 1998.
[18] Achelis, Steven B., “Technical Analysis from A to Z,” McGraw-Hill, New York, 2000.
[19] Appel, G. and W. F. Hitschler, “Stock Market Trading System,” South Carolina: Traders. Press, 1979.
[20] Arthur Hill, “Moving Average Convergence/Divergence (MACD),” http://stockcharts.com/school/doku.php?id=chart_school:technical_indicators:moving_average_conve
[21] Martin and J. Pring, “Technical Analysis Explained: The Successful Investor's Guide to Spotting Investment Trends and Turning Points,” McGraw-Hill, New York, 1999

指導教授

陳彥良(Yen-Liang Chen)

審核日期

2008-6-30

推文