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

International Conference on computer Supported Cooperative Work in Design

作者： Xiaoyang Li Zhenyu Yang Yiwen Li Zhijun 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

Emotion recognition in conversation (ERC) is a prominent research topic in natural language processing, widely applicable in various scenarios. However, accessing external commonsense knowledge and related dialogue topics, along with the complexity of fusing utterances, presents significant challenges. In this paper, we introduce a Topic-based Multilayer Knowledge Filtering (TMKF) model to enhance dialog emotion recognition accuracy. TMKF acquires commonsense knowledge for each utterance and employs two Variational Autoencoder (VAE) modules to extract global and speaker-level dialogue topics. We utilize Global Knowledge Filtering (GKF) and Local Knowledge Filtering (LKF) to obtain topic-specific knowledge representations after filtering commonsense information through global and local topic hierarchies. Subsequently, we leverage relational graphs to convolve commonsense knowledge with utterances, resulting in knowledge-constrained utterance representations for classification. Our proposed model is evaluated through extensive experiments on four widely used benchmark datasets for conversational emotion recognition. The results underscore the effectiveness of TMKF, which significantly outperforms other methods in standard metric evaluations.

关键词： Measurement Emotion recognition Filtering Convolution Oral communication Benchmark testing Nonhomogeneous media

来源：评论

学校读者我要写书评

暂无评论

Entangling Quantum Memories via Heralded Photonic Bell Measurement

Entangling Quantum Memories via Heralded Photonic Bell Measu...

引用

Optica Quantum 2.0 Conference and Exhibition, Quantum 2.0

作者： Dhara, Prajit Englund, Dirk R. Guha, Saikat Wyant College of Optical Sciences The University of Arizona TucsonAZ85721 United States NSF-ERC Center for Quantum Networks The University of Arizona TucsonAZ85721 United States Research Laboratory of Electronics Massachusetts Institute of Technology CambridgeMA02139 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

We evaluate the quality of entangled states generated on quantum network links based on entanglement swapping. Network non-idealities in conjunction with physical memory decoherence models are incorporated to demonstr... 详细信息

ISBN: (纸本)9781957171272

关键词： Defect center materials Modes Optical fibers Photonic entanglement Quantum memories Quantum teleportation

来源：评论

学校读者我要写书评

暂无评论

TSFE: Research on Transformer and Feature Enhancement Methods for Image-Text Retrieval

TSFE: Research on Transformer and Feature Enhancement Method...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Jinxiao Yang Xingang Wang Qingao Wang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong 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

In recent years, cross-modal retrieval has a wide range of applications in fields such as information retrieval and multimedia processing, where the key is to find relevant data in another modality through one modal query. In cross-modal graphic retrieval, mutual attention mechanisms are commonly used to interact image and text features. However, this interaction mechanism makes it difficult to extract separate visual and textual features for subsequent indexing steps, especially in large-scale retrieval tasks. Furthermore, in image representation, non-semantic information in image features can lead to inaccuracies in the alignment of image and text features. Therefore this paper proposes a Transformer and Feature Enhancement Method (TSFE) for Image-Text Retrieval. The method better fuses the underlying features and the higher level features by using a hierarchical Transformer coding structure on two separate branches, image and text, to proofread and localise the final output features. The Feature Enhanced Attention (FEA) module is designed in order to infer non-semantic information in the image and enhance the features of salient regions. Channel-space attention and max pooling is introduced on top of Transformer encoder self-attention to filter redundant and interfering information from channel and spatial dimensions. Experiments on Flickr30k dataset and MS-COCO dataset in this paper show improved performance in cross-modal retrieval, thus validating the effectiveness and sophistication of the proposed method.

关键词： Visualization Semantics Pipelines Noise Image representation Transformers Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CAFI: News Recommendation with Candidate Perception of Fine-Grained Interaction Information

CAFI: News Recommendation with Candidate Perception of Fine-...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yiwen Li Zhenyu Yang Xiaoyang Li Zhijun 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

The most critical task in personalized news recommendation is to perform exact matching between candidate news and users’ interests. Existing news recommendation methods usually model users’ interests from historical clicked news items without considering candidate news, which makes it difficult to precisely match candidate news with users’ interests. Moreover, it is challenging to distinguish similar news when forming a vector representation. Simply adding candidate news to the user interest modeling process without considering word-level information does not provide sufficient discrimination for recommending appropriate news. In this paper, we propose a news recommendation model with candidate-aware fine-grained interaction information (CAFI). In our approach, we propose a fine-grained interaction module that matches candidate news items and text fragments of each historical news item at each semantic granularity to achieve interaction between the two at the word level and help similar historical news form more specific and accurate representations. In addition, our proposed gated self-attention mechanism utilizes the candidate news features as channel moderation gates to implement the process of filtering out information that is irrelevant to the candidate news for learning user interest representations, thereby better matching the candidate news to specific user interests. Experiments conducted on the large real-world Microsoft News Dataset (MIND) show that our model significantly outperforms the previously developed models in terms of all metrics. Our code is published at the following URL: https://***/liyiweneven/CAFI.

关键词： Uniform resource locators Measurement Codes Filtering Federated learning Semantics Focusing

来源：评论

学校读者我要写书评

暂无评论

Each Fake News is Fake in its Own Way: An Attribution Multi-Granularity Benchmark for Multimodal Fake News Detection

arXiv

引用

arXiv 2024年

作者： Guo, Hao Ma, Zihan Zeng, Zhi Luo, Minnan Zeng, Weixin Tang, Jiuyang Zhao, Xiang Laboratory for Big Data and Decision Nation University of Defence Technology China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China

Social platforms, while facilitating access to information, have also become saturated with a plethora of fake news, resulting in negative consequences. Automatic multimodal fake news detection is a worthwhile pursuit. Existing multimodal fake news datasets only provide binary labels of real or fake. However, real news is alike, while each fake news is fake in its own way. These datasets fail to reflect the mixed nature of various types of multimodal fake news. To bridge the gap, we construct an attributing multi-granularity multimodal fake news detection dataset AMG, revealing the inherent fake pattern. Furthermore, we propose a multi-granularity clue alignment model MGCA to achieve multimodal fake news detection and attribution. Experimental results demonstrate that AMG is a challenging dataset, and its attribution setting opens up new avenues for future research. © 2024, CC BY-NC-ND.

关键词： Fake detection

来源：评论

学校读者我要写书评

暂无评论

Opinion-Tree-guided Contrastive Learning for Aspect Sentiment Quadruple Prediction

Opinion-Tree-guided Contrastive Learning for Aspect Sentimen...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Zhijun Li Zhenyu Yang Yiwen 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

In recent years, aspect sentiment quadruple prediction (ASQP) has become a popular task in the field of aspect-based sentiment analysis. When modeling comment statements, it is often necessary to consider structural information between sentiment labels. Existing approaches categorize these labels by encoding text and dependency tree structures separately and then incorporating their representations, but this approach fails to effectively capture the structural information between sentiment labels. To address this problem, we propose a method for ASQP called Opinion-Tree-guided Contrastive Learning (OTCL), which embeds structural information directly into the text instead of modeling it separately. Specifically, OTCL utilizes the opinion tree structure to guide the construction of positive samples of the input text during training. By associating the input text with its positive samples, the text encoder can learn to generate textual representations associated with the opinion tree structure. We validate the effectiveness of our method on two commonly used datasets.

关键词： Training Sentiment analysis Federated learning Contrastive learning Predictive models Encoding Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

HGTA: News Recommendation Based on Hierarchical Granular Semantic Embeddings and Threshold Attention

HGTA: News Recommendation Based on Hierarchical Granular Sem...

引用

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

来源：评论

学校读者我要写书评

暂无评论

FSSA: Efficient 3-Round Secure Aggregation for Privacy-Preserving Federated Learning

arXiv

引用

arXiv 2023年

作者： Luo, Fucai Al-Kuwari, Saif Wang, Haiyan Yan, Xingfu College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou China College of Science and Engineering Hamad Bin Khalifa University Doha Qatar Department of New Networks Peng Cheng Laboratory Shenzhen China School of Computer Science South China Normal University Guangzhou China

Federated learning (FL) allows a large number of clients to collaboratively train machine learning (ML) models by sending only their local gradients to a central server for aggregation in each training iteration, without sending their raw training data. Unfortunately, recent attacks on FL demonstrate that local gradients may leak information about local training data. In response to such attacks, Bonawitz et al. (CCS 2017) proposed a secure aggregation protocol that allows a server to compute the sum of clients’ local gradients in a secure manner. However, their secure aggregation protocol requires at least 4 rounds of communication between each client and the server in each training iteration. The number of communication rounds is closely related not only to the total communication cost but also the ML model accuracy, as the number of communication rounds affects client dropouts. In this paper, we propose FSSA, a 3-round secure aggregation protocol, that is efficient in terms of computation and communication, and resilient to client dropouts. We prove the security of FSSA in honest-but-curious setting and show that the security can be maintained even if an arbitrarily chosen subset of clients drop out at any time. We evaluate the performance of FSSA and show that its computation and communication overhead remains low even on large datasets. Furthermore, we conduct an experimental comparison between FSSA and Bonawitz et al.’s protocol. The comparison results show that, in addition to reducing the number of communication rounds, FSSA achieves a significant improvement in computational efficiency. © 2023, CC BY-NC-ND.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：