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

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

Journal of Convergence Information technology 2012年第21期7卷 467-476页

作者： Huang, Guoyan Chen, Shuai Ren, Shenyuan Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China College of Computer Science Sichuan University Chengdu Sichuan 610000 China

In order to fully utilize the minimum support threshold to prune the rowset search space and avoid scanning the whole dataset in close-checking, we proposed two new data structure, Rowset-Itemset-Hybrid-Search-Tree (RIHS-Tree) and Frequent-Closed-Itemset-Rowset-Tree (FCIR-Tree). The former stores the rowsets which share common rowid prefixes, according to some predefined order of rowids. Each path from the root node to the leaf node represents a rowset in which the rowids increase. The later also stores the large rowsets which also share common rowid prefixes. The corresponding closed itemsets are stored in the nodes carrying the last rowids in rowsets. Moreover, a new algorithm, RIHS-Tree-based algorithm for mining frequent closed patterns (FCIM-RIHS), is proposed. We translate the whole dataset into a transposed table, construct RIHS-Tree according to the rowsets in the transposed table and use a bottom-up search strategy to traverse RIHS-Tree. In the process of mining, we use the rowsets-inclusion strategy to implement pattern growth and then obtain large rowsets with their corresponding frequent closed itemsets. In FCIR-Tree, if the nodes in the subtree rooted by the nodes carrying the last rowid in the rowsets do not contain the found itemsets, the found itemsets are frequent closed itemsets. The experiment results with dataset demonstrate that FCIM-RIHS has highly efficiency.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Angle historgam model of directional relationship in 3D based on Double-projection and Rounded-subdivision

引用

Journal of Information and Computational Science 2014年第18期11卷 6471-6478页

作者： Kong, Dehan Liu, Yongshan Ma, Junlei 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

The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the regular pattern of human cognition. In order to get a closer conclusion to human cognition on directional relationship, Angle Histogram model based on Double-projection and Rounded-subdivision (AHDPRS) is proposed in this paper. The model uses the maximum inscribed circles to find out the maximum parts of the object, and calculates the directional relationship between the centers of the circles. This model ignores the inessential details to ensure the result which will be closer to human cognition. The experiments show that this model is feasible.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Point cloud coarse registration based on 3DSIFT keypoint detection

引用

Journal of Computational Information systems 2014年第23期10卷 10121-10128页

作者： Gu, Xiaoying Liu, Yongshan 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

Since the SIFT feature point extraction algorithm with scale changes, rotation transformation invariance, is widely used in image registration. In this paper, the SIFT algorithm is applied to three-dimensional point cloud coarse registration, the proposed 3DSIFT extraction algorithm is suitable for three-dimensional point cloud data, then point coordinates, curvature, the nearest neighbor distance mean and other information compose fourteen-dimensional vector to conduct correspondence match, use the interior point rate of Ransac to obtain optimal transformation, and finally transform the coordinates for source point clouds using the optimal transform, complete the point cloud data coarse registration. Experimental results show that our coarse registration algorithm can effectively extract feature points, and it is robust for the point cloud with noisy point, it can provide accurate and effective initial value for the precise registration such as ICP.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

A homogenization method for nonlinear inhomogeneous elastic materials

引用

virtual Reality & Intelligent Hardware 2021年第2期3卷 156-170页

作者： Jing ZHAO Fei ZHU Liyou XU Yong TANG Sheng LI College of Information Science and Engineering Yanshan UniversityQinhuangdaoHebei 066004China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei 066004China School of Electronics Engineering and Computer Science Peking UniversityBeijing 100871China Beijing Engineering Research Center for Virtual Simulation and Visualization Beijing 100871China

Background Fast simulation techniques are strongly favored in computer graphics,especially for the nonlinear inhomogeneous elastic *** homogenization theory is a perfect match to simulate inhomogeneous deformable objects with its coarse discretization,as it reveals how to extract information at a fine scale and to perform efficient computation with much less *** existing homogenization method is not applicable for ubiquitous nonlinear materials with the limited input deformation *** In this paper,we have proposed a homogenization method for the efficient simulation of nonlinear inhomogeneous elastic *** approach allows for a faithful approximation of fine,heterogeneous nonlinear materials with very coarse *** analysis provides the basis of a linear deformation space and modal derivatives extend the space to a nonlinear regime;based on this,we exploited modal derivatives as the input characteristic deformations for *** also present a simple elastic material model that is nonlinear and anisotropic to represent the homogenized *** nonlinearity of material deformations can be represented properly with this *** material properties for the coarsened model were solved via a constrained optimization that minimizes the weighted sum of the strain energy deviations for all input deformation *** arbitrary number of bases can be used as inputs for homogenization,and greater weights are placed on the more important low-frequency *** Based on the experimental results,this study illustrates that the homogenized material properties obtained from our method approximate the original nonlinear material behavior much better than the existing homogenization method with linear displacements,and saves orders of magnitude of computational *** The proposed homogenization method for nonlinear inhomogeneous elastic materials is capable of capturing the nonlinear dynamics of the

关键词： Physical-based simulation Homogenization theory Heterogeneous material Modal basis

来源：评论

学校读者我要写书评

暂无评论

Multi-label feature selection with feature reconstruction and label correlations

引用

Expert systems with Applications 2025年 285卷

作者： Ning Zhang Ao Wang Pengwei Lu Tao Feng Ying Xu Guodong Du School of Information Science and Engineering Yanshan University Qinhuangdao 066004 PR China Hebei Key Laboratory of Computer Virtual Technology and System Integration Yanshan University Qinhuangdao 066004 PR China Department of Computer Science and Technology Tsinghua University Beijing 100084 PR China Shenzhen Research Institute of Yanshan University Shenzhen 518063 PR China

With the arrival of the big data era, multi-label data have frequently appeared in various fields. However, multi-label data often contain rich feature information, leading to a high-dimensional feature space. Thus, multi-label feature selection plays a crucial role in addressing this challenge as a preprocessing step. Multi-label data assign a set of labels to each instance simultaneously; therefore, capturing the correlations among labels is an effective means of enhancing the learning performance. However, current multi-label feature selection methods seldom consider label correlations. Moreover, redundant features can cause overfitting, increase the complexity, and reduce the interpretability. To address these issues, we propose a multi-label feature selection method that incorporates feature reconstruction and label correlations. Specifically, we construct a low-dimensional embedding from the original feature space using induction, which preserves the manifold structure of the feature space. Next, we explore the global and local label correlations using a manifold regularization term designed by the generated low-dimensional space. We then achieve feature reconstruction by minimising the reconstruction error and sparse regularization terms to learn the relationships between the features. Finally, we construct an optimal objective function with ℓ 2 , 1 -norm regularization to facilitate multi-label feature selection and ensure convergence. Comparative experiments on 11 datasets show that the proposed method exhibits notable performance improvements over existing methods(e.g., achieves 5.6 % higher Average precision than RFS on S c e n e and 3.6 % lower Coverage than CRASG on S c i e n c e ), validating the effectiveness and superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of foam and sprays based on the Weber number

引用

Journal of Computational Information systems 2014年第7期10卷 2829-2836页

作者： Zhang, Lihui Zhang, Chao Li, Ying Lv, Mengya Tang, Yong The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province The College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information Engineering Environmental Management College of China Qinhuangdao 066004 China

In this paper, we propose a method based on the Weber number to uniformly model and simulate the foam and sprays generated by the fluid motion. We use the SPH to construct the fluid and calculate the Weber number of each particle. The fluid particles are divided into foam particles, transition particles and water particles by comparing their Weber number with a given critical value. These particles are rendered independently. For the solid-liquid interaction in fluid, we use SPH particles to mark the solid shape, and correct the changed solid particle position using a rotating equation. Finally, a more precise fluid surface illumination model is proposed, and the Fresnel reflection coefficient of this model can be gotten by the Snell law. Experiment results show that our method achieve real-time performance and the visual effect is desirable. © 2014 Binary Information Press.

关键词： Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

A PSO Based Multi-Domain virtual Network Embedding Approach

引用

China Communications 2019年第4期16卷 105-119页

作者： Yongjing Ni Guoyan Huang Sheng Wu Chenxi Li Peiying Zhang Haipeng Yao College of Information Science and Engineering Yanshan University College of Information Science and Engineering Hebei University of Science and Technology The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University School of Information and Communication Engineering Beijing University of Posts and Telecommunications College of Computer & Communication Engineering China University of Petroleum (East China)

This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.

关键词： multi-domain virtual network embedding candidate node particle swarm optimization algorithm virtual network request division

来源：评论

学校读者我要写书评

暂无评论

Local outlier detection algorithm based on gaussian kernel density function 10th

Local outlier detection algorithm based on gaussian kernel d...

引用

10th International Symposium on Intelligence Computation and Applications, ISICA 2018

作者： Zhang, Zhongping Liu, Jiaojiao Miao, Chuangye School of Information Science and Engineering Yanshan University QinhuangdaoHebei066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei066004 China

ISBN: (纸本)9789811364723

With the rapid development of information technology, the structure of data resources is becoming more and more complex, and outlier mining is attracting more and more attention. Based on Gaussian kernel function, this paper considers three neighbors: k nearest neighbors, reverse k neighbors and shared nearest neighbors. A local outlier detection algorithm based on Gaussian kernel function is proposed. Firstly, the algorithm stores the nearest neighbors of each data object through kNN maps, including k-nearest neighbors, reverse k-nearest neighbors, and shared nearest neighbors, forming a kernel neighbor set S. Secondly, Estimating density of data objects through kernel density estimation KDE method. Finally, the relative density outlier factor RDOF is used to estimate the degree of data objects deviating from the neighborhood, and then determines whether the data objects are outliers, and the validity of the algorithm is proved on the real and synthetic data sets. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A novel grouping aggregation algorithm for online analytical processing

A novel grouping aggregation algorithm for online analytical...

引用

2012 National Conference on Information technology and computer Science, CITCS 2012

作者： Chen, Wei Liu, Yongshan Wang, Ning College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China

ISBN: (纸本)9789491216381

As regard to improve the efficiency of grouping aggregation calculation, the data is compressed by using binary encoding, and the dimension hierarchical grouping attribute set encodings of each dimension table are calculated by using the dimension hierarchy tree. Then different encodings are put into temporary table to be sorted and grouped, and the grouping sequence numbers of fact table records which satisfy the query conditions are computed. Finally, the buffer is located by the grouping sequence number and the grouping aggregation calculation is completed. Theoretical analysis and experimental results show that the proposed algorithm can significantly improve the efficiency of grouping aggregation calculation. © 2012. The authors - Published by Atlantis Press.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A survey of occlusion detection method for visual object

引用

High technology Letters 2016年第3期22卷 256-265页

作者：张世辉 He Huan Liu Jianxin Zhang Yucheng Pang Yunchong Sang Yu School of Information Science and Engineering Yanshan University Qinhuangdao 066004 P. R. China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 P. R. China

Occlusion problem is one of the challenging issues in vision field for a long time,and the occlusion phenomenon of visual object will be involved in many vision research fields. Once the occlusion occurs in a visual system,it will affect the effects of object recognition,tracking,observation and operation,so detecting occlusion autonomously should be one of the abilities for an intelligent vision system. The research on occlusion detection method for visual object has increasingly attracted attentions of scholars. First,the definition and classification of the occlusion problem are ***,the characteristics and deficiencies of the occlusion detection methods based on the intensity image and the depth image are analyzed respectively,and the existing occlusion detection methods are compared. Finally,the problems of existing occlusion detection methods and possible research directions are pointed out.

关键词： visual object occlusion detection intensity image depth image

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：