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

arXiv 2023年

作者： Khatun, Rupali Chatterjee, Soumick Bert, Christoph Wadepohl, Martin Ott, Oliver J. Semrau, Sabine Fietkau, Rainer Nürnberger, Andreas Gaipl, Udo S. Frey, Benjamin Department of Radiation Oncology Universitätsklinikum Erlangen Friedrich-Alexnder-Universität Erlangen-Nürnberg Erlangen Germany Department of Radiation Oncology Universitätsklinikum Erlangen Friedrich-Alexnder-Universität Erlangen-Nürnberg Erlangen Germany Comprehensive Cancer Centre Erlangen-EMN Erlangen Germany Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Dr Sennewald Medizintechnik GmbH Munich Germany

Hyperthermia (HT) in combination with radio- and/or chemotherapy has become an accepted cancer treatment for distinct solid tumour entities. In HT, tumour tissue is exogenously heated to temperatures between 39 and 43 °C for 60 minutes. Temperature monitoring can be performed non-invasively using dynamic magnetic resonance imaging (MRI). However, the slow nature of MRI leads to motion artefacts in the images due to the movements of patients during image acquisition. By discarding parts of the data, the speed of the acquisition can be increased - known as undersampling. However, due to the invalidation of the Nyquist criterion, the acquired images might be blurry and can also produce aliasing artefacts. The aim of this work was, therefore, to reconstruct highly undersampled MR thermometry acquisitions with better resolution and with fewer artefacts compared to conventional methods. The use of deep learning in the medical field has emerged in recent times, and various studies have shown that deep learning has the potential to solve inverse problems such as MR image reconstruction. However, most of the published work only focuses on the magnitude images, while the phase images are ignored, which are fundamental requirements for MR thermometry. This work, for the first time, presents deep learning-based solutions for reconstructing undersampled MR thermometry data. Two different deep learning models have been employed here, the Fourier Primal-Dual network and the Fourier Primal-Dual UNet, to reconstruct highly undersampled complex images of MR thermometry. MR images of 44 patients with different sarcoma types who received HT treatment in combination with radiotherapy and/or chemotherapy were used in this study. The method reduced the temperature difference between the undersampled MRIs and the fully sampled MRIs from 1.3 °C to 0.6 °C in full volume and 0.49 °C to 0.06 °C in the tumour region for an acceleration factor of 10. Copyright © 2023, The Authors. All rights res

关键词： Chemotherapy

来源：评论

学校读者我要写书评

暂无评论

Ontology Revision based on Pre-trained Language Models

arXiv

引用

arXiv 2023年

作者： Ji, Qiu Zhang, Xiaoping Ye, Yuxin Qi, Guilin Li, Jiaye Li, Site Ren, Jianjie Lu, Songtao School of Modern Posts Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China National Data Center ofTraditional Chinese MedicineChina Academy of ChineseMedical Sciences Beijing100700 China College of Computer Science and Technology Jilin University Changchun130012 China School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Mathematics Southeast University Nanjing China Chien-Shiung Wu College Southeast University Nanjing China

Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology and plays a crucial role in tasks such as ontology evolution, ontology maintenance, and ontology alignment. Similar to repair single ontologies, resolving logical incoherence in the task of ontology revision is also important and meaningful, because incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers. To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms in an ontology. However, they rarely consider axiom semantics which provides important information to differentiate axioms. In addition, pre-trained models can be utilized to encode axiom semantics, and have been widely applied in many natural language processing tasks and ontology-related ones in recent years. Therefore, in this paper, we study how to apply pre-trained models to revise ontologies. We first define four scoring functions to rank axioms based on a pre-trained model by considering various information from an ontology. Based on the functions, an ontology revision algorithm is then proposed to deal with unsatisfiable concepts at once. To improve efficiency, an adapted revision algorithm is designed to deal with unsatisfiable concepts group by group. We conduct experiments over 19 ontology pairs and compare our algorithms and scoring functions with existing ones. According to the experiments, our algorithms could achieve promising performance. The adapted revision algorithm could improve the efficiency largely, and at most about 90% of the time could be saved for some ontology pairs. Some of our scoring functions like reliableOnt cos could help a revision algorithm obtain better results in many cases, especially for those challenging ontology pairs like OM8. We also provide discussion about the overall experimental results and guidelin

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

One-bit supervision for image classification 20

One-bit supervision for image classification

引用

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

作者： Hengtong Hu Lingxi Xie Zewei Du Richang Hong Qi Tian Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology and School of Computer Science and Information Engineering Hefei University of Technology Huawei Inc.

ISBN: (纸本)9781713829546

This paper presents one-bit supervision, a novel setting of learning from incomplete annotations, in the scenario of image classification. Instead of training a model upon the accurate label of each sample, our setting requires the model to query with a predicted label of each sample and learn from the answer whether the guess is correct. This provides one bit (yes or no) of information, and more importantly, annotating each sample becomes much easier than finding the accurate label from many candidate classes. There are two keys to training a model upon one-bit supervision: improving the guess accuracy and making use of incorrect guesses. For these purposes, we propose a multi-stage training paradigm which incorporates negative label suppression into an off-the-shelf semi-supervised learning algorithm. In three popular image classification benchmarks, our approach claims higher efficiency in utilizing the limited amount of annotations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-fuzzy-objective graph pattern matching with big graph data

引用

Journal of database Management 2019年第4期30卷 24-40页

作者： Li, Lei Zhang, Fang Liu, Guanfeng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Zhongxing Telecommunication Equipment Corporation Nanjing China Macquarie University Sydney Australia

Big graph data is different from traditional data and they usually contain complex relationships and multiple attributes. With the help of graph pattern matching, a pattern graph can be designed, satisfying special personal requirements and locate the subgraphs which match the required pattern. Then, how to locate a graph pattern with better attribute values in the big graph effectively and efficiently becomes a key problem to analyze and deal with big graph data, especially for a specific domain. This article introduces fuzziness into graph pattern matching. Then, a genetic algorithm, specifically an NSGA-II algorithm, and a particle swarm optimization algorithm are adopted for multifuzzy-objective optimization. Experimental results show that the proposed approaches outperform the existing approaches effectively. © 2019,IGI Global.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Iterative context-aware graph inference for visual dialog

arXiv

引用

arXiv 2020年

作者： Guo, Dan Wang, Hui Zhang, Hanwang Zha, Zheng-Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Nanyang Technological University University of Science and Technology of China

Visual dialog is a challenging task that requires the comprehension of the semantic dependencies among implicit visual and textual contexts. This task can refer to the relation inference in a graphical model with sparse contexts and unknown graph structure (relation descriptor), and how to model the underlying context-aware relation inference is critical. To this end, we propose a novel Context-Aware Graph (CAG) neural network. Each node in the graph corresponds to a joint semantic feature, including both object-based (visual) and history-related (textual) context representations. The graph structure (relations in dialog) is iteratively updated using an adaptive top-K message passing mechanism. Specifically, in every message passing step, each node selects the most K relevant nodes, and only receives messages from them. Then, after the update, we impose graph attention on all the nodes to get the final graph embedding and infer the answer. In CAG, each node has dynamic relations in the graph (different related K neighbor nodes), and only the most relevant nodes are attributive to the context-aware relational graph inference. Experimental results on VisDial v0.9 and v1.0 datasets show that CAG outperforms comparative methods. Visualization results further validate the interpretability of our method. Copyright © 2020, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Iterative Context-Aware Graph Inference for Visual Dialog

Iterative Context-Aware Graph Inference for Visual Dialog

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Dan Guo Hui Wang Hanwang Zhang Zheng-Jun Zha Meng Wang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Nanyang Technological University University of Science and Technology of China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

关键词： Visualization History Task analysis Semantics Message passing Neural networks Cognition

来源：评论

学校读者我要写书评

暂无评论

Stacked convolutional sparse auto-encoders for representation learning

引用

ACM Transactions on knowledge Discovery from data 2021年第2期15卷 31-31页

作者： Zhu, Yi Li, Lei Wu, Xindong School of Information Engineering Yangzhou University China School of Computer Science and Information Engineering Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China Mininglamp Academy of Sciences Minininglamp Beijing 100084 China

Deep learning seeks to achieve excellent performance for representation learning in image datasets. However, supervised deep learning models such as convolutional neural networks require a large number of labeled image data, which is intractable in applications, while unsupervised deep learning models like stacked denoising auto-encoder cannot employ label information. Meanwhile, the redundancy of image data incurs performance degradation on representation learning for aforementioned models. To address these problems, we propose a semi-supervised deep learning framework called stacked convolutional sparse auto-encoder, which can learn robust and sparse representations from image data with fewer labeled data records. More specifically, the framework is constructed by stacking layers. In each layer, higher layer feature representations are generated by features of lower layers in a convolutional way with kernels learned by a sparse auto-encoder. Meanwhile, to solve the data redundance problem, the algorithm of Reconstruction Independent Component Analysis is designed to train on patches for sphering the input data. The label information is encoded using a Softmax Regression model for semi-supervised learning. With this framework, higher level representations are learned by layers mapping from image data. It can boost the performance of the base subsequent classifiers such as support vector machines. Extensive experiments demonstrate the superior classification performance of our framework compared to several state-of-the-art representation learning methods. © 2021 ACM.

关键词： Representation learning Sparse auto-encoder

来源：评论

学校读者我要写书评

暂无评论

Sampling Topic Representative Users by Integrating Node Degree and Edge Weight

Sampling Topic Representative Users by Integrating Node Degr...

引用

IEEE International Conference on data science in Cyberspace (DSC)

作者： Jiangwen Wang Zhijie Ban Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

Finding a subset of users to statistically represent the original social network in terms of attributes has received a lot of attention recently. The existing literature had proved that the problem is NP-Hard and proposed some sampling models, but representative degrees aren't systematically studied. Taking node degree and edge weight into account, we present a topic sampling model for the whole social network in this paper. Firstly, by statistically calculating node degrees for one real dataset, we find that one node is more likely to be a representative user if its degree is high. We then give some definitions about representative degrees. Based on statistical stratified sample, we finally give a sampling model of topic representative users who are from most or all attribute groups in the network. Experimental results show that our algorithm significantly outperforms other six baseline methods and is also effective in terms of time complexity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-Channel Co-Attention Network for Visual Question Answering

Multi-Channel Co-Attention Network for Visual Question Answe...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Weidong Tian Bin He Nanxun Wang Zhongqiu Zhao Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Visual Question Answering (VQA) is to reason out correct answers based on input questions and images. Significant progresses have been made by learning rich embedding features from images and questions by bilinear models. Attention mechanisms are widely used to focus on specific visual and textual information in VQA reasoning process. However, most state-of-the-art methods concentrate on fusing the global multi-modal features, while neglect local features. Besides, the dimension is reduced excessively (from K×2048 to 2048) in general visual attention, which causes a mass of visual information loss. In this paper, we propose a novel multi-channel co-attention network (MC-CAN), which integrates multi-modal features from global level to local level. We design different multi-channel attention mechanisms separately for visual (from K×2048 to M×2048) and textual features at different level of integrations. Additionally, we further improve our proposed approach by combining it with the complementary modules such as the MLB and the Count modules. Experiments on benchmark datasets show that our approach achieves better VQA performance than other state-of-the-art methods.

关键词： Visualization Task analysis Feature extraction Correlation knowledge discovery Computational modeling Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：