Study on affine property of some algorithms for grey relational analysis

Author

Jie, Cui ; Yao-guo, Dang

Author_Institution

Sch. of Econ. & Manage., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China

fYear

2009

fDate

10-12 Nov. 2009

Firstpage

52

Lastpage

56

Abstract

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. On the basis of analysis on the existing models for grey relational analysis and their properties, this paper first presents the novel definition of affinity for grey relational model. Secondly, the affine property of some models for grey relational analysis is studied. Finally, the study result indicates 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.

Keywords

grey systems; affine property; control; decision making; grey T-mode relational analysis; grey clustering; grey relational analysis; Algorithm design and analysis; Clustering algorithms; Decision making; Economic forecasting; Engineering management; Extraterrestrial measurements; Intelligent systems; Mathematical model; Prototypes; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Grey Systems and Intelligent Services, 2009. GSIS 2009. IEEE International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4244-4914-9

Electronic_ISBN

978-1-4244-4916-3

Type

conf

DOI

10.1109/GSIS.2009.5408350

Filename

5408350