Monotonic Vector Space Model and Its Partition Algorithms
This paper presents a model: monotonic vector space (MVS). It is a special vector space where there exist some monotonic functions. the model have wide application in image processing,system capability engineering etc. This paper mainly deal with the requirement-based partition operation in MVS and two algorithms are proposed. one is for the continuous MVS,another is for discrete type. The algorithm for partition of continuous MVS is based on hyperbox approximation. The algorithm for partition of discrete MVS is based on greedy tactics. The two algorithms could partition MVS with high efficiency based on specified requirements.
Monotonic vector space Hyperbox approximation Greedy tactics Partition algorithm
Hu Jianwen Hu Xiaofeng Zu Shuguang Si Guangya
Strategy Simulation Teaching Department, National Defense University, Beijing 100091, China
国际会议
第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)
武汉
英文
353-358
2007-08-03（万方平台首次上网日期，不代表论文的发表时间）