An optimization algorithm for clustering using weighted dissimilarity measures

One of the main problems in cluster analysis is the weighting of attributes so as to discover structures that may be present. By using weighted dissimilarity measures for objects, a new approach is developed, which allows the use of the k-means-type paradigm to efficiently cluster large data sets. The optimization algorithm is presented and the effectiveness of the algorithm is demonstrated with both synthetic and real data sets.     

用于文本分类的特征项权重算法改进

TF-IDF算法是文本分类中一种常用的权重计算方法,但是TF-IDF仅仅考虑了特征项在文本中出现的次数以及该特征项在训练集中的出现频率,没有考虑特征项在各个类间的分布情况及特征项的语义信息。因此针对TF-IDF的不足提出了一种改进的TF-IDF算法,此算法既考虑了特征项在类内的分布情况又考虑了特征项的位置及长度等语义因素,能更好地反映特征项的重要性。用朴素贝叶斯分类器验证其有效性,实验结果表明该算法优于TF-IDF算法,能较好地提高文本分类的准确率。     

一种在矩阵空间中识别文本蕴涵的动态交互网络

针对文本蕴涵问题提出一种动态交互网络（dynamic interactive network,DIN）进行识别。不同于已有交互模型,DIN将两句词向量投射到二维矩阵空间中进行交互,然后利用输出矩阵为同时处理上下文信息和控制信息流动的GRU编码器生成动态权重。前者通过更高阶形式的信息交互挖掘深层逻辑片段,后者通过改变交互信息与上下文信息的结合模式帮助编码器有效区分两者的重要性差异。模型在SNLI测试集上获得了88.0%的识别准确度,超过已有的最佳模型,且使用的训练参数仅为它的一半。     

An extended minimax disparity to determine the OWA operator weights

This paper contributes to extend the minimax disparity to determine the ordered weighted averaging (OWA) model based on linear programming. It introduces the minimax disparity approach between any distinct pairs of the weights and uses the duality of linear programming to prove the feasibility of the extended OWA operator weights model. The paper finishes with an open problem.     

基于云模型和余弦跳跃权重的改进蛙跳算法

标准蛙跳优化算法(SFLA)有寻优精度低和易陷入局部收敛区域的缺点, 为提高其性能, 提出一种基于云模型局部搜索和余弦跳跃权重更新位置的改进蛙跳算法(CSFLA). 首先通过Tent混沌映射和反向学习生成种群, 使种群的分布更均匀, 利用云模型的正态特性对子群中的优秀个体的所在区域进行探索. 同时, 对种群中其他个体引入基于余弦函数的跳跃步长权重, 使该权重在整个迭代过程中由高以不同的速率下降, 提高种群的全局搜索能力. 最后, 将CSFLA与多个优化算法在不同类型的测试函数上进行了比较. 结果表明, CSFLA具有更好的收敛速度和精度, 能有效找出全局最优解. 并且将改进算法应用至旅行商问题, 该算法可以找到总路程更短的路线.     

Modified multi-layered perceptron applied to packing and covering problems

Prior knowledge of the input–output problems often leads to supervised learning restrictions that can hamper the multi-layered perceptron’s (MLP) capacity to find an optimal solution. Restrictions such as fixing weights and modifying input variables may influence the potential convergence of the back-propagation algorithm. This paper will show mathematically how to handle such constraints in order to obtain a modified version of the traditional MLP capable of solving targeted problems. More specifically, it will be shown that fixing particular weights according to prior information as well as transforming incoming inputs can enable the user to limit the MLP search to a desired type of solution. The ensuing modifications pertaining to the learning algorithm will be established. Moreover, four supervised improvements will offer insight on how to control the convergence of the weights towards an optimal solution. Finally, applications involving packing and covering problems will be used to illustrate the potential and performance of this modified MLP.     

快速校准装置在料斗秤检定/校准中的应用

通过应用DJY型料斗秤快速校准装置代替砝码对料斗秤进行检定/校准,不但解决了一直以来无法对料斗秤大量程段进行检定/校准的难题,确保了料斗秤全量程的计量准确,而且使员工从繁重的劳动中解脱出来,提高了工作效率,降低了成本,值得推广.     

案例推理属性权重的分配模型比较研究

案例推理系统中各属性权重的赋值决定了案例之间的相似度 大小,进而对推理结果的正确与否产生显著影响.以属性加权K-最近邻 相似案例检索为基础,讨论了使用注水原理分配属性权重的机理,并通过建 立权重分配的合理性指标,构造拉格朗日函数对权重进行优 化求解,得到了收敛的注水分配算法.通过五折交叉的模式分类实验 ,分别对属性权重的平均分配法、注水分配算法和遗传算法分配法进行了比较研究,案例推理分类结果证明,在引入注水分配算法后,其分类性能得到有效改善.     

Deriving the priority weights from hesitant multiplicative preference relations in group decision making

In this paper, we investigate the deviation of the priority weights from hesitant multiplicative preference relations (HMPRs) in group decision-making environments. As basic elements of HMPRs, hesitant multiplicative elements (HMEs) usually have different numbers of possible values. To correctly compute or compare HMEs, there are two principles to normalize them, i.e., the α-normalization and the β-normalization. Based on the α-normalization, we develop a new goal programming model to derive the priority weights from HMPRs in group decision-making environments. Based on the β-normalization, a consistent HMPR and an acceptably consistent HMPR are defined, and their desired properties are studied. A convex combination method is then developed to obtain interval weights from an acceptably consistent HMPR. This approach is further extended to group decision-making situations in which the experts evaluate their preferences as several HMPRs. Finally, some numerical examples are provided to illustrate the validity and applicability of the proposed models.