Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q ...Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.展开更多
为解决现有k-modes聚类方法因忽略了变量属性之间的弱相关性,常造成其在实际应用中聚类性能不佳的问题,提出一种包含属性弱相关性的新k-modes聚类方法。引入最大信息系数(maximum information coefficient,MIC)度量数据集中变量属性之...为解决现有k-modes聚类方法因忽略了变量属性之间的弱相关性,常造成其在实际应用中聚类性能不佳的问题,提出一种包含属性弱相关性的新k-modes聚类方法。引入最大信息系数(maximum information coefficient,MIC)度量数据集中变量属性之间的相关性;将得到的MIC值与原有距离进行融合,建立包含属性弱相关性信息的新度量方法,以增强变量属性间相关信息的完备性,建立更加精细的k-modes聚类方法;调用3种不同的数据集,将新方法与原有的k-modes聚类方法和其他改进k-modes聚类方法的性能进行对比,并通过仿真结果表明了新方法的有效性。展开更多
文摘Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.
文摘为解决现有k-modes聚类方法因忽略了变量属性之间的弱相关性,常造成其在实际应用中聚类性能不佳的问题,提出一种包含属性弱相关性的新k-modes聚类方法。引入最大信息系数(maximum information coefficient,MIC)度量数据集中变量属性之间的相关性;将得到的MIC值与原有距离进行融合,建立包含属性弱相关性信息的新度量方法,以增强变量属性间相关信息的完备性,建立更加精细的k-modes聚类方法;调用3种不同的数据集,将新方法与原有的k-modes聚类方法和其他改进k-modes聚类方法的性能进行对比,并通过仿真结果表明了新方法的有效性。
