| 參考文獻 |
[1] Agrawal, Rakesh and Ramakrishnan Srikant, “Fast Algorithms for Mining Association Rules,” Proc. of the 20th VLDB Conference Santiago, Chile, 1994.
[2] Agrawal, Rakesh and R. Srikant, “Mining Sequential Patterns,” Proc. of the Int’l Conference on Data Engineering, Taipei, Taiwan, March 1995.
[3] T. Y. LIN and N.Cercone, “Rough Sets and Data Mining”
[4] Chen, Ming-Syan, J. S. Park, and Philip S. Yu, “Efficient Data Mining for Path Traversal Patterns,” IEEE Transactions on Knowledge and Data Engineering, Vol.0, No. 2, pp.209-221, 1998.
[5] Chen, Ming-Syan, Jiawei Han and Philip S. Yu, “Data mining: An Overview from a Database Perspective,” IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No.6, December 1996.
[6] Carter, Colin L. and Howard J. Hamilton, “Efficient Attribute-Oriented Generalization for Knowledge Discovery from Large Databases,” Member, IEEE Computer, Transactions on knowledge and data engineering, Vol 10, No. 2, March/April 1998.
[7] Germano Lanbert-Torres, Alexandre P. Alves da Silva, “Classification of Power Operation Point Using Rough Set Techniques,” IEEE 1996
[8] Germano Lanbert-Torres, Alexandre P. Alves da Silva, “Knowledge-Base Reduction Based on Rough Set Techniques,” IEEE 1996
[9]Shusaku Tsumoto, ” Automated Discovery of Positive and Negative Knowledge in Clinical Databases,” IEEE. Engineering in Medicine and Biology, July/August 2000
[10] Gary, Jim, Adam Bosworth, Andrew Layman and Hamid Pirahesh, “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals,” IEEE 1996.
[11] Han, Jiawei, Yandong Cai and Nick Cercone, “Knowledge discovery in databases: An attribute-oriented approach,” In Proc. 18th Int. Conf. Very Large Data Bases, Page 547-559, Vancouver, Canada, August 1992.
[12] Carter C.L. , Hamilton R. J. ,”Efficient attribute-oriented generalization for knowledge discovery from large databases,” Knowledge and Data Engineering, IEEE Transactions on,Volume: 10 Issue:2,March-April 1998,pp 193-208
[13] H. Lu, J.Han, and L. Feng,”Stock Movement and N-Dimensional Inter-Transaction Association Rules,” Proc. Of 1998 SIGMOD’96 Workshop on Research Issues on Data Mining and Knowledge Discovery(DMKD’98), Seattle, Washington, June 1998,pp12:1-12:7
[14] Robert H. Golan, Wojciech Ziarko,”A Mothodology for Stock Market Analysis utilizing Rough Set Theory”,IEEE 1995.
[15] Xiaohua Hu, Cercone H. ,”Mining knowledge rules from databases : a rough set approach,” Data Engineering,1996.Proceedings of the Twelfth International Conference on , 1996, pp96-105.
[16] Kaufman, L. and P. J. rousseeuw, “Finding Groups in Data : An Introduction to Cluster Analysis,” John Wiley and Sons, 1990.
[17] R. Agrawal,S. Ghosh,T. Imielinski,B. Iyer,A. Swami,”An Interval Classifier for Database Mining Application ,”Proc. Of 18th Int’l Conference onVery Large Databases,Vancouver,Aug. 1992,pp560-573
[18] J. Han,J. Pei, and Y.Yin,”Mining Frequent Patterns without Candidate Generation,” Proc. 2000 ACM-SIGMOD Int. Conf. On Management of Data(SIGMOD’00), Dallas,TX, May 2000
[19] Ng, R. and Jiawei Han , “Efficient and Effective Clustering Method for Spatial Data Mining,” Proc. Int’l Conf. Very Large Data Bases, pp. 144-155, Santiago, chile, Step. 1994.
[20].Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo,”Discovery of frequent episodes in event sequences,” Data Mining and Knowledge Discovery ,1(3) : pp259-289,Novermber 1997.
[21] Quinlan, J. Ross, “Simplifying Decision Trees,” Int. J. Man-Machine Studies, 27, 1987, pp. 221-234.
[22] Srikant, R. and R. Agrawal, “Mining Quantitative Association Rules in Large Relational Tables,” SIGMOD 1996, pp.1-12.
[23] Mohammed J. Zaki, Neal Lesh, Mitsunori Ogihara,”PlanMine : Predicting Plan Failures using Sequence Mining ,” Artifical Intelligence Review, special issue on the Application of Data Mining, 1999
[24]Jiawei Han, Micheline Kamber, ”Data Mining:Concepts and Techniques,”
[25]C.Bettini,X. S. Wang, S. Jajodia, J.-L. Lin, “Discovering frequent event patterns with multiple granularities in time sequences,” IEEE Trans. On Knowledge and Data Engineering, Volume: 10 Issue :2, 1998 ,pp. 222-237.
[26]George H. John,Stanford University and IBM Peter Miller,Lockhead Martin Corporation Randy Kerber, “Stock Selection Using Rule Induction,” IEEE, 1996
[27] B. Wuthrich,V. Cho, S. Leung, D. Permunetilleke, K. Sankaran, J. Zhang, W.Lam,”Daily Stock Market Forecast from Textual Web Data,”
[28]Brealey Myers, ”Principles of Corporate Finance,” McGraw-Hill
[29]陳智宗,陳振明,許秉瑜,”以資料挖礦法挖掘多屬性序列式資料規則之研究”,中大資管所碩士論文,民89
[30]何鄭陵,”證券投資-產經分析”,華泰書局,民76
[31]張振魁,陳稼興,”以類神經網路提高股票單日交易策略之獲利”,中大資管所碩士論文,民89 |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit