Partial Ordered of Interval Grey Number and Its Application
This paper is concerned with the question of ranking a finite interval grey number set. A method is proposed which is based on Hasse diagram technique (HDT) for partial order ranking and its linear extension decision tree. The main idea is firstly to identify the Hasse diagram of the interval grey sequence and obtain its linear extension decision tree, secondly to accumulate rank frequency for each element. To determine the rank of elements, this paper proposes a new method which uses total area of accumulate function, and for the first time the methods is applied on grey relational analysis, whose sequences contain interval grey number or interval grey number and precision number mixed-emergence. At last, an example shows this method is effective in grey relational analysis.
Yinian Li Shuhua Mao
College of Science, Wuhan University of Technology,Wuhan 430063, PRC
国际会议
2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)
南京
英文
1070-1074
2009-10-20(万方平台首次上网日期,不代表论文的发表时间)