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

Annual Conference of the IEEE Industrial Electronics Society

作者： Petros Karvelis George Georgoulas Chsysostomos D. Stylios Ioannis P. Tsoumas Jose Alfonso Antonino-Daviu Maria Jose Picazo Rodenas Vicente Climente-Alarcon Laboratory of Knowledge and Intelligent Computing Technological Educational Institute of Epirus Department of Computer Engineering Larges Drives Products R&D Department Siemens Industry Sector - Drive Technologies Instituto de Ingenieria Energetica Universitat Politecnica de Valencia Department of Electrical Engineering and Automation Aalto University

ISBN: (纸本)9781479940318

Eventual failures in induction machines may lead to catastrophic consequences in terms of economic costs for the companies. The development of reliable systems for fault detection that enable to diagnose a wide range of faults is a motivation of many researchers worldwide. In this context, non-invasive condition monitoring strategies have drawn special attention since they do not require interfering with the operation process of the machine. Though the analysis of the motor currents has proven to be a reliable, non-invasive methodology to detect some of the faults (especially when assessing the rotor condition), it lacks reliability for the diagnosis of other faults (e.g. bearing faults). The infrared thermography has proven to be an excellent, non-invasive tool that can complement the diagnosis reached with the motor current analysis, especially for some specific faults. However, there are still some pending issues regarding its application to induction motor faults diagnosis, such as the lack of automation or the extraction of reliable fault indicators based on the infrared data. This paper proposes a methodology that intends to provide a solution to the first issue: a method based on image segmentation is employed to detect several failures in an automated way. Four specific faults are analyzed: bearing faults, fan failures, rotor bar breakages and stator unbalance. The results show the potential of the technique to automatically identify the fault present in the machine.

关键词： Induction motor Fault diagnosis SIFT Image segmentation Object matching

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: boosting can achieve modality reconcilement 24

ReconBoost: boosting can achieve modality reconcilement

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Cong Hua Qianqian Xu Shilong Bao Zhiyong Yang Qingming Huang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Few-shot learning based histopathological image classification of colorectal cancer

引用

intelligent Medicine 2024年第4期4卷 256-267页

作者： Rui Li Xiaoyan Li Hongzan Sun Jinzhu Yang Md Rahaman Marcin Grzegozek Tao Jiang Xinyu Huang Chen Li Key Laboratory of Intelligent Computing in Medical Image Ministry of EducationNortheastern UniversityShenyangLiaoning 110167China Cancer Hospital China Medical UniversityShenyangLiaoning 110122China Shengjing Hospital China Medical UniversityShenyang.Liaoning 110000China Institute for Medical Informatics University of LuebeckGermany Department of Knowledge Engineering University of Economics in KatowicePoland School of Intelligent Medicine Chengdu University of Traditional Chinese MedicineChengduSichuan 610075China International Joint Institute of Robotics and Intelligent Systems Chengdu University of Information TechnologyChengduSichuan 610225China School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

Background Colorectal cancer is a prevalent and deadly disease worldwide,posing significant diagnostic *** histopathologic image classification is often inefficient and *** some histopathologists use computer-aided diagnosis to improve efficiency,these methods depend heavily on exten-sive data and specific annotations,limiting their *** address these challenges,this paper proposes a method based on few-shot *** This study introduced a few-shot learning approach that combines transfer learning and contrastive learning to classify colorectal cancer histopathology images into benign and malignant *** model comprises modules for feature extraction,dimensionality reduction,and classification,trained using a combi-nation of contrast loss and cross-entropy *** this paper,we detailed the setup of hyperparameters:n-way,κ-shot,β,and the creation of support,query,and test *** Our method achieved over 98% accuracy on a query dataset with 35 samples per category using only 10 training samples per *** documented the model’s loss,accuracy,and the confusion matrix of the ***,we employed the t-SNE algorithm to analyze and assess the model’s classification *** The proposed model may demonstrate significant advantages in accuracy and minimal data depen-dency,performing robustly across all tested n-way,κ-shot *** consistently achieved over 93% accuracy on comprehensive test datasets,including 1916 samples,confirming its high classification accuracy and strong generalization *** research could advance the use of few-shot learning in medical diagnostics and also lays the groundwork for extending it to deal with rare,difficult-to-diagnose cases.

关键词： Colorectal cancer Few-shot learning Transfer learning Contrastive learning Histopathological images Benign and malignant categories

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming 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 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 Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

intelligent Systems'2014 1

引用

丛书名： Advances in intelligent Systems and computing

1000年

作者： P. Angelov K.T. Atanassov L. Doukovska M. Hadjiski V. Jotsov J. Kacprzyk E. Szmidt S. Zadrożny N. Kasabov S. Sotirov

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

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

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security 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 School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ER: Equivariance Regularizer for knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Geometry Interaction knowledge Graph Embeddings

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection

arXiv

引用

arXiv 2023年

作者： He, Junwei Xu, Qianqian Jiang, Yangbangyan Wang, Zitai Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering CAS 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

Graph anomaly detection is crucial for identifying nodes that deviate from regular behavior within graphs, benefiting various domains such as fraud detection and social network. Although existing reconstruction-based methods have achieved considerable success, they may face the Anomaly Overfitting and Homophily Trap problems caused by the abnormal patterns in the graph, breaking the assumption that normal nodes are often better reconstructed than abnormal ones. Our observations indicate that models trained on graphs with fewer anomalies exhibit higher detection performance. Based on this insight, we introduce a novel two-stage framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD). In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. We pretrain graph autoencoders on these augmented graphs at multiple levels, which enables the graph autoencoders to capture normal patterns. In the next stage, the decoders are retrained for detection on the original graph, benefiting from the multi-level representations learned in the previous stage. Meanwhile, we propose the node anomaly distribution regularization to further alleviate Anomaly Overfitting. We validate the effectiveness of our approach through extensive experiments on both synthetic and real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：