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

International Conference on Computer Supported Cooperative Work in Design

作者： Yiwen Li Zhenyu Yang Zhijun Li Xiaoyang Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Personalized news recommendation helps users find interesting content among much news information. Most existing news recommendation techniques densely interact a user’s historical clicked news with candidate news to capture their reading interest. However, during this process, even if certain historical clicked news is weakly correlated with the candidate news, the model still interacts with it, generating more noise information when constructing user interests. Simultaneously, the news representation learning process using neural networks is a fine-grained to coarse-grained learning process; i.e., as the network deepens, the fine-grained original news information is easily lost. Therefore, to solve the above problems, this paper proposes a news recommendation model based on hierarchical granular semantic embeddings and threshold attention (HGTA). In HGTA, we propose a threshold attention module to filter unimportant historical clicked news by setting an attention score threshold, i.e., interacting only with historical clicked news that is strongly correlated with the candidate news when capturing user interests. Thus, the model attention is focused, and the noisy interaction information is reduced. Furthermore, when training the neural network, to prevent the loss of fine-grained information, we design a hierarchical granular information extraction module to capture both coarse- and fine-grained news features to better enrich the news semantics. Experiments conducted on the large real-world Microsoft News dataset (MIND) show that our model achieves highly competitive results in terms of popular metrics. Our code is published at the following URL: https://***/liyiweneven/HGTA.

关键词： Uniform resource locators Training Representation learning Federated learning Semantics Neural networks Noise

来源：评论

学校读者我要写书评

暂无评论

JTEA: Implementing Semi-Supervised Entity Alignment Using Joint Teaching Strategies

JTEA: Implementing Semi-Supervised Entity Alignment Using Jo...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Kai Lu Jing Zhao Lichao Ding Zenghao Hao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Computer Science and Technology Shandong Engineering Research Center of Big Data Applied Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Entity alignment(EA) aims to identify equivalent entities in different knowledge graphs or data sources and establish correspondences between them. In recent years, embedding-based methods have made significant progress in the field of entity alignment, yet the shortage of adequate training data (i.e., seed entity pairs) continues to be a primary challenge. Traditional semi-supervised methods typically address this issue by generating potential mappings (i.e., pseudo-mappings) for unlabeled entities. However, these methods often suffer from the influence of erroneous potential mappings or overlook the uncertainty of potential mappings. Therefore, we propose a novel semi-supervised entity alignment method called JTEA. This method combines seed entity pairs with potential mappings through end-to-end joint training, providing strong guidance for model training. In constructing potential mappings, we propose a bidirectional matching strategy (BMS), which generates more detailed potential mappings by jointly adjusting decisions in different directions and uses a joint matching confidence score to characterize its uncertainty. Furthermore, we also introduce a method of matching diversity alignment selection, aiming to screen out more reliable entity alignments to further improve the performance and stability of the model. We conducted a large number of experiments on the benchmark dataset to fully validate the effectiveness of the JTEA method.

关键词： Training Uncertainty Soft sensors Noise Training data Knowledge graphs data models Stability analysis Reliability Thermal stability

来源：评论

学校读者我要写书评

暂无评论

MCAF: Multi-Headed Causal Attention Fusion Approach for Multimodal Sentiment Analysis

MCAF: Multi-Headed Causal Attention Fusion Approach for Mult...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingao Wang Xingang Wang Jinxiao Yang Yurun Bi Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Multimodal sentiment analysis(MSA) aims to synthesize multiple pieces of information, including textual, visual, and auditory information, to more accurately infer sentiment polarity. Due to the existence of complex and diverse affective causal relationships between different modalities, they interact with each other and constitute a multidimensional expression of human emotions. In the face of unbalanced data, i.e., when there are significant differences in the number of samples between different categories, the attention mechanism of the model tends to focus on spurious correlations in the training data, seriously impairing the model’s generalization ability and leading to bias, unbalanced prediction, and false correlation identification problems. To address the above problems, this study proposes a new multimodal fusion method based on the "within-sample sampling" and "cross-sample sampling" front door adjustment methods in causal inference strategies: the multi-head causal attention fusion method (MCAF). This method aims to capture potential causal relationships between different modalities through different attention heads, helping the model focus more on key causal features and avoid paying too much attention to false correlations in the training data. This helps improve the generalization performance of the model, make the decision-making process of the model more interpretable, and enhance the accuracy and robustness of the model for multimodal sentiment analysis tasks, making it more suitable for practical application scenarios.

关键词： Analytical models Sentiment analysis Visualization Correlation Neural networks Training data Predictive models

来源：评论

学校读者我要写书评

暂无评论

Overcoming data Limitations and Cross-Modal Interaction Challenges in Medical Visual Question Answering

Overcoming Data Limitations and Cross-Modal Interaction Chal...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Yurun Bi Xingang Wang Qingao Wang Jinxiao Yang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Medical Visual Question Answering (Med-VQA) is a sophisticated multimodal technology within the medical domain that utilizes natural language processing and artificial intelligence techniques. It serves as a tool in the medical field to provide information and answers, aiming to correctly respond to medical questions related to specific professional medical images. The primary goal is to assist patients in understanding their physical condition and provide decision support for healthcare professionals. While Generalized Visual Question Answering has seen significant advancements, challenges persist in the medical domain. Firstly, medical data has inherent limitations, such as the scarcity of annotated medical datasets and the complexity of medical images (including factors like noise, artifacts, and low contrast). Secondly, in terms of cross-modal fusion, there exists an intricate relationship between medical images and textual information. The complexity of the relationship between medical images and medical text, as well as the incorporation of global contextual details, pose challenges. To address these issues, this paper proposes the Feature-Enhanced Network with Conditional Mixing. This innovative approach aims to overcome the scarcity and complexity of medical images without the need for additional datasets. Simultaneously, to tackle the challenge of cross-modal fusion and information interaction and to address the complex relationship between medical images and text, we propose the Cross-Adaptive Fusion Network. Experimental results conducted on the VQA-RAD dataset demonstrate noticeable improvements in accuracy compared to mainstream Med-VQA models.

关键词： Visualization Accuracy Noise Neural networks Medical services Question answering (information retrieval) data models

来源：评论

学校读者我要写书评

暂无评论

LESaET: Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER

LESaET: Low-Dimensional Embedding Method for Link Prediction...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lichao Ding Jing Zhao Kai Lu Zenghao Hao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Knowledge graphs (KGs) provide a structured representation of the real world through entity-relation triples. However, current KGs are often incomplete, typically containing only a small fraction of all possible facts. This involves inferring missing content from existing information, a task known as link prediction. Existing methods in the field of link prediction struggle with controlling the dimensionality of embedding vectors or suffer from overly complex models. In order to tackle these challenges, we introduce a method in this paper, named Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER (LESaET). LESaET leverages both self-attention mechanisms and tensor factorization to learn expressive contextual-enhanced representations of KGs. Specifically, LESaET employs the multi-head self-attention mechanism of Transformer as an encoder to capture the mutual information between entities and relationships, and utilizes Enhanced-TuckER as a decoder, ultimately achieving expressive low-dimensional embeddings for link prediction tasks. LESaET demonstrates competitive performance compared to advanced methods on standard datasets.

关键词： Tensors Stacking Knowledge graphs Predictive models Transformers Vectors Decoding Standards Mutual information Periodic structures

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-14页

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China University of Texas at Dallas Dallas USA National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On the time-independent Hamiltonian in real-time and imaginary-time quantum annealing

引用

Chinese Physics B 2020年第10期29卷 167-171页

作者： Jie Sun Songfeng Lu Hubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and TechnologyWuhan 430074China School of Internet Anhui UniversityHefei 230039China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen 518063China

We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and the new class of energy-time uncertainty relation proposed by Kieu. It is found that the computational time of the imaginary-time quantum annealing of this Grover search can be exponentially small, while the counterpart of the quantum evolution driven by the real-time Schrödinger equation could only provide square root speedup, compared with classic search. The present results are consistent with the cases of the time-dependent quantum evolution of the natural Grover problem in previous works. We once again emphasize that the logarithm and square root algorithmic performances are generic in imaginary-time quantum annealing and quantum evolution driven by real-time Schrödinger equation, respectively. Also, we provide evidences to search deep reasons why the imaginary-time quantum annealing can lead to exponential speedup and the real-time quantum annealing can make square root speedup.

关键词： time-independent Hamiltonian imaginary-time quantum annealing quantum speed limit the energy-time uncertainty relation continuous Grover's search

来源：评论

学校读者我要写书评

暂无评论

UP-SSO: Enhancing the User Privacy of SSO by Integrating PPID and SGX

UP-SSO: Enhancing the User Privacy of SSO by Integrating PPI...

引用

Advanced Computing and Endogenous security, International Conference on

作者： Chengqian Guo Fan Lang Qiongxiao Wang Jingqiang Lin State Key Laboratory of Information Security Institute of Information Engineering CAS Data Assurance and Communication Security Research Center CAS School of Cyber Security University of Chinese Academy of Sciences School of Cyber Security University of Science and Technology of China

ISBN: (纸本)9781665424509

Single sign-on (SSO) services are widely deployed on the Internet as the identity management and authentication infrastructure. In an SSO system, after authenticated by the identity providers (IdPs), a user is allowed to log into relying parties (RPs) by submitting an identity proof. However, SSO introduces the potential leakage of user privacy, which is indicated by NIST. That is (a) a curious IdP could track a user's all visits to any RPs and (b) collusive RPs could link the user's identities across different RPs, to learn the user's activity profile. NIST suggests that the Pairwise Pseudonymous Identifier (PPID) should be adopted to prevent collusive RPs from linking the same user, as PPID mechanism enables an IdP to provide a user with multiple individual IDs for different RPs. However, PPID mechanism cannot protect users from IdP's tracking, as it still exposes RP identity to IdP. In this paper, we propose an SSO system, named UP-SSO, providing the enhanced PPID mechanism to protect a user's profile of RP visits from both the curious IdP and the collusive RPs by integrating PPID and SGX. It separates an IdP service into two parts, the server-side service and user-side service. The generation of PPID is shifted from IdP server to user client, so that IdP server no longer needs to learn RP ID. The integrity of user client can be verified by IdP through remote attestation. The detailed design of UP-SSO is described in this paper, and the systemic analysis is provided to guarantee its security. We implemented the prototype system of UP-SSO, and the evaluation of the prototype system shows the overhead is modest.

关键词： Performance evaluation Couplings Privacy Protocols Prototypes Authentication NIST

来源：评论

学校读者我要写书评

暂无评论

Container Anomaly Detection System Based on Rule Mining and Matching

Container Anomaly Detection System Based on Rule Mining and ...

引用

2022 International Conference on Blockchain technology and Information security, ICBCTIS 2022

作者： Yu, Daisong Xie, Yulai Long, Huachao Jin, Minpeng Li, Xuan School of Cyber Science and Engineering Hubei Engineering Research Center on Big Data Security Huazhong University of Science and Technology Wuhan China Wuhan National Lab for Optoelectronics F311 Wuhan China School of Computer Science Huazhong University of Science and Technology Wuhan China Nsfocus Inc. A9-3/F Optical Valley Software Park Wuhan China

ISBN: (数字)9781665496919

ISBN: (纸本)9781665496919

Compared with virtual machine technology, container technology is more and more popular by virtue of its excellent convenience and reliable security isolation. Containers will encounter various anomalies during operation. For maintenance personnel, a large number of abnormal logs makes the work of anomaly analysis very difficult, so anomaly detection technology is needed. In this paper, a container anomaly detection system based on rule mining and matching is proposed, which collects and simplifies the container's logs generated in the abnormal time period, then delivers them to association rule mining algorithm for rule mining and display rules to the maintainer who makes a decision after a simple analysis. The experimental results show that the rule mining algorithm can process log entries in less time consumption compared with traditional association rule mining algorithm, and container anomaly detection system can effectively help system administrator to locate anomalies. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Graph Sampling based Fairness-aware Recommendation over Sensitive Attribute Removal

Graph Sampling based Fairness-aware Recommendation over Sens...

引用

IEEE International Conference on data Mining (ICDM)

作者： Shenghao Liu Guoyang Wu Xianjun Deng Hongwei Lu Bang Wang Laurence Yang James J. Park Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Smart Internet Technology School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea

Discrimination against different user groups has received growing attention in the recommendation field. To address this problem, existing works typically remove sensitive attributes that may cause discrimination through adversary learning to achieve fair recommendations. However, these approaches leverage all available interactions for learning user representations and overlook the fact that different interactions have varying relevance to users’ sensitive attributes. Ignoring this issue may weaken the effectiveness of adversary learning in removing sensitive attributes. To tackle this challenge, we propose a novel model called GS-FairRec, which distinguishes between user interactions to achieve better removal of sensitive attributes. The model consists of three modules: graph sampling-based representation learning, pseudo-user representation learning, and adversarial learning. Firstly, the graph sampling-based representation learning module removes some irrelevant neighbors from a user-item bipartite graph and employs a graph convolutional network (GCN) to learn user/item representations. Next, items that are relevant to a user’s sensitive information but do not match their preferences are defined as the user’s pseudo-interest items, which are leveraged to learn the pseudo-user representation. In the adversarial learning module, the user’s two kinds of representations are fused for adversarial learning to remove sensitive information. Additionally, we design a new metric to measure the model’s ability to remove sensitive attributes based on how a generated recommendation list discloses the user’s sensitive attributes. Finally, we conduct experiments on two real-world datasets, and our results demonstrate the superiority of our proposed model in fairness tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：