检索结果-内蒙古大学图书馆

A DAG-based algorithm of mining frequent closed itemsets in high dimensional datasets

International Journal of Advancements in Computing technology 2012年第19期4卷 213-222页

作者： Dong, Jun Chen, Shuai Chen, Jing Huang, Guoyan Ren, Jiadong College of Information Science and Engineering Yanshan University 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China Production Management Department Shanghai Aircraft Manufacturing Co.Ltd 200436 China

Algorithms based on row enumeration always scan and construct conditional transposed tables, which increases the execution time and space cost. To address this problem, we adopt the DAG (Directed Acyclic Graph) to compress the dataset to save the memory space. In DAG, each node is related to a rowid, and each two nodes have a corresponding directed edge which stores the common items of the two rowids. Each row is given an integer according to its coming order and the DAG follows that order. A directed acyclic graph records the relation between rows and items by doing AND(&) operation with the nodes' binary code of the edges. We also present DAGHDDM which is a new approach for mining frequent closed itemsets in high dimensional datasets. In this algorithm, we adopt the BitTable to compress the dataset firstly, and then construct DAG according to the BitTable. We increase the same items of the adjacent edges to implement pattern growth, traverse the DAG in reversal way and adopt a close-checking method to generate all frequent closed itemsets. It scans the dataset only once and does not generate candidate itemsets. The experimental results show that the proposed DAGHDDM algorithm can decrease the cost of time.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Point cloud coarse matching method for similar objects

引用

ICIC Express Letters 2016年第9期10卷 2283-2289页

作者： Zhao, Qiang Guo, Xijuan Zhang, Buying Bai, Xinyu Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China Technical Center Shenyang Aircraft Corporation Shenyang110850 China

Point cloud matching is much more difficult when an initial estimate of the relative pose is not known. In order to reduce the effect of relative pose on matching operation and improve the computing speed, this article presents a method to fast match the pose of two similar objects through the covariance of their point cloud coordinates. This paper contains three parts. In the first part, a matrix is constructed through the values of point coordinates of one object and then a set of orthogonal vectors will be obtained through eigenvector of the matrix. Rotation matrix will be obtained by comparing the vectors of two similar objects. In the second part, a description of procedures is given and the complexity of the algorithm is analyzed. In the last part, the experiment shows the proposed method has high computing efficiency and the matching results are acceptable. © 2016 ICIC International.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Skin panel design for a morphing mechanism

引用

ICIC Express Letters, Part B: Applications 2016年第10期7卷 2161-2167页

作者： Zhao, Qiang Guo, Xliuan Xi, Fengfeng Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China Department of Aerospace Engineering Ryerson University TorontoONM5B 2K3 Canada

A segmentation method is proposed to aid rigid skin panel design for an existing modular morphing wing mechanism. The method divides the surface of the modular morphing mechanism into panels through geometry discretization, and then the skin which is made up of these rigid panels will have better rigidity and it will morph more free without any gap. The method comprises three basic morphing types based on the motion of upper platform. Wherein, the mechanism side is firstly divided into a plurality of panels and each of them is approximated to flat, and then shape changes of one panel before and after morphing are analyzed. Therefore, panels can be designed as moveable and fixed patches to achieve seamless morphing. At last, computer simulation is set up to further verify the correctness of the method. © 2016 ICIC International.

关键词： Morphing mechanism Seamless morphing Skin panel Surface segmentation

来源：评论

学校读者我要写书评

暂无评论

Minkowski sum modeling of polyhedra based on VRML

引用

ICIC Express Letters 2013年第2期7卷 455-460页

作者： Zhang, Jianfei Guo, Xijuan Geng, Qingjia Information Science and Engineering College Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China Computer and Control Engineering College Qiqihar University No. 42 Wenhua Street Qiqihar 161006 China

On the basis of the introduction to basic methods of the geometry modeling based on virtual reality modeling language (VRML) and the concepts of Minkowski sum computation of polyhedra, we present a method of Minkowski sum computation and three dimensional modeling based on VRML. The method can simplify Minkowski sum computation of general polyhedra, and experimental results indicate that this method can calculate Minkowski sum of general polyhedra much faster and realize three-dimensional representation more accurately. This method can provide important technical references for Minkowski sum visualization of polyhedra. © 2013 ISSN 1881-803X.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

An improved community discovery algorithm in weighted social networks

引用

ICIC Express Letters 2016年第1期10卷 35-41页

作者： Guo, Jingfeng Liu, Miaomiao Liu, Linlin Chen, Xiao College of Information Science and Engineering Yanshan University No. 438 West Hebei Ave Qinhuangdao China College of Information Science and Engineering Northeast Petroleum University No. 199 Fazhan Road Daqing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 West Hebei Ave Qinhuangdao China

The algorithm AGMA (Automatic Graph Mining Algorithm) is improved and a novel community discovery algorithm, namely CRMA (Clustering Re-clustering Merging Algorithm) is proposed which can realize more reasonable community division for weighted social networks. Firstly, in the re-clustering stage, AGMA neglected the clustering situation of neighbors of current node and it did not take the weights of edges connecting the current node and its unclustered neighbors into account, which led to that some nodes cannot be clustered or their clustering was unreasonable. Aiming to this, the concept of the connection compactness between the node and the community is introduced, and then through clustering and re-clustering each node would be divided into the community that has the largest connection compactness with the node according to the node weight, the edge weight and the friend coecient between the node and the community. Secondly, for community division in some unweighted networks and signed networks, if there are many nodes whose clustered neighbors are less than its unclustered neighbors, the division results of AGMA tend to result in the lower modularity. In view of this problem, the concepts of positive edge weight density, the cluster density and the connection coecient between clusters are proposed. Lastly, communities are merged based on the above three concepts after re-clustering and the modularity is eectively enhanced. The higher correctness and better generality of the improved algorithm are veried through experiments. © 2016 ICIC International.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Geometric algebra support vector machine for pattern recognition

引用

ICIC Express Letters 2013年第3 B期7卷 1031-1035页

作者： Wang, Jinjia Zhang, Cuihua Lu, Haitao Hong, Wenxue College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Electrical Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

Geometric algebra is the promotion of real, complex, quaternion, and has been successfully applied in physics, computer graphics, and other fields. The support vector machine (SVM) has been successfully used in the field of pattern recognition. On the basis of the Clifford support vector machine (CSVM), we improve support vector machine based on the principle of geometric algebra. We research the key technologies in training. The experimental results of the Iris data and Breast Cancer data set prove our ideas, and the correct recognition rates are 96% and 97.8%. © 2013 ICIC International.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A study on the influence propagation model in topic attention networks

引用

International Journal of Performability Engineering 2017年第5期13卷 721-730页

作者： Chen, Xiao Guo, Jingfeng Tian, Kelun Fan, Chaozhi Pan, Xiao College of Information Science and Engineering YanShan University Qinhuangdao066004 China Qian'An College North China University of Science and Technology Qian'an064400 China College of Economic and Management Shijiazhuang Tiedao University Shijiazhuang050043 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China

The social networks with the complex user relations and huge amount of data and hidden information, bring new opportunities and challenges for the study of information diffusion and influence maximization. In recent years, there are more and more researches on the influence maximization of topic preference. However, most of the existing researches only take the topic as an attribute of the users, and the importance of the topic in network structure is not considered. In view of this situation, firstly, this paper constructed a new topic attention network model fusing the social relation and the topic preference. Secondly, based on connected degree of set pair and Markov random walk model, we propose the calculated method of the topic preference for users, and then mining the seed set with influence by the greedy strategy. Thirdly, we propose the calculated method of the activation probability of the user based on the user relation and the topic preference, and propose the influence maximization algorithm TAN-CELF in topic attention networks. Finally, on Dou-ban network dataset, from three metrics ISST, ISRT and ISRNT, compare with algorithm L-GAUP and CELF, the experimental results show that algorithm TAN-CELF that is proposed by this paper has a higher performance on influence scope. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Directional relation reasoning based on boundary sensitive model in three-dimensional space

引用

Journal of Computational Information systems 2015年第17期11卷 6345-6354页

作者： Kong, Dehan Liu, Yongshan Ma, Junlei Wang, Yuzheng Han, Ameng Department of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Data Industry Research Lab Qinhuangdao China Telecommunications Engineering with Management Beijing University of Posts and Telecommunications Beijing China Information Technology Office of Yanshan University Qinhuangdao China

In three-dimension space, with the minimum bounding rectangular (MBR) of any type of object's projections in xoy and xoz planes, there are four possible types of projection: minimum bounding rectangular, horizontal line, vertical line and point, then a boundary sensitive directional relationship matrix model (BSDRM) is proposed, the model can unified representation direction relations between objects of the four different types of projection, further, the three dimensional direction relation is inferred by combining the two direction matrixes in plane xoy and plane xoz. Based on this model, single direction relation reasoning table and multi direction relation reasoning method are proposed. Finally, direction relation reasoning arithmetic is given and proved to be true. © 2015, by Binary Information Press

关键词： Boundary Sensitive Combinative Reasoning Table Directional Relationship Matrix Model Relationship Reasoning Three-dimension Directional

来源：评论

学校读者我要写书评

暂无评论

A Recurrence method of attribute reduction based on rough set

引用

ICIC Express Letters 2013年第3 B期7卷 1025-1030页

作者： Zhang, Tao Lu, Jing Chen, Nan Gao, Zhi College of Information Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Foreign Languages Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Institute of Electrical Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

According to the classical rough set, the attribute reduction set may be far from satisfactory due to the non-existence of core in the attribute reduction process of decision table. Aiming at this issue, this paper puts forward a recurrence method of attribute reduction;first find out the starting attributes with the highest division as the basic one, and then add the remaining attributes gradually to refine the undivided equivalence class until the non-existence of the samples which must be separated. The paper theoretically proved the relation between the traditional method and recurrence method of attribute reduction on the existence of core. The reliability of the new method was analyzed and illustrated by experiments. © 2013 ICIC International.

关键词： Decision tables

来源：评论

学校读者我要写书评

暂无评论

Rain scenes rendering algorithm combining metaball with mass-spring surface

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and technology Edition) 2013年第SUPPL.1期43卷 230-234页

作者： Lyu, Meng-Ya Zheng, Xuan Tang, Yong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao 066004 China

To solve the problems such as unreal effects, incomplete details in the rain scene, an algorithm to simulate water surface after rain hitting by combining Meatball with mass-spring water surface was presented. First, the raindrops model was estabished with particle system combining textures, and the water surface model was established with the mass-spring model. Secondly, the algorithm animated half globular bubbles after rain hitting with Meatball. Thirdly, water splash was simulated by means of the particle system and a gradual thinning and syncretizing technique. Finally, with the help of Cg language, the reflection and the refraction effect on the water surface, globular bubbles and water splash were simulated. The experiment shows that this approach can be used to simulate rain scenes efficiently and realistically.

关键词： Rain

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：