Simplified Computation for a Kind of Improved Generalized Absolute Grey Relational Grade

摘要：

Cao Ming-xia and Dang Yao-guo et al (2007) proposed an improved generalized absolute grey relational grade to measure the similarity between two sequences based on the area of the plane region enclosed by two polygonal lines. This algorithm needs to compute the equations of straight lines and intersection points of straight lines and integrals, the computation process is time-consuming. In order to improve the computation efficiency, properties of parallel straight lines and similar triangles are employed to generate a new approach to compute the area directly by using the original value of sequences, which needn’t to compute the intersection points and so simplified Cao and Dang’s computation.

作者: Chen Yong-ming Dai Qi-hua

作者单位: College of Mathematics, Chengdu University of Information Technology, Chengdu, 610225, China

会议类型: 国际会议

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

会议地点: 南京

会议语种:英文

页码: 67-71

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