Study on Affine Property of Some Algorithms for Grey Relational Analysis

摘要：

The grey relational analysis is an important branch of grey system theory. It is the foundation of grey clustering, decision-making, and control. The aim of this paper is to further study the properties of algorithms for grey relational analysis. Based on analyzing of the existed model for grey relational analysis and their properties, this paper firstly pioneers the novel definition of affinity of grey relational model. Secondly, the affine property of some models for grey relational analysis is studied. Finally, the study result shows that the algorithm for grey T-mode relational analysis and the algorithm for grey rate relational analysis are of affinity. This result may enrich the theoretical system of grey relational analysis.

作者: Cui Jie Dang Yao-guo

作者单位: School of Economics and Management,Nanjing University of Aeronautics and Astronautics

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)

会议地点: 南京

会议语种:英文

页码: 52-56

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）