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

Proceedings of the 38th International Conference on Neural Information Processing Systems

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

ISBN: (纸本)9798331314385

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 https://***/Darkbblue/generic-diffusion-feature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Order-preserving pattern mining with forgetting mechanism

arXiv

引用

arXiv 2024年

作者： Li, Yan Ma, Chenyu Gao, Rong Wu, Youxi Li, Jinyan Wang, Wenjian Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300400 China School of Artificial Intelligence Hebei University of Technology Tianjin300400 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Computer and Information Technology Shanxi University Taiyuan237016 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important;however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed. Copyright © 2024, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Learning Group-Disentangled Representation for Interpretable Thoracic Pathologic Prediction

Learning Group-Disentangled Representation for Interpretable...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hao Li Yirui Wu Hexuan Hu Hu Lu Yong Lai Shaohua Wan Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University College of Computer and Information Hohai University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Computer Science and Communication Engineering Jiangsu University Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Deep learning methods have shown significant performance in medical image analysis tasks. However, they generally act like ”black box” without explanations in both feature extraction and decision processes, leading to lack of clinical insights and high risk assessments. To aid deep learning in envisioning diseases with visual clues, we propose Representation Group-Disentangling Network (RGD-Net), which can completely disentangle feature space of input X-ray images into several independent feature groups, each corresponding to a specific disease. Taking several semantically related and labeled X-ray images as input, RGD-Net firstly extracts completely group-disentangled representations of diseases through Group-Disentangle Module, which applies group-swap and linking operations to construct latent space by enforcing semantic consistency of attributes. To prevent learning degenerate representations defined as shortcut problem, we further introduce adversarial constricts on mapping from features to diseases, thus avoiding model collapse with former free-form disentanglement. Experiments on chestxray-14 and ChestXpert datasets demonstrate that RGD-Net are effective in predicting diseases with remarkable advantages, which leverage potential factors contributing to different diseases, thus enhancing interpretability in working patterns of deep learning methods.

关键词： Deep learning Training Visualization Image analysis Semantics Feature extraction Risk management

来源：评论

学校读者我要写书评

暂无评论

Adaptive Loose Optimization for Robust Question Answering

arXiv

引用

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Wang, Zewei Kong, Dechen Hu, Min Han, Ting Liu, Jun The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The China Mobile Research Institute China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Question answering methods are well-known for leveraging data bias, such as the language prior in visual question answering and the position bias in machine reading comprehension (extractive question answering). Current debiasing methods often come at the cost of significant in-distribution performance to achieve favorable out-of-distribution generalization ability, while non-debiasing methods sacrifice a considerable amount of out-of-distribution performance in order to obtain high in-distribution performance. Therefore, it is challenging for them to deal with the complicated changing real-world situations. In this paper, we propose a simple yet effective novel loss function with adaptive loose optimization, which seeks to make the best of both worlds for question answering. Our main technical contribution is to reduce the loss adaptively according to the ratio between the previous and the current optimization state on mini-batch training data. This loose optimization can be used to prevent non-debiasing methods from overlearning data bias while enabling debiasing methods to maintain slight bias learning. Experiments on the visual question answering datasets, including VQA v2, VQA-CP v1, VQA-CP v2, GQA-OOD, and the extractive question answering dataset SQuAD demonstrate that our approach enables QA methods to obtain state-of-the-art in- and out-of-distribution performance in most cases. The source code has been released publicly in https://***/reml-group/ALO. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Synthetic Instance Segmentation from Semantic Image Segmentation Masks

arXiv

引用

arXiv 2023年

作者： Shen, Yuchen Zhang, Dong Zhang, Zhao Fu, Liyong Ye, Qiaolin College of Information Science and Technology & Artificial Intelligence Nanjing Forestry University Jiangsu Nanjing210037 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei230009 China College of Information Science and Technology Nanjing Forestry University Jiangsu Nanjing210037 China Institute of Forest Resource Information Techniques Chinese Academy of Forestry Beijing100091 China

In recent years, instance segmentation has garnered significant attention across various applications. However, training a fully-supervised instance segmentation model requires costly both instance-level and pixel-level annotations. In contrast, weakly-supervised instance segmentation methods, such as those using image-level class labels or point labels, often struggle to satisfy the accuracy and recall requirements of practical scenarios. In this paper, we propose a novel paradigm called Synthetic Instance Segmentation (SISeg). SISeg achieves instance segmentation results by leveraging image masks generated by existing semantic segmentation models, and it is highly efficient as we do not require additional training for semantic segmentation or the use of instance-level image annotations. In other words, the proposed model does not need extra manpower or higher computational expenses. Specifically, we first obtain a semantic segmentation mask of the input image via an existent semantic segmentation model. Then, we calculate a displacement field vector for each pixel based on the segmentation mask, which can indicate representations belonging to the same class but different instances, i.e., obtaining the instance-level object information. Finally, the instance segmentation results are refined by a learnable category-agnostic object boundary branch. Extensive experimental results on two challenging datasets highlight the effectiveness of SISeg in achieving competitive results when compared to state-of-the-art methods, especially fully-supervised methods. The code will be released at: SISeg Copyright © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Review of Multimodal Explainable Artificial Intelligence: Past, Present and Future

arXiv

引用

arXiv 2024年

作者： Sun, Shilin An, Wenbin Tian, Feng Nan, Fang Liu, Qidong Liu, Jun Shah, Nazaraf Chen, Ping School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an710049 China Faculty of Electronic and Information Engineering Xi’an Jiaotong University Xi’an710049 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an710049 China Institute for Future Transport and Cities Coventry University Priory Street CoventryCV1 5FB United Kingdom Department of Engineering University of Massachusetts Boston BostonMA02125 United States

Artificial intelligence (AI) has rapidly developed through advancements in computational power and the growth of massive datasets. However, this progress has also heightened challenges in interpreting the "black-box" nature of AI models. To address these concerns, eXplainable AI (XAI) has emerged with a focus on transparency and interpretability to enhance human understanding and trust in AI decision-making processes. In the context of multimodal data fusion and complex reasoning scenarios, the proposal of Multimodal eXplainable AI (MXAI) integrates multiple modalities for prediction and explanation tasks. Meanwhile, the advent of Large Language Models (LLMs) has led to remarkable breakthroughs in natural language processing, yet their complexity has further exacerbated the issue of MXAI. To gain key insights into the development of MXAI methods and provide crucial guidance for building more transparent, fair, and trustworthy AI systems, we review the MXAI methods from a historical perspective and categorize them across four eras: traditional machine learning, deep learning, discriminative foundation models, and generative LLMs. We also review evaluation metrics and datasets used in MXAI research, concluding with a discussion of future challenges and directions. A project related to this review has been created at https://***/ShilinSun/mxai_review. Copyright © 2024, The Authors. All rights reserved.

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

Robust Low-rank Deep Feature Recovery in CNNs: Toward Low Information Loss and Fast Convergence

Robust Low-rank Deep Feature Recovery in CNNs: Toward Low In...

引用

IEEE International Conference on data Mining (ICDM)

作者： Jiahuan Ren Zhao Zhang Jicong Fan Haijun Zhang Mingliang Xu Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Data Science The Chinese University of Hong Kong (Shenzhen) & Shenzhen Research Institute of Big Data Shenzhen China Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Engineering Zhengzhou University Zhengzhou China

ISBN: (纸本)9781665423991

Convolutional Neural Networks (CNNs)-guided deep models have obtained impressive performance for image representation, however the representation ability may still be restricted and usually needs more epochs to make the model converge in training, due to the useful information loss during the convolution and pooling operations. We therefore propose a general feature recovery layer, termed Low-rank Deep Feature Recovery (LDFR), to enhance the representation ability of the convolutional features by seamlessly integrating low-rank recovery into CNNs, which can be easily extended to all existing CNNs-based models. To be specific, to recover the lost information during the convolution operation, LDFR aims at learning the low-rank projections to embed the feature maps onto a low-rank subspace based on some selected informative convolutional feature maps. Such low-rank recovery operation can ensure all convolutional feature maps to be reconstructed easily to recover the underlying subspace with more useful and detailed information discovered, e.g., the strokes of characters or the texture information of clothes can be enhanced after LDFR. In addition, to make the learnt low-rank subspaces more powerful for feature recovery, we design a fusion strategy to obtain a generalized subspace, which averages over all learnt sub-spaces in each LDFR layer, so that the convolutional feature maps in test phase can be recovered effectively via low-rank embedding. Extensive results on several image datasets show that existing CNNs-based models equipped with our LDFR layer can obtain better performance.

关键词： Training Image recognition Convolution Conferences Image representation data mining Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

Suppress content shift: better diffusion features via off-th...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

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

ISBN: (纸本)9798331314385

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 https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Privileged graph distillation for cold start recommendation

arXiv

引用

arXiv 2021年

作者： Wang, Shuai Zhang, Kun Wu, Le Ma, Haiping Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Anhui University China

The cold start problem in recommender systems is a long-standing challenge, which requires recommending to new users (items) based on attributes without any historical interaction records. In these recommendation systems, warm users (items) have privileged collaborative signals of interaction records compared to cold start users (items), and these Collaborative Filtering (CF) signals are shown to have competing performance for recommendation. Many researchers proposed to learn the correlation between collaborative signal embedding space and the attribute embedding space to improve the cold start recommendation, in which user and item categorical attributes are available in many online platforms. However, the cold start recommendation is still limited by two embedding spaces modeling and simple assumptions of space transformation. As user-item interaction behaviors and user (item) attributes naturally form a heterogeneous graph structure, in this paper, we propose a privileged graph distillation model (PGD). The teacher model is composed of a heterogeneous graph structure for warm users and items with privileged CF links. The student model is composed of an entity-attribute graph without CF links. Specifically, the teacher model can learn better embeddings of each entity by injecting complex higher-order relationships from the constructed heterogeneous graph. The student model can learn the distilled output with privileged CF embeddings from the teacher embeddings. Our proposed model is generally applicable to different cold start scenarios with new user, new item, or new user-new item. Finally, extensive experimental results on the real-world datasets clearly show the effectiveness of our proposed model on different types of cold start problems, with average 6.6%, 5.6%, and 17.1% improvement over state-of-the-art baselines on three datasets, respectively. © 2021, CC BY.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Dist-PU: Positive-Unlabeled Learning from a Label Distribution Perspective

arXiv

引用

arXiv 2022年

作者： Zhao, Yunrui Xu, Qianqian Jiang, Yangbangyan Wen, Peisong Huang, Qingming School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

Positive-Unlabeled (PU) learning tries to learn binary classifiers from a few labeled positive examples with many unlabeled ones. Compared with ordinary semi-supervised learning, this task is much more challenging due to the absence of any known negative labels. While existing cost-sensitive-based methods have achieved state-of-the-art performances, they explicitly minimize the risk of classifying unlabeled data as negative samples, which might result in a negative-prediction preference of the classifier. To alleviate this issue, we resort to a label distribution perspective for PU learning in this paper. Noticing that the label distribution of unlabeled data is fixed when the class prior is known, it can be naturally used as learning supervision for the model. Motivated by this, we propose to pursue the label distribution consistency between predicted and ground-truth label distributions, which is formulated by aligning their expectations. Moreover, we further adopt the entropy minimization and Mixup regularization to avoid the trivial solution of the label distribution consistency on unlabeled data and mitigate the consequent confirmation bias. Experiments on three benchmark datasets validate the effectiveness of the proposed method. Code available at: https://***/Ray-rui/Dist-PU-Positive-UnlabeledLearning-from-a-Label-Distribution-Perspective. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：