期刊文献+

基于流图的新型规则推理网络研究及应用

Non-linear Correlation Discovery-based Algorithm in Data Mining
下载PDF
导出
摘要 本文提出了一种基于流图(flow graph)的新型数据挖掘技术,用于数据中的规则提取以及推理,并且首次将该技术应用到商业银行信用风险决策中,通过数据实验证实了它的有效性。 In this paper, we presente a novel datamining method of flow graph-based rules referring network in the field of credit risk evaluation and the optimal portfolio, and study the reference character of the flow graph, then put out its application into the real data compared with recently neural network, getting outstanding achiecement.
出处 《计算机科学》 CSCD 北大核心 2006年第11期177-179,209,共4页 Computer Science
基金 广东省科技基金项目(No.2005B10101033 2004A10202001)
关键词 数据挖掘 流图 规则推理 风险决策 Data mining, Flow graph, Credit risk decision
  • 相关文献

参考文献8

  • 1Bahensperger E. Credit rationing: issues and questions [J].Journal of Money, Credit and Banking, 1978, 10:170-183
  • 2王春峰,万海晖,张维.基于神经网络技术的商业银行信用风险评估[J].系统工程理论与实践,1999,19(9):24-32. 被引量:193
  • 3Rudy S, James Y L. Thong, An approach to generate rules from neural networks for regression problems [J]. European Journal of Operational Research, 2004,155: 239-250
  • 4Pawlak Z. Flow graphs and data mining [J]. Transactions onRough Sets Ⅲ, LNCS 3400, 2005. 1-36
  • 5刘博,郑启伦,彭宏.基于非线性相关发现的数据挖掘算法[J].计算机应用研究,2007,24(3):47-49. 被引量:1
  • 6Bo L, Qilun Zh, Hong P. A Novel Arithmetic of Holistic Correlation Analysis [J]. In:The Proceeding of the Fourth International Conference on Machine Learning and Cybernetics, August 2005.2145-2150
  • 7Bondy J A, Murty M S R. Graph Theory With Applications [M].The Macmillan Press Ltd, 1976
  • 8Bankruptcy Creditors' Service Inc. http://bankrupt. com. [DB/OL]

二级参考文献16

  • 1世界银行.新兴市场经济中的商业银行[M].北京:中国财政经济出版社,1994..
  • 2曾国坚,银行风险论,1995年
  • 3世界银行,新兴市场经济中的商业银行,1994年
  • 4施鸿宝,神经网络及其应用,1993年
  • 5张尧庭,多元统计分析引论,1982年
  • 6BRIN S, MOTWANI R, ULLMAN J D, et al. Dynamic itemset counting and implication rules for market basket data:proceedings of ACM SIGMOD International Conference on Management of Data,May, 1997 [ C ]. Tucson: AC M Press, 1997 : 255- 264.
  • 7HAN J, PEI J, YIN Y. Mining frequent patterns without candidate generation:proceedings of ACM SIGMOD International Conference on Management of Data, May ,2000 [ C ]. Dallas : ACM Press,2000 : 1-12.
  • 8BURDICK D, CALIMLIM M, GEHRKE J. MAFIA:a maximal frequent itemset algorithm for transactional databases:proceedings of International Conference on Data Engineering, HeideIberg, Germany,April,2001 [ C ]. [ S. I. ] : [ s. n. ] ,2001:443-452.
  • 9ZAKI M J, GOUDA K. Fast vertical mining using diffsets: proceedings of the Nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D. C. [ C ]. New York : ACM Press,2003:326-335.
  • 10SONG Mingjun, RAJASEKARAN S. Finding frequent itemsets by transaction mapping:2005 ACM Symposium on AppIied Computing,New Mexico, USA,2005 [ C]. [ S. 1. ] : [ s. n. ] ,2005:488-492.

共引文献192

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部