Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On grey relational mapping

On grey relational mapping This paper discusses the operation of grey relational mapping. We define the equivalent characteristics of relational mapping and the generating relational order. We prove that if the relational mappings are finite, then their maximum, minimum value, weighted average and product function are also relational mappings. The necessary and sufficient condition that two relational mappings are equivalent is that they can be generated by each other by monotonic increasing functions. We put forward the principle of optimum relational order to obtain a better method to carry out the relational analysis. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGSMALL/PC Notes Association for Computing Machinery

On grey relational mapping

Wang, Shuze; Liu, Xiqiang
ACM SIGSMALL/PC Notes , Volume 20 (3) – Jan 1, 1995
Download PDF
4 pages

Loading next page...
 
/lp/association-for-computing-machinery/on-grey-relational-mapping-if8wW6qF5G

References (4)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1995 by ACM Inc.
ISSN
0893-2875
DOI
10.1145/202081.202085
Publisher site
See Article on Publisher Site

Abstract

This paper discusses the operation of grey relational mapping. We define the equivalent characteristics of relational mapping and the generating relational order. We prove that if the relational mappings are finite, then their maximum, minimum value, weighted average and product function are also relational mappings. The necessary and sufficient condition that two relational mappings are equivalent is that they can be generated by each other by monotonic increasing functions. We put forward the principle of optimum relational order to obtain a better method to carry out the relational analysis.

Journal

ACM SIGSMALL/PC Notes – Association for Computing Machinery

Published: Jan 1, 1995

There are no references for this article.