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

Mining maximal frequent patterns based on hierarchical bit vector and stack principle

Journal of Computational Information systems 2015年第1期11卷 369-376页

作者： Wang, Qian Ren, Jiadong He, Haitao Huang, Guoyan College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Maximal frequent pattern mining usually adopts a global pattern growth way, and a maximal frequent pattern can be obtained unless most of its subsets are checked to be frequent. An algorithm for mining maximal frequent patterns based on hierarchical bit vector and stack principle, called MaxPat HB, is proposed in this paper. Different with the traditional thinking of "test after connection", MaxPat HB adopts an individual pattern growth way and uses another thought of "testing while growing" which can efficiently gain the specified maximal frequent pattern and decrease the scale of candidate generation. The original data is converted to hierarchical bit vectors and maximal frequent patterns are mined hierarchically according to item unit. Candidate itemset generation adopts the stack principle, the push and pop operation is imitated by transforming bit values in a vector. Logic calculations between bit vectors are faster than the matches between strings, and the hierarchical structure can extremely reduce the searching space. Experiment result shows its high efficiency and good scalability. ©, 2014, Journal of Computational Information systems. All right reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

ENHANCING TWITTER BOT DETECTION VIA MULTIMODAL INVARIANT REPRESENTATIONS

arXiv

引用

arXiv 2024年

作者： Gong, Jibing Peng, Jiquan Qu, Jin Du, ShuYing Wang, Kaiyu School of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province China

Detecting Twitter Bots is crucial for maintaining the integrity of online discourse, safeguarding democratic processes, and preventing the spread of malicious propaganda. However, advanced Twitter Bots today often employ sophisticated feature manipulation and account farming techniques to blend seamlessly with genuine user interactions, posing significant challenges to existing detection models. In response to these challenges, this paper proposes a novel Twitter Bot Detection framework called BotSAI. This framework enhances the consistency of multimodal user features, accurately characterizing various modalities to distinguish between real users and bots. Specifically, the architecture integrates information from users, textual content, and heterogeneous network topologies, leveraging customized encoders to obtain comprehensive user feature representations. The heterogeneous network encoder efficiently aggregates information from neighboring nodes through oversampling techniques and local relationship transformers. Subsequently, a multi-channel representation mechanism maps user representations into invariant and specific subspaces, enhancing the feature vectors. Finally, a self-attention mechanism is introduced to integrate and refine the enhanced user representations, enabling efficient information interaction. Extensive experiments demonstrate that BotSAI outperforms existing state-of-the-art methods on two major Twitter Bot Detection benchmarks, exhibiting superior performance. Additionally, systematic experiments reveal the impact of different social relationships on detection accuracy, providing novel insights for the identification of social bots. © 2024, CC BY.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

Research of Signed Networks Community Detection Based on the Tightness of Common Neighbors 6

Research of Signed Networks Community Detection Based on the...

引用

6th International Conference on Digital Home, ICDH 2016

作者： Xinzhuan, Hu Guo, Jingfeng Chen, Xiao Zhao, Xiaomeng School of Economics and Management Yanshan University Hebei Ave. Qinhuangdao China College of Information Science and Engineering Yanshan University Hebei Ave. Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Ave. Qinhuangdao China

ISBN: (纸本)9781509044009

According to the characteristics of positive and negative edge of signed networks, a new signed networks community detection algorithm BTCN-SNCD (Signed networks Community Detection Based on the Tightness of Common Neighbors) is proposed based on the tightness of common neighbors. Firstly, in view of the shortcomings of the traditional local similarity metrics only considering the number of common neighbors, the contribution degree and the tightness of common neighbors are defined, which can discover the initial communities with tighter structure. Secondly, for the overlapping nodes exist in initial communities, we propose overlap coefficient and community density to remerge the initial communities, thus improving community detection accuracy. Finally, the correctness and efficiency of the BTCN-SNCD algorithm are verified through a comparison with classic signed networks community detection algorithms. © 2016 IEEE.

关键词： Signal detection

来源：评论

学校读者我要写书评

暂无评论

Mobile APP User Attribute Prediction by Heterogeneous Information Network Modeling 5th

Mobile APP User Attribute Prediction by Heterogeneous Inform...

引用

5th International Conference on Dependability in Sensor, Cloud, and Big Data systems and Applications, DependSys 2019

作者： Zhang, Hekai Gong, Jibing Teng, Zhiyong Wang, Dan Wang, Hongfei Du, Linfeng Bhuiyan, Zakirul Alam School of Information Science and Engineering Yanshan University Qinhuangdao066004 China The Key Lab for Computer Virtual Technology and System Integration Yanshan University Qinhuangdao066004 China School of Computer Science and Engineering Beihang University Beijing100191 China Shenyuan Honors College Beihang University Beijing100191 China State Key Lab of Mathematical Engineering and Advanced Computing Wuxi214000 China Department of Computer and Information Sciences Fordham University New York United States

ISBN: (纸本)9789811513039

User-based attribute information, such as age and gender, is usually considered as user privacy information. It is difficult for enterprises to obtain user-based privacy attribute information. However, user-based privacy attribute information has a wide range of applications in personalized services, user behavior analysis and other aspects. Although many scholars have made achievements in user attribute prediction and other related fields, there are still two main problems that impede further improvement on the accuracy of classification: (1) Traditional machine learning classification merely takes each object as a single individual, ignoring the relationship between them;(2) At present, the popular Heterogeneous Path-Mine Information Network only considers whether the user has a relationship with the attributes of other nodes, rather than the degree of correlation of the attributes. It employs a linear regression model to fit the weight of meta-path, which is highly sensitive to outliers. To solve the above two problems, this paper advances the HetPathMine model and puts forward TPathMine model. With applying the number of clicks of attributes under each node to express the user’s emotional preference information, optimizations of the solution of meta-path weight are also presented. Based on meta-path in heterogeneous information networks, the new model integrates all relationships among objects into isomorphic relationships of classified objects. Matrix is used to realize the knowledge dissemination of category knowledge among isomorphic objects. The experimental results show that: (1) the prediction of user attributes based on heterogeneous information networks can achieve higher accuracy than traditional machine learning classification methods;(2) TPathMine model based on the number of clicks is more accurate in classifying users of different age groups, and the weight of each meta-path is consistent with human intuition or the real world situation. © 2019, Spr

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

virtual grid-based clustering of uncertain data on vulnerability database

引用

Journal of Convergence Information technology 2012年第20期7卷 429-438页

作者： Dong, Jun Cao, Mengmeng Huang, Guoyan Ren, Jiadong 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

Most existing vulnerability taxonomy classifies vulnerabilities by their idiosyncrasies, weaknesses, flaws and faults et al. The disadvantage of the taxonomy is that the classification standard is not unified and there is overlap classification phenomenon in vulnerability taxonomy. In order to solve the problem, we will propose an algorithm VUNClique, virtual Grid-based Clustering of Uncertain Data on vulnerability database. Firstly, this paper transforms the vulnerability database into uncertain dataset using the existing vulnerability database pretreatment model. Secondly, we define a virtual grid structure, the cells are divided into real cells and virtual cells, but only the real cells which contain data objects stored in memory. The probability attribute value similarity is defined to deal with the similarity of non-numeric attributes, which compares the number of non-numeric attributes with the same value between tuples to measure the similarity. We provide a secondary partition algorithm to improve the similarity between the tuples in the same cell, the algorithm merges a tuple into it's high-density neighbor cell which has the maximum value of probability attribute value similarity with it. Then, a novel identify cluster algorithm is provided to cluster the high-density real cells. It can identify clusters of arbitrary shapes by traversing real cells twice. Finally, performance experiments over the uncertain dataset transformed by NVD vulnerability database. The experiments results show that VUNClique can find clusters of arbitrary shapes, and greatly improve the efficiency of clustering.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

A density grid-based uncertain data stream clustering algorithm

引用

Journal of Computational Information systems 2014年第9期10卷 3619-3626页

作者： He, Haitao Zhao, Jintian The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China

The existing grid-based uncertain data stream clustering algorithms are fast but low-accuracy, and sensitive to user-specified threshold. In order to solve the above problems, a density grid-based uncertain data stream clustering algorithm UG-Stream is proposed in this paper. In UG-Stream algorithm, a dynamic threshold is defined by taking uncertainty and grid feature into account, dense grid can be distinguished by the threshold. The probability variance is defined to describe the distribution of internal data points in grid. If grid distribution can be taken as uniform, dense grid can be classified as core dense grid by probability variance. Core dense grid can be clustered directly, the rest of dense grids will be merged into current existing clusters by probability center distance. Contrast experiments show that UG-Stream algorithm is superior to UMicro algorithm in both clustering accuracy and clustering rate. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A Time-aware POI Recommendation Method Exploiting User-based Collaborative Filtering and Location Popularity

A Time-aware POI Recommendation Method Exploiting User-based...

引用

2017 2nd International Conference on Communications, Information Management and Network Security (CIMNS2017)

作者： Ya-li SI Fu-zhi ZHANG Wen-yuan LIU School of Information Science and Engineering Yanshan University School of Liren Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province

Point-of-interest(POI) recommendation becomes an important research for location-based social networks, since it helps modern citizens to explore new locations in unvisited cites effectively according to their preferences. However, the current POI recommendation methods are lack of a deep mining in all time slots features and their effects on recommendation. To this end, in this paper we propose a POI recommendation method(called UPT) by combining time slot features, user-based collaborative filtering and spatial influence. Firstly, we extract time interval feature and time slot based popularity feature from history check-in datasets on LBSNs using probability statistical analysis method. Then, we devise a POI recommendation method based on the proposed temporal features to achieve better performance. In UPT, user-based collaborative filtering and smoothing technique are used by adding each time slot influence, and the overall popularity of a location is combined with each time slot feature. Our experimental results on Foursquare and Gowalla datasets show that UPT outperforms baseline POI recommendation methods in precision and recall.

关键词： Location-based social networks Point-of-interest recommendation User-based collaborative filtering Location popularity Temporal feature

来源：评论

学校读者我要写书评

暂无评论

Object Tracking by Jointly Utilizing Template Updating and Relocation Mechanisms⋆

SSRN

引用

SSRN 2023年

作者： Wen, Jia Ren, Kejun School of Information Science and Engineering Yanshan University Qinhuangdao066099 China The Key Laboratory for Computer Virtual Technology System Integration of Hebei Province China

The Siamese network-based tracker has achieved competitive performance in the field of single target tracking because of its excellent tracking speed and tracking accuracy. When faced with target deformations, most Siamese trackers rely on fixed template features from the initial frame, severely constraining the tracker’s performance. To mitigate this situation, we introduce a novel tracking framework(SiamTAR) that allows adaptive template updates based on past tracking information. In addition, we design a feature refinement module which can capture the target information more accurately at the full scale on the search image through an integrated attention mechanism, thus enabling the tracker to pay less attention to redundant information. Notably, we introduce a relocalization mechanism to solve the problems of random drift of the tracking box and inaccurate scale estimation in online tracking. Extensive experiments on GOT-10K, UAV123, OTB100 and DTB70 datasets show that the tracker achieves good tracking results and real-time performance. © 2023, The Authors. All rights reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Integrating LDA into the weighted average method for semantic friend recommendation 6th

Integrating LDA into the weighted average method for semanti...

引用

6th CCF Academic Conference on Big Data, CCF Big Data 2018

作者： Gong, Jibing Chen, Shuai Gao, Xiaoxia Song, Yanqing Wang, Shuli School of Information Science and Engineering Yanshan University Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao066004 China The Department of Applied Mathematics Yanshan University Qinhuangdao066004 China

ISBN: (纸本)9789811329210

Friend recommendation is a fundamental service for both social networks and practical applications. The majority of existing friend-recommendation methods utilize user profiles, social relationships, or static post content data, but rarely consider the semantic intentions and dynamic behaviors of users. In this paper, we propose FRec++, a friend recommendation method based on semantic and dynamic information. In FRec++, the first plus stands for new friend recommendation using a semantic model based on LDA while the next plus stands for the use of dynamic user attributes (e.g., behaviors or positions). More specifically, we first use the LDA method to generate semantic topics for user interests, and then compute the topic similarities between the target user and candidate friends. Next, we calculate the similarities of dynamic behaviors (i.e., forwarding, making comments, liking, and replying) and investigate the static attributes of users to measure the relevance of preferences. Finally, the weighted average method is used to integrate the above factors. We conducted experiments on the Weibo dataset and the results show that FRec++ outperforms several existing methods. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic web page data extraction through MD5 trigeminal tree and improved BIRCH

Automatic web page data extraction through MD5 trigeminal tr...

引用

2022 International Conference on Electronic Information Engineering, Big Data, and computer technology, EIBDCT 2022

作者： Gong, Jibing Kou, Xiaomeng Zhang, Hanyun Peng, Jiquan Gong, Shishan Wang, Shuli School of Information Science and Engineering Yanshan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao066004 China School of Information Science Yanshan University Qinhuangdao066004 China

ISBN: (纸本)9781510655133

This paper proposes an automatic data extraction algorithm for web pages based on noise reduction and visualization blocks' construction. In this algorithm, we first build an MD5 trigeminal tree of the web page's source files using a Message-Digest Algorithm. And then we arrange some noise reduction. Finally, we construct visualization blocks by an optimized cluster algorithm named BIRCH A-CF which could create an area clustering feature forest and complete the clustering by dynamically changing the circle's radius according to the correction factor. We perform experiments on eight different datasets to compare our method with eight baseline methods. The experimental results show that our approach outperforms current methods by providing more accuracy and robustness, it also accelerates noise reduction and reduces the number of nodes effectively. © 2022 SPIE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：