摘要
本文一方面提出了灰信息的可信度概念及计算公式,另一方面.提出了灰信息的正、反面信息截集概念,并在此基础上提出并证明了灰信息的分解定理。
The concept of faith degree of grey information and its calculating formulas were given when the concept of cut sets in the obverse and the reverse of grey information was presented. The on which decomposition theorem of grey information was presented and proved on this basis.
出处
《兰州铁道学院学报》
1995年第1期109-115,共7页
Journal of Lanzhou Railway University
关键词
灰信息
灰信息可信度
加权可信度
截集
grey information
faith degree of grey information
weighted faith degree
cut sets