From the view of description complexity, this paper proposes a new optimization learning algorithm.
从描述复杂性的角度出发，提出了一种新的优化学习算法。
The theory of description complexity considers that the description with the minimum length could reveal the essence of the whole data set.
描述复杂性理论认为，一个数据集的最小长度描述最能体现出这个数据集的本质规律。
Because of the complexity and uncertainty inherent in spatial problems, the description of the spatial relationship often adopts qualitative methods.
由于空间问题固有的复杂性和不确定性，空间关系的描述普遍采用定性的方法。
应用推荐