首页> 外文会议>Grey Systems and Intelligent Services, 2009. GSIS 2009 >Simplified computation for a kind of improved generalized absolute grey relational grade
【24h】

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

机译:一种改进的广义绝对绝对灰色关联度的简化计算

获取原文

摘要

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.
机译:曹明霞,党耀国等。提出了一种改进的广义绝对灰色关联度,用于基于两条多边形线包围的平面区域的面积来测量两个序列之间的相似度。该算法需要计算直线方程以及直线与积分的交点。而且计算过程很耗时。为了提高计算效率,利用平行直线和类似三角形的性质,产生了一种新的方法,即使用序列的原始值直接计算面积,而无需计算交点并简化了曹和D的计算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号