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

Incremental mining of sequential patterns from multiple item set data streams

ICIC Express Letters 2014年第10期8卷 2687-2692页

作者： Hao, Xiaobing Chen, Yuping Ren, Jiadong College of Information Science and Engineering 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

Sequential pattern mining has a wide range of applications in data streams. The real data involves multiple data streams and each data stream is itemset-sequence. However, most algorithms mine a single item in a single data stream. So IMASP algorithm (incremental mining of across-stream sequential patterns from multiple item set data streams) is presented to mine sequential patterns from multiple data streams and it is an incremental algorithm with single-pass scanning. What is more, the algorithm uses a multi-streams bitmap temporary table to store the sequence information in the current sliding windows. The partial substitution and the real-time counting of the item in old and new windows are adopted to improve the execution efficiency of the algorithm. A multi-streams Lexicographic Sequence Tree is used to store items, extended sequences and the support. Experimental results show that IMASP algorithm reduces time and memory consumption and has the efficiency and accuracy for mining across-stream sequential pattern from itemset sequence streams. © 2014 ICIC International.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficiently mining top-k high utility path patterns in software dynamic call graph

引用

ICIC Express Letters 2016年第1期10卷 211-218页

作者： He, Haitao Yin, Tengteng Wu, Hongfei Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 West Hebei Ave Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 West Hebei Ave Qinhuangdao China

Software behavior mining is a very meaningful work. Finding that desirable patterns can assist the program maintainers to comprehend the software adequately. Although the existing high utility pattern mining algorithms can discover all the patterns satisfying a given minimum utility, it is often dicult for users to set a proper minimum utility. In this paper, an ecient algorithm TUPP is presented to mine top-k high utility path patterns in software dynamic call graph. In TUPP, software paths are extracted from software dynamic call graph and the utility of functions is dened rstly. Secondly, a novel structure called PUAList is put forward. The structure stores both the adjacency items and the utility information which is heuristic information for pruning the search space. In addition, two strategies for raising the threshold and one pruning strategy are incorporated into TUPP to increase the eciency. At last, our experiments are conducted on both synthetic and real datasets. The results show that TUPP incorporating the eciency-enhanced strategies demonstrates impressive performance. © 2016 ICIC International.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for mining maximal frequent sequences by Top-Down Delay Decomposition method

引用

ICIC Express Letters 2014年第7期8卷 2007-2012页

作者： Wang, Qian Ren, Jiadong Liu, Qiang 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 No. 438 Hebei Ave. Qinhuangdao 066004 China

Maximal frequent sequence mining is an important research issue which has realized the highly compressed storage of frequent sequences. At present, most algorithms are based on bottom-up method and large numbers of candidate sequences are generated. In this paper, an algorithm based on Top-down Delay Decomposition for mining Maximal Frequent Sequence is proposed. TDD MFS uses top-down delay decomposition method, sequences from original database and decomposition are expressed by different tuples to record their direct and indirect occurrence counts. Longest infrequent sequences are recursively decomposed and the decomposition of infrequent sequences that have frequent super sequences is avoided. Only one database scan is needed, no candidate sequences are generated and sequence decomposition times are reduced. Experiment result shows its high efficiency and good scalability. © 2014 ISSN 1881-803X.

关键词： Delay decomposition Frequent sequence Maximal frequent sequence

来源：评论

学校读者我要写书评

暂无评论

A batch-based algorithm for mining weighted sequential patterns in data streams

引用

ICIC Express Letters 2014年第7期8卷 1821-1826页

作者： Hao, Xiaobing Li, Yabin Huang, Guoyan Ren, Jiadong College of Information Science and Engineering 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

In this paper, we proposed a new sequential pattern mining algorithm called WSPD for mining weighted sequential patterns in data streams. The algorithm produces no false negatives and places a bound on the error of the false positives. WSPD could also satisfy the user's dynamic request for mining weighted sequential patterns from any batches. Experimental results show that WSPD algorithm is effective and scale linearly for mining weighted sequential patterns in data streams. © 2014 ISSN 1881-803X.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An energy saving strategy in digital cognitive radio networks and its performance assessment

引用

ICIC Express Letters 2016年第6期10卷 1367-1373页

作者： Jin, Shunfu Chen, Si School of Information Science and Engineering Yanshan University No. 438 Hebei Ave Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao066004 China

With the explosive growth of wireless application, how to improve the spectrum efficiency as well as reduce the communication consumption is a hot topic of research. In this paper, we propose a novel energy saving strategy in digital cognitive radio networks (CRNs). The key idea of this strategy is to set the base station (BS) of CRNs into sleep state when there are not any packets to be transmitted. Accordingly, we develop a Markov chain model to assess the average latency of secondary user (SU) packets and the energy saving ratio of system. Finally, we provide numerical results to show that there is a tradeoff when setting the sleep timer length for the proposed energy saving strategy. © 2016 ISSN.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

In-rank: An entropy-based informative nodes mining method in complex software network

引用

ICIC Express Letters 2016年第7期10卷 1683-1689页

作者： Ren, Jiadong Li, Yanling Wu, Hongfei Liu, Yang Zhang, Peng College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China

It is a fundamental issue to find a small subset of influential individuals in a complex network such that they can spread information to the largest scope of nodes in the network. Informative functions in complex software network can lead maximum information propagation scope, and mining such function nodes is important to understand the system’s topology structure and information transfer flows. In this paper, a novel topk informative nodes mining approach based on global information in directed-weighted complex software network is proposed. Firstly, we map functions and call relationships between them as a Directed-Weighted Function Call Network (DWFCN). Secondly, an algorithm path-compute based on Software Executing Path Sequence (SEPS) generated by Depth-First-Search strategy is used to compute the software executing paths and get nodes’ information Accessible Set (AS). Thirdly, algorithm Entropy-Compute is proposed to calculate each source node’s information entropy in each information transfer flow process. Finally, an Informative Node Rank (IN-Rank) algorithm is put forward to mine most informative nodes. Experimental results show that our new method is accurate and effective. © 2016, ICIC Express Letters Office. All rights reserved.

关键词： Mining

来源：评论

学校读者我要写书评

暂无评论

Research on load balancing strategy based on middleware

引用

ICIC Express Letters 2014年第9期8卷 2655-2661页

作者： Gu, Xiaoying Liu, Yongshan Man, Yubao Department of Information Science and Engineering Qinhuangdao 066004 China The Key Lab. for Computer Virtual Tech. and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

According to the former research achievements about load balancing strategy, considering the load distribution, the load condition of service node and the number of user connections, we propose a load balancing strategy based on middleware. According to the cluster service load and the number of user connections, the requests from user will be reasonably allocated to each service node by using middleware technology, then service node and requested user establish a temporary connection, after all the requests of this user are processed by this node. Experiments show that, this strategy reduces the number of requests for allocation, improves the resource utilization rate of cluster system and load balancing degree, and effectively suppresses the load jitter of system. © 2014 ISSN 1881-803X.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

BAT: Mining Binary-API Topic for Multi-service Application Development

BAT: Mining Binary-API Topic for Multi-service Application D...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Pengfei He Linlin Liu Dianlong You Limin Shen Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China National Science Libraries Chinese Academy of Sciences Beijing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

With the growing popularity of API-driven multiservice application (mashup) development, the burgeoning web APIs have left developers drowning in the sea of web API selections. Matching developers with the most appropriate APIs is the key to improving user satisfaction and promoting more popular web applications. As a result, more and more researchers pay attention to web API recommender systems based on collaborative filtering. However, employing collaborative filtering to recommend APIs is challenging due to the severe sparsity of mashup and API interactions. To address this problem, we propose a probabilistic generative model, called the Binary-API Topic model (BAT), to parameterize mashups and APIs. Technically, BAT is equipped with a mechanism to extract binary-APIs and predict unknown pairwise interactions. To improve generality and capture more relevance from a limited number of interactions, we learn binary-API topics by directly modeling the generation of API co-occurrence patterns across the repository (all mashup collections from ***). The main advantage of BAT is that it preserves API co-occurrence patterns in model learning and exploits the rich global relevance. Finally, through extensive experiments, we demonstrate that BAT can achieve the highest performance on the sparse real-world data set.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient collision detection algorithm of convex polygons based on Minkowski sum

引用

ICIC Express Letters 2013年第2期7卷 461-464页

作者： Geng, Qingjia Guo, Xijuan Zhang, Jianfei Zhang, Buying The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Computer Hebei Normal University of Science and Technology No. 360 West Hebei St. Qinhuangdao 066004 China

Collision detection is a hot research topic in the field of path planning of mobile robot, virtual assembly simulation, and so on. Fast and accurate collision detection has become one of the most key technologies of restricting their development. The study method based on Minkowski sum is an effective method for accurate collision detection through accurate numerical calculations. This paper presents a new efficient collision detection algorithm of convex polygons based on Minkowski sum, which uses the minimum separation distance to detect whether two convex polygons collide or not. The algorithm's performance is also analyzed and verified by experiment in the paper. Compared with the traditional collision detection algorithms based on the Minkowski sum, the algorithm's calculation is simpler and execution performance is higher. © 2013 ISSN 1881-803X.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：