Simplified computation for a kind of improved generalized absolute grey relational grade

Author

Yong-ming, Chen ; Qi-hua, Dai

Author_Institution

Coll. of Math., Chengdu Univ. of Inf. Technol., Chengdu, China

fYear

2009

fDate

10-12 Nov. 2009

Firstpage

67

Lastpage

71

Abstract

Cao Ming-xia and Dang Yao-guo et al. 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. And 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 values of sequences, which needn´t to compute the intersection points and simplifies Cao and Dang´s computation.

Keywords

computational geometry; grey systems; integral equations; computation efficiency; generalized absolute grey relational grade; integral; parallel straight line; plane region; polygonal line; similarity measure; Area measurement; Concurrent computing; Information technology; Integral equations; Intelligent systems; Mathematics; Problem-solving; Shape;

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.5408349

Filename

5408349