用户名: 密码: 验证码:
基于灰色系统理论的财务数据挖掘研究和应用
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
数据挖掘是目前发展极为迅速的一个研究领域,它综合了数学、统计学、数据库、模式识别、人工智能、最优化等多门学科,随着社会的发展,人们对数据的使用不再仅仅满足于普通的数据处理,而是希望能通过某种方法去挖掘深层次的、隐含的、有价值的东西,数据挖掘便是在这种条件下应运而生,并发展壮大起来的。
     本文所研究的中心是在灰色系统理论的基础上建立数据挖掘方法,结合财务分析知识,对已有的上市公司财务数据进行挖掘。在文中我们给出实例,并结合这些方法得出有关结论,并在计算机上予以实现。
     第—章:对数据挖掘进行综述,介绍数据挖掘的基本概念,介绍数据挖掘近期发展的研究方法和方向。
     第二章:介绍财务报表分析的基本概念和几种方法,详细介绍在财务比率分析中财务比率的计算及含义,为今后的挖掘做准备,考虑到数据挖掘的优点,还讨论了能够在财务数据中应用挖掘的几种方法。
     第三章:作为本文所讨论的重点,在给出灰色系统理论的有关概念后,结合财务比率知识,提出增长率挖掘和发展态势挖掘,评价上市公司的增长和发展状况,并讨论在财务数据中使用灰关联和灰聚类挖掘,得出财务比率间的关联和聚类状况。
     第四章:在这章里主要介绍软件实现方面的情况。
     第五章:总结全文,对数据挖掘进行展望。
Data mining is one of the research fields that are developing fast recently. It includes many subjects such as mathematics, statistics, databases, pattern recognition, artificial intelligence, optimization etc. With the development of the society, people are not satisfied with the ordinary processing about data and hope to get something deep, undiscovered and valuable information from data by some way. So, data mining emerges as the times require and develops gradually.
    The focus of this thesis is to put forward the methods based on gray system theory for data mining and to mine the financial data of the companies in the Chinese stock market along with the knowledge of financial analysis. We give some examples and obtain some results from them by using the methods. And the methods are performed in computer.
    Chapter 1: here we give an overall statement of data mining, including introduction of the basic concept, the methods and research branches up to the present etc.
    Chapter 2: before explaining the mining methods, we introduce the basic concept and methods for financial statement analysis, explicate the formulae and the meanings of financial ratios which are mentioned in the financial ratio analysis. Allowing for the advantages of data mining, we also discuss some other methods that can be applied to mine financial data.
    Chapter 3: after giving some related concept of gray system theory, we put forward the methods of the Growth Rate Mining and the Development Situation Mining to evaluate the companies' growth and development in some aspects. Then we carry out the gray association and the gray clustering on financial data to get knowledge about the association relations between financial variables and the clustering results among them.
    Chapter 4: The chapter mainly introduces how the mining system is implemented in software.
    Chapter 5: a conclusion about this thesis is made and the future expectation of data mining is discussed.
引文
[1] 郑之开,张广凡,邵惠鹤.数据采掘与知识发现:回顾与展望.信息与控制,1999,Vol.28 No.5:357~365.
    [2] M.-S. Chen, J. Han, P. S. Yu. Data Mining: An Overview from a Database Perspective. IEEE Trans. on Knowledge and Data Engineering, 1996, 8(6): 866~883.
    [3] R Agrawal, R Srikant. Fast Algorithms for Mining Association Rules in Large Databases. Proc. 20th Int'l Conf. VLDB, 1994: 487~499.
    [4] J.R. Quinlan. Induction of decision trees. Machine Learning, 1986: 81~106.
    [5] J.R. Quinlan. C4.5. Programs for Machine Learning, 1993.
    [6] M. Mehta, R. Agrawal, J. Rissanen. SLIQ: A fast scalable classifier for data mining. In: EDBT 96, 1996.
    [7] J. Shafer, R. Agrawal, M. Mehta. SPRINT: A scalable parallel classifier for data mining. In: Proc. 22nd VLDB, 1996.
    [8] R. Rastogi, K. Shim. PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning. In: Proc 24th VLDB, 1998: 404~415.
    [9] 虞险云等.关系表上基于相似关系的关联规则挖掘.计算机科学,1999,Vol.26 No.12:79~81.
    [10] 冯玉才,冯剑琳.关联规则的增量式更新算法.软件学报,1998,Vol.9 No.4:301~306.
    [11] 程继华,施鹏飞.快速多层次关联规则的挖掘.计算机学报,1998,Vol.21 No.11:1037~1041.
    [12] R. Srikant, R. Agrawal. Mining generalized association rules. In: Proc. 21st VLDB, 1995: 407~419.
    [13] 梁曼君,张瑞,熊范纶.从数据库中发掘定量型关联规则.计算机科学,1999,Vol.26 No.8:71~73.
    [14] 张继福等.基于多交易项目子集的并集的关联规则更新采掘.计算机工程,2000,Vol.26 No.1:71~73.
    [15] D.W. Cheung. Maintenance of Discovery Association Rules in Large Database: An Incremental Updating Technique. In: Proc. 12th ICDE, 1996: 106~114.
    [16] 肖利等.一种新的挖掘广义关联规则算法.东南大学学报,1997,Vol.27 No.6:76~81.
    [17] 欧阳为民,蔡庆生.基于时间窗口的增量式关联规则更新技术.软件学报,1999,Vol.10 No.4:426~429.
    [18] 涂星原.基于数值属性的关联规则的挖掘.郑州工业大学学报,1998,Vol.19 No.3:72~75.
    [19] 胡和平,方正江.量化关联规则的模糊方法开采.计算机工程与科学,1999,Vol.21 No.4:83~87.
    [20] 程继华,魏暑生,施鹏飞.基于概念的关联规则的挖掘,郑州大学学报,1998,Vol.30 No.2:27~30.
    [21] 欧阳为民,蔡庆生.基于垂直数据分布的关联规则高效发现算法.软件学报,1999,Vol.10 No.7:754~760.
    [22] 肖利等.基于多维标度的快速挖掘关联规则算法.软件学报,1999,Vol.10 No.7:749~753.
    [23] 李力,朱天翔,许占文.关系数据库多项集关联规则挖掘的探讨,沈阳工业大学学报,1998,Vol.20 No.5:26~29.
    [24] 程继华,施鹏飞.关联规则的递增修正.上海交通大学学报,1998,Vol.32 No.8:137~139.
    [25] 周海岩.关联规则的开采与更新.软件学报,1999,Vol.10 No.10:1078~1084.
    [26] 肖利等.挖掘转移规则:一种新的数据挖掘技术.计算机研究与发展,1998,Vol.35 No.10:902~906.
    [27] 铁冶欣,陈奇,俞瑞钊.采掘关联规则的高效并行算法.计算机研究与发展,1999,Vol.36 No.8:948~952.
    [28] R.Agrawal et at. Parallel Mining of Association Rules. IEEE Trans on Knowledge and Data Engineering, 1996, 8(6): 962~969.
    [29] J.S. Park et al. Efficient Parallel Data Mining for Association Rules. In: Proc. 4th Int'l Conf, Information and Knowledge Management, 1995.
    
    
    [30] 张朝晖,陆玉昌,张钹.发掘多值属性的关联规则.软件学报,1998,Vol.9 No.11:801~805.
    [31] 丁祥武.挖掘关联规则的一种预处理:合并交易.中南民族学院学报,1999,Vol.18 No.3:21~25.
    [32] 程继华,施鹏飞.多层次关联规则的有效挖掘算法,软件学报,1998,Vol.9 No.12:937~941.
    [33] 张继福,刘静,张荣国.适用于动态交易数据库的关联规则更新算法.计算机应用,1999,Vol.19 No.10:158~160.
    [34] J. Park, M. Chen, P. Yu. An effective hash based algorithm for mining association rules. In: Proc. ACM SIGMOD Int'1 Conf. on Management of Data, 1995, 175~186.
    [35] Han Jia-wei, Fu Yong-jian. Discovery of multiple-level association rules from large databases. In: Proc. 21st VLDB, 1995: 420~431.
    [36] 张朝晖,陆玉昌,张钹.利用神经网络发现分类规则.计算机学报,1999,Vol.22 No.1:108~111.
    [37] 马建军,陈文伟.基于集合理论的KDD方法.计算机应用研究,1997第3期:20~23.
    [38] 舒骋,陈笑蓉,王翰虎.KDD 的最小化与最大化分类规则及其实现算法.计算机应用,1999,Vol.19 No.10:163~165.
    [39] 仇春光,刘玉树.自动生成决策树的通用算法模板.北京理工大学学报,1999,Vol.19 No.3:338~342.
    [40] 肖勇,陈意云.用遗传算法构造决策树.计算机研究与发展,1998,Vol.35 No.1:49~52.
    [41] 王熙照,洪家荣.区间值属性决策树学习算法.软件学报,1998,Vol.9 No.8:637~640.
    [42] 黄冬梅,高印芝.模糊决策树归纳算法及应用.河北师范大学学报(自然科学版),1999,Vol.23 No.2:173~176.
    [43] 刘小虎,李生.决策树的优化算法.软件学报,1998,Vol.9 No.10:797~800.
    [44] 陈恩红,王清毅,蔡庆生.基于决策树学习中的测试生成及连续属性的离散化.计算机研究与发展,Vol.35 No.5:403~407.
    [45] M. Ester, H.-P. Kriegel, X. Xu. Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification. In: Proc 4th Int. Symp. on Large Spatial Databases, 1995, 67~82.
    [46] R.T. Ng, J. Han. Efficient and Effective Ciustering Methods for Spatial Data Mining. In: Proc. 20th VLDB, 1994: 144~155.
    [47] R. Sibson. SLINK: an optimally efficient algorithm for the single-link cluster method. The Computer Journal, 1973, Vol. 16 No.1: 30~34.
    [48] A. Bouguettaya. On-Line Clustering, IEEE Trans on Knowledge and Data Engineering, 1996, Vol.8 No.2: 333~339.
    [49] T. Zhang, R. Ramakrishnan, M. Linvy. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996: 103~114.
    [50] M. Ester, H.-P. Kriegel, J. Sander, X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, 1996: 226~231.
    [51] M. Ester, H.-P. Kriegel, J. Sander, X. Xu. Incremental Clustering for Mining in a Data Warehousing Environment. In: Proc. 24th VLDB, 1998: 323~333.
    [52] 刘思峰,郭天榜.灰色系统理论及其应用.河南大学出版社,1991.
    [53] 曹鸿兴,郑耀文,顾今.灰色系统理论浅述.气象出版社,1988.
    [54] 葛家澍.中级财务会计,辽宁人民出版社,1994.
    [55] 周水庚,周傲英,曹晶,胡运发.一种基于密度的快速聚类算法.计算机研究与发展,2000.Vol.37 No.11:257~262.
    [56] 暴奉贤,陈宏立.经济预测与决策方法.暨南大学出版社,1991.
    [57] 何晓群,回归分析与经济数据建模.中国人民大学出版社,1997.
    
    
    [58] 叶武,基于人工神经网络的银行客户信用评价系统的研究,厦门大学硕士学位论文,2000.
    [59] 齐治昌,谭庆平,宁洪.软件工程.高等教育出版社,1997.
    [60] 徐国祥,檀向球,胡穗华.上市公司经营业绩综合评价及其实证研究.统计研究,2000.No.9:44~51.
    [61] 财政部统计评价司.企业效绩评价问答.经济科学出版社,1999.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700