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

Proceedings of the 41st International Conference on Machine Learning

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

A local density optimization method based on a graph convolutional network

引用

Frontiers of Information Technology & Electronic engineering 2020年第12期21卷 1795-1803页

作者： Hao WANG Li-yan DONG Tie-hu FAN Ming-hui SUN College of Computer Science and Technology Jilin UniversityChangchun 130012China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin UniversityChangchun 130012China College of Instrumentation&Electrical Engineering Jilin UniversityChangchun 130012China

Success has been obtained using a semi-supervised graph analysis method based on a graph convolutional network(GCN).However,GCN ignores some local information at each node in the graph,so that data preprocessing is incomplete and the model generated is not accurate ***,in the case of numerous unsupervised models based on graph embedding technology,local node information is *** this paper,we apply a local analysis method based on the similar neighbor hypothesis to a GCN,and propose a local density definition;we call this method *** LDGCN algorithm processes the input data of GCN in two methods,i.e.,the unbalanced and balanced ***,the optimized input data contains detailed local node information,and then the model generated is accurate after *** also introduce the implementation of the LDGCN algorithm through the principle of GCN,and use three mainstream datasets to verify the effectiveness of the LDGCN algorithm(i.e.,the Cora,Citeseer,and Pubmed datasets).Finally,we compare the performances of several mainstream graph analysis algorithms with that of the LDGCN *** results show that the LDGCN algorithm has better performance in node classification tasks.

关键词： Semi-supervised learning Graph convolutional network Graph embedding Local density

来源：评论

学校读者我要写书评

暂无评论

Document-level Relation Extraction with Relation Correlations

arXiv

引用

arXiv 2022年

作者： Han, Ridong Peng, Tao Wang, Benyou Liu, Lu Wan, Xiang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

CLDG: Contrastive Learning on Dynamic Graphs

引用

International Conference on Data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Method for Preoperative Prediction of Microvascular Invasion of Hepatocellular Carcinoma

Method for Preoperative Prediction of Microvascular Invasion...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Chen Zhao Tian Bai Tongjia Chu Feng Wei Fa Zhang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Hepatobiliary and Pancreas Department General Surgery Center First Hospital of Jilin University Changchun China School of Medical Technology Beijing Institute of Technology Beijing China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Microvascular invasion (MVI) in hepatocellular carcinoma (HCC) is of great guiding significance for the formulating treatment strategies and accessing the prognosis before the surgery. However, in traditional medicine, the gold standard for the diagnosis of MVI is obtained by examining pathological images which can only be obtained by sampling and sectioning tumors after surgery. At this time, MVI results have lost the timeliness of guiding tumor resection surgery. In order to solve this problem, existing studies began to use deep learning-based methods for preoperative prediction of MVI using non-invasive imaging. Most of these methods adopt the fusion methods of multi-sequence images to predict MVI, but fail to make full use of the characteristics of multiply sequences as prior knowledge to combine into the model, resulting in no further improvement of prediction performance. So we propose a multi-sequence image difference and correlation deep learning model. The model can extract the difference and correlation information between sequences from different scales and combine them into the model. To validate proposed model, we collected a data set consists of 120 HCC patients, including 50 MVI-positive patients. Compared with existing studies, our method has greatly improved in all evaluation metrics.

关键词： Deep learning Pathology Correlation Biological system modeling Surgery Predictive models Data mining

来源：评论

学校读者我要写书评

暂无评论

AutoSTL: Automated Spatio-Temporal Multi-Task Learning

arXiv

引用

arXiv 2023年

作者： Zhang, Zijian Zhao, Xiangyu Miao, Hao Zhang, Chunxu Zhao, Hongwei Zhang, Junbo College of Computer Science and Technology Jilin University China School of Data Science City University of Hong Kong Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China Department of Computer Science Aalborg University Denmark JD Intelligent Cities Research China JD iCity JD Technology China Hong Kong Institute for Data Science City University of Hong Kong Hong Kong

Spatio-temporal prediction plays a critical role in smart city construction. Jointly modeling multiple spatio-temporal tasks can further promote an intelligent city life by integrating their inseparable relationship. However, existing studies fail to address this joint learning problem well, which generally solve tasks individually or a fixed task combination. The challenges lie in the tangled relation between different properties, the demand for supporting flexible combinations of tasks and the complex spatio-temporal dependency. To cope with the problems above, we propose an Automated Spatio-Temporal multi-task Learning (AutoSTL) method to handle multiple spatio-temporal tasks jointly. Firstly, we propose a scalable architecture consisting of advanced spatio-temporal operations to exploit the complicated dependency. Shared modules and feature fusion mechanism are incorporated to further capture the intrinsic relationship between tasks. Furthermore, our model automatically allocates the operations and fusion weight. Extensive experiments on benchmark datasets verified that our model achieves state-of-the-art performance. As we can know, AutoSTL is the first automated spatio-temporal multi-task learning method. Copyright © 2023, The Authors. All rights reserved.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Bi-classifier with neighborhood aggregation for unsupervised domain adaptation

引用

Information Sciences 2025年 718卷

作者： Shuai Lü Xinyu Zhang Zongze Li Jingyao Li Meng Kang Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China College of Software Jilin University Changchun 130012 China

Recently, adversarial learning with bi-classifier has been confirmed to be effective in unsupervised domain adaptation, which can effectively promote the alignment of different distributions across domains. Most previous methods with bi-classifier exploit the output disagreement of the bi-classifier to learn transferable representations. However, only considering the disagreement between two classifiers cannot guarantee that the model performs well in the target domain. The main reason is that the model does not consider the local structure of the target domain data. To address this problem, we propose a Bi-Classifier with Neighborhood Aggregation (BCNA). Specifically, we provide two pseudo-labels for a target sample based on the nearest neighbor aggregation strategy. Then, we propose a self-supervised loss with two pseudo-labels based on confidence weight. In addition, we also propose a novel consistency regularization loss for bi-classifier. Unlike previous methods with bi-classifier, we achieve the goal of minimizing the disagreement between two classifiers from the perspective of different views of the sample. Our method can increase the discriminability of the model while ensuring the feature transferability. Extensive experiments show that our method has achieved state-of-the-art performance on three datasets that are widely used in unsupervised domain adaptation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Survey of Sum-Product Networks Structural Learning

SSRN

引用

SSRN 2022年

作者： Xia, Riting Zhang, Yan Liu, Xueyan Yang, Bo School of Artificial Intelligence Jilin University Jilin Changchun130012 China School of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineer Jilin University Ministry of Education Jilin Changchun130012 China College of Communication Engineering Jilin University Jilin Changchun130012 China

Sum-product networks (SPNs) in deep probabilistic models have made great progress in computer vision, robotics, neuro-symbolic artificial intelligence, natural language processing, probabilistic programming languages, and other fields. Compared with probabilistic graphical models and deep probabilistic models, SPNs can balance the tractability and expressive efficiency. In addition, SPNs remain more interpretable than deep neural models. The expressiveness and complexity of SPNs depend on its own structure. Thus, how to design an effective SPN structure learning algorithm that can balance expressiveness and complexity has become a hot research topic in recent years. In this paper, we review SPN structure learning comprehensively, including the motivation of SPN structure learning, a systematic review of related theories, the proper categorization of different SPN structure learning algorithms, several evaluation approaches and some helpful online resources. Moreover, we discuss some open issues and research directions for SPN structure learning. To our knowledge, this is the first survey to focus specifically on SPN structure learning, and we hope to provide useful references for researchers in related fields. © 2022, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Attentive Implicit Relation Embedding for Social Recommendation

SSRN

引用

SSRN 2022年

作者： Ma, Xintao Dong, Liyan Wang, Yuequn Li, Yongli Liu, Zhen Zhang, Hao College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Information Science and Technology Northeast Normal University Changchun130117 China Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

Nowadays, recommendation system incorporating social networks has attracted a lot of research attention and is widely used to understand user preferences regarding social relations. Besides, graph neural networks(GNNs) have proven to learn graph-structured data effectively. Thus, integrating GNN into social recommendations has become one challenge. Many approaches encode both the user-item interaction and social relations to learn user preference. However, the implicit relations are also crucial to understanding the features of users and items. Thus, we propose the attentive implicit relation embedding for social recommendation(SR-AIR), which models the user-item interaction and social networks, utilizing a graph attention mechanism on implicit relations of users and items. We evaluate our framework on two real-world datasets and demonstrate that our framework performs the best compared with state-of-the-art baselines © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：