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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Jian, Zhongquan Wang, Yancheng Wu, Weichao Yao, Junfeng Wang, Meihong Wu, Qingqiang School of Informatics Xiamen University Xiamen China School of Film Xiamen University Xiamen China School of Computing and Data Science Xiamen University Malaysia Selangor Malaysia School of Mechanics and Civil Engineering China University of Mining & Technology Beijing China Xiamen Key Laboratory of Intelligent Storage and Computing School of Informatics Xiamen University Xiamen China Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen China

ISBN: (纸本)9798350368741

Recognizing emotions in dialogues is vital for effective human-computer interaction, yet remains a challenging task in Natural Language Processing (NLP). Previous studies in Emotion Recognition in Conversation (ERC) have primarily focused on contextual features, while overlooking the importance of emotional features in emotion recognition. To address this gap, we focus on the role of emotional features in ERC and propose a novel method, Emotional Knowledge Self-Distillation (EmoKSD1), to enhance the model's emotional sensitivity. In EmoKSD, utterances are enriched with implicit 〈mask〉 tokens to represent conveyed emotions, allowing the distillation of emotional knowledge from explicit emotional tokens to implicit 〈mask〉 tokens, thereby enhancing the model's ability to perceive subtle emotions within the dialogue. Through thorough evaluations on two public ERC datasets (i.e., IEMOCAP and MELD) using proposed coarse-grained utterance distillation and fine-grained token distillation techniques, EmoKSD demonstrates superior performance compared to existing methods, highlighting the significance of emotional features in ERC. © 2025 IEEE.

关键词： Dialogue System Emotion Recognition in Conversation Knowledge Distillation Natural Language Processing

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Nonnegative Matrix Factorization Based on Topology-and-Attribute-Matching Degree for Community Detection 18th

Nonnegative Matrix Factorization Based on Topology-and-Attr...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Zeng, Ruolan Liu, Zhanghui Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819996360

Community detection is widely used in network analysis, which seeks to divide network nodes into distinct communities based on the topology structure and attribute information of the network. Due to its interpretability, nonnegative matrix factorization becomes an essential method for community detection. However, it decomposes the adjacency matrix and attribute matrix separately, which do not tightly incorporate topology and attributes. And in the problem of division inconsistency based on topology and attributes caused by the mismatch between the topology similarity and attribute similarity of paired nodes, it ignores the difference in the matching degree of each attribute and each node. In this paper, we propose a nonnegative matrix factorization algorithm for community detection (MTACD) based on the matching degree between topology and attribute. First, we employ an attribute embedding mechanism to enhance the node-attribute relationship. Second, we design an attribute matching degree and a node topology-and-attribute matching degree in order to resolve the mismatch between topology and attribute similarity. Experiments on both real-world and synthetic networks demonstrate the effectiveness of our algorithm. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Generalized Self-Adaption Network for Domain Adaptation

Generalized Self-Adaption Network for Domain Adaptation

引用

Artificial Intelligence and intelligent Information Processing (AIIIP), International Conference on

作者： Yongheng Bian Xiao Ke Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China

The purpose of domain adaptation is to transfer knowledge learned in the labeled source domain to unlabeled but related target domains without requiring a large number of target domain labels. The latest method of domain adaptation mainly adjusts the distribution of the source and target domains to adapt to the target domain. Despite significant success, when there are significant distribution differences between the source and target domains, the adaptability in the target domain still decreases, which may be due to insufficient exploration of domain specific features leading to domain offset issues. To address this issue, we propose the GSA-NET framework in this article. We designed an adversarial dropout method to improve the generalization performance of the model in the target domain by pushing the decision boundary away from the feature dense region. At the same time, in order to effectively match the distribution of advanced features across domains, we deploy feature adaptation modules before the classification layer, which can significantly reduce domain differences. Our experiments on two cross domain benchmarks, Office Home and Office-31, have shown that the proposed method is significantly superior to existing methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Object Detection Based on Generalized Features

Few-Shot Object Detection Based on Generalized Features

引用

Artificial Intelligence and intelligent Information Processing (AIIIP), International Conference on

作者： Qiuqin Chen Xiao Ke Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou Fuzhou China

Few-shot object detection aims to rapidly detect novel classes of objects using a minimal number of annotated instances. Compared to methods such as meta-learning, few-shot object detection based on transfer learning can achieve better performance. However, when training on base-class datasets, the model gradually improves its detection performance on base classes but does not enhance its generalization. A base-class model lacking generalization tends to result in lower detection performance for novel classes during fine-tuning. To address the aforementioned issues, this paper tackles the problem from two aspects: firstly, we introduce the Confusion-Dropblock Module (CDM) to perturb the model's features, thus enhancing feature generalization. Secondly, we incorporate Deformable Convolution Modules to mitigate the impact of object shapes and sizes on detection performance, thereby improving overall detection performance. Experimental results on the COCO dataset demonstrate the effectiveness of the proposed algorithm, outperforming the compared methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-based Multi-task Network for intelligent Management of Garbage Deposit Points 11

Deep Learning-based Multi-task Network for Intelligent Manag...

引用

11th International Conference on Information Technology in Medicine and Education, ITME 2021

作者： Wang, Yezhen Zheng, Haobin Mao, Changjiang Zhang, Jing Ke, Xiao Fuzhou University College of Computer and Data Science China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9781665406796

With the economic and social development and the substantial improvement of material conditions, the generation of domestic waste has grown rapidly and has become a constraint factor for the development of new urbanization. In the past few years, research on the domestic waste industry has been limited to intelligent waste sorting, neglecting the role of intelligent management of waste storage sites. To relieve it, We propose a deep learning-based multi-task network for intelligent management of garbage deposit points, which combines algorithms such as YoloV5,Deepsort, Insightface, and Openpose to achieve waste bin detection, waste bin status recognition and analysis, face recognition, action recognition, and multiple object tracking based on real-time surveillance video. Besides, we propose a new dataset named Waste Bin Status, which provides a meaningful addition to the existing field of waste bin identification. Experiments on WBS dataset validate that our method is superior to other methods for garbage point status identification. Moreover, our network is trained to work with different scenarios of garbage deposits, demonstrating state-of-the-art performance in real-world tests. © 2021 IEEE.

关键词： Deposits

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques 38

Suppress Content Shift: Better Diffusion Features via Off-th...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features 38

Not All Diffusion Model Activations Have Been Evaluated as D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification 39

Bidirectional Logits Tree: Pursuing Granularity Reconcilemen...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Zhiguang Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

ISBN: (纸本)157735897X

This paper addresses the challenge of Granularity Competition in fine-grained classification tasks, which arises due to the semantic gap between multi-granularity labels. Existing approaches typically develop independent hierarchy-aware models based on shared features extracted from a common base encoder. However, because coarse-grained levels are inherently easier to learn than finer ones, the base encoder tends to prioritize coarse feature abstractions, which impedes the learning of fine-grained features. To overcome this challenge, we propose a novel framework called the Bidirectional Logits Tree (BiLT) for Granularity Reconcilement. The key idea is to develop classifiers sequentially from the finest to the coarsest granularities, rather than parallelly constructing a set of classifiers based on the same input features. In this setup, the outputs of finer-grained classifiers serve as inputs for coarser-grained ones, facilitating the flow of hierarchical semantic information across different granularities. On top of this, we further introduce an Adaptive Intra-Granularity Difference Learning (AIGDL) approach to uncover subtle semantic differences between classes within the same granularity. Extensive experiments demonstrate the effectiveness of our proposed method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification

arXiv

引用

arXiv 2024年

关键词： Coarse-grained modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：