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

arXiv 2023年

作者： Chatterjee, Soumick Gaidzik, Franziska Sciarra, Alessandro Mattern, Hendrik Janiga, Gábor Speck, Oliver Nürnberger, Andreas Pathiraja, Sahani Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Laboratory of Fluid Dynamics and Technical Flows Otto von Guericke University Magdeburg Germany Department of Biomedical Magnetic Resonance Faculty of Natural Sciences Otto von Guericke University Magdeburg Germany Department of Neurology Medical Faculty University Hospital Magdeburg Germany German Centre for Neurodegenerative Disease Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany School of Mathematics & Statistics UNSW Sydney UNSW Data Science Hub Australia

In the domain of medical imaging, many supervised learning based methods for segmentation face several challenges such as high variability in annotations from multiple experts, paucity of labelled data and class imbalanced datasets. These issues may result in segmentations that lack the requisite precision for clinical analysis and can be misleadingly overconfident without associated uncertainty quantification. We propose the PULASki as a computationally efficient generative tool for biomedical image segmentation that accurately captures variability in expert annotations, even in small datasets. Our approach makes use of an improved loss function based on statistical distances in a conditional variational autoencoder structure (Probabilistic UNet), which improves learning of the conditional decoder compared to the standard cross-entropy particularly in class imbalanced problems. We analyse our method for two structurally different segmentation tasks (intracranial vessel and multiple sclerosis (MS) lesion) and compare our results to four well-established baselines in terms of quantitative metrics and qualitative output. These experiments are characterised by class-imbalanced, low signal to noise ratio data sets with highly ambiguous features. Empirical results demonstrate the PULASKi method outperforms all baselines at the 5% significance level. Our experiments are also of the first to present a comparative study of the computationally feasible segmentation of complex geometries using 3D patches and the traditional use of 2D slices. The generated segmentations are shown to be much more anatomically plausible than in the 2D case, particularly for the vessel task. Our method can also be applied to a wide range of multi-label segmentation tasks and and is useful for downstream tasks such as hemodynamic modelling (computational fluid dynamics and data assimilation), clinical decision making, and treatment planning. Copyright © 2023, The Authors. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Deep learning - A first meta-survey of selected reviews across scientific disciplines, their commonalities, challenges and research impact

arXiv

引用

arXiv 2020年

作者： Egger, Jan Pepe, Antonio Gsaxner, Christina Jin, Yuan Li, Jianning Kern, Roman Institute of Computer Graphics and Vision Faculty of Computer Science and Biomedical Engineering Graz University of Technology Graz Austria Computer Algorithms for Medicine Laboratory Graz Austria Department of Oral and Maxillofacial Surgery Medical University of Graz Graz Austria University Medicine Essen Essen Germany Research Center for Connected Healthcare Big Data Zhejiang Lab Zhejiang Hangzhou China Research Unit Experimental Neurotraumatology Department of Neurosurgery Medical University of Graz Graz Austria Knowledge Discovery Know-Center Graz Austria Institute of Interactive Systems and Data Science Graz University of Technology Graz Austria

Deep learning belongs to the field of artificial intelligence, where machines perform tasks that typically require some kind of human intelligence. Deep learning tries to achieve this by drawing inspiration from the learning of a human brain. Similar to the basic structure of a brain, which consists of (billions of) neurons and connections between them, a deep learning algorithm consists of an artificial neural network, which resembles the biological brain structure. Mimicking the learning process of humans with their senses, deep learning networks are fed with (sensory) data, like texts, images, videos or sounds. These networks outperform the state-of-the-art methods in different tasks and, because of this, the whole field saw an exponential growth during the last years. This growth resulted in way over 10,000 publications per year in the last years. For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides already over 11,000 results in Q3 2020 for the search term 'deep learning', and around 90% of these results are from the last three years. Consequently, a complete overview over the field of deep learning is already impossible to obtain and, in the near future, it will potentially become difficult to obtain an overview over a subfield. However, there are several review articles about deep learning, which are focused on specific scientific fields or applications, for example deep learning advances in computer vision or in specific tasks like object detection. With these surveys as a foundation, the aim of this contribution is to provide a first high-level, categorized meta-survey of selected reviews on deep learning across different scientific disciplines and outline the research impact that they already have during a short period of time. The categories (computer vision, language processing, medical informatics and additional works) have been chosen according to the underlying data sources (image,

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Multilingual Focused Crawler System based on Web Content Extraction and Path Configuration

引用

IOP Conference Series: Materials Science and engineering 2019年第5期569卷

作者： Jie Wang Sanhong Deng Lijuan Wang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service (Nanjing University) Nanjing 210023 China Geological Survey of Jiangsu Province Nanjing 210018 China

The multilingual focused crawler system combines web content extraction with path configuration to make use of their advantages and achieve automatic collection of network information in multiple languages. Firstly, system selects foreign language keywords according to crawling webpage language and Chinese keywords, and uses initial link to obtain webpage information. Then, it uses path configuration information or web content extraction algorithm based on the distribution line block to get webpage content, and adopts rules or configuration information to acquire new links, published time and title. Next, keywords are used to filter irrelevant information. Finally, results are presented as a list. When users use focused crawler system, the webpage path information can be configured or not according to requirements, and the collected network resources can also be searched or filtered.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Disentangled Cascaded Graph Convolution Networks for Multi-Behavior Recommendation

arXiv

引用

arXiv 2024年

作者： Cheng, Zhiyong Dong, Jianhua Liu, Fan Zhu, Lei Yang, Xun Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology No. 485 Danxia Road Anhui Hefei230009 China Shandong Artificial Intelligence Institute Qilu University of Technology Shandong Academy of Sciences No. 19 Keyuan Road Shandong Jinan250014 China School of Computing National University of Singapore 21 Lower Kent Ridge Road Singapore119077 Singapore School of Electronic and Information Engineering University of Tongji No. 4800 Caoan Road Shanghai201804 China School of Information Science and Technology University of Science and Technology of China No. 443 Huangshan Road Anhui Hefei230027 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Centery No. 485 Danxia Road Anhui Hefei230009 China

Multi-behavioral recommender systems have emerged as a solution to address data sparsity and cold-start issues by incorporating auxiliary behaviors alongside target behaviors. However, existing models struggle to accurately capture varying user preferences across different behaviors and fail to account for diverse item preferences within behaviors. Various user preference factors (such as price or quality) entangled in the behavior may lead to sub-optimization problems. Furthermore, these models overlook the personalized nature of user behavioral preferences by employing uniform transformation networks for all users and items. To tackle these challenges, we propose the Disentangled Cascaded Graph Convolutional Network (Disen-CGCN), a novel multi-behavior recommendation model. Disen-CGCN employs disentangled representation techniques to effectively separate factors within user and item representations, ensuring their independence. In addition, it incorporates a multi-behavioral meta-network, enabling personalized feature transformation across user and item behaviors. Furthermore, an attention mechanism captures user preferences for different item factors within each behavior. By leveraging attention weights, we aggregate user and item embeddings separately for each behavior, computing preference scores that predict overall user preferences for items. Our evaluation on benchmark datasets demonstrates the superiority of Disen-CGCN over state-of-the-art models, showcasing an average performance improvement of 7.07% and 9.00% on respective datasets. These results highlight Disen-CGCN’s ability to effectively leverage multi-behavioral data, leading to more accurate recommendations. Copyright © 2024, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

图形处理器加速的联机分析处理系统

图形处理器加速的联机分析处理系统

引用

第29届中国数据库学术会议

作者： Fang Yixuan 方艺璇刘虹 Liu Hong Chen Hong 陈红 Li Cuiping 李翠平 Zhang Yansong 张延松 Zhao Suyun 赵素云 Chen Jie 陈杰辛鑫 Xin Xin Zhang Ji 张吉 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry 数据工程与知识工程教育部重点实验室(中国人民大学) 北京100872 中国人民大学信息学院北京100872 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry 数据工程与知识工程教育部重点实验室(中国人民大学) 北京100872 中国人民大学中国调查与数据中心北京100872

基于现有联机分析处理系统(online analytical processing,OLAP)的不足和图形处理器(graphics processing unit,GPU)的发展,研制了GOOLAP(GPU oriented OLAP)系统.GOOLAP系统利用GPU的高并行性和高存储带宽,把计算密集型运算转移到GPU端执行,加运OLAP处理性能.GOOLAP系统主要由3部分组成：1)表示层,以Excel作为用户输入前端并展示结果,加强系统的易用性;2)OLAP服务器层,负责把多维表达式(multi-dimensional expression,MDX)语句解析成SQL语句并根据自定义启发式规则向GPU传递适合计算的SQL语句,最后再将GPU返回结果与CPU原始结果合并;3)存储层,提供GPU显存和关系数据库两种存储结构.

关键词：图形处理器联机分析处理系统优化设计功能模块

来源：评论

学校读者我要写书评

暂无评论

MyBUD自适应分布式存储管理的设计与实现

MyBUD自适应分布式存储管理的设计与实现

引用

第29届中国数据库学术会议

作者： ZHOU Ningnan 周宁南 ZHANG Xiao 张孝 SUN Xinyun 孙新云 JU Xingxing 琚星星 LIU Kuicheng 刘奎呈 DU Xiaoyong 杜小勇 WANG Shan 王珊 Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin Universi 中国人民大学数据工程与知识工程教育部重点实验室北京100872 中国人民大学信息学院北京100872

面对日益增长的非结构化数据管理需求，实现了基于“自由表”数据模型和BUD参考体系模型的非结构化数据管理平台MyBUD系统。提出了一种能够根据非结构化数据的类型和访问特点自适应地选择分布式存储子系统的方法，同时也对MyBUD进行了T... 详细信息

面对日益增长的非结构化数据管理需求，实现了基于“自由表”数据模型和BUD参考体系模型的非结构化数据管理平台MyBUD系统。提出了一种能够根据非结构化数据的类型和访问特点自适应地选择分布式存储子系统的方法，同时也对MyBUD进行了TPCC测试和非结构化数据存取实验。结果表明，这种自适应的数据存储方法为MyBUD系统提供了高效的可扩展存储层，为采用数据库方法实现对结构化和非结构化数据统一管理的进一步研究工作奠定了基础。

关键词：数据库系统存储管理自适应算法体系架构服务质量

来源：评论

学校读者我要写书评

暂无评论

Liver Segmentation in Time-resolved C-arm CT Volumes Reconstructed from Dynamic Perfusion Scans using Time Separation Technique

Liver Segmentation in Time-resolved C-arm CT Volumes Reconst...

引用

International Image Processing, Applications and Systems Conference (IPAS)

作者： Soumick Chatterjee Hana Haseljić Robert Frysch Vojtěch Kulvait Vladimir Semshchikov Bennet Hensen Frank Wacker Inga Brüsch Thomas Werncke Oliver Speck Andreas Nürnberger Georg Rose Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Magdeburg Germany Department of Biomedical Magnetic Resonance Faculty of Nature Science Otto von Guericke University Magdeburg Magdeburg Germany Faculty of Electrical Engineering and Information Technology Institute for Medical Engineering Otto von Guericke University Magdeburg Magdeburg Germany Faculty of Electrical Engineering and Information Technology Research Campus STIMULATE Otto von Guericke University Magdeburg Magdeburg Germany Institute of Materials Physics Helmholtz-Zentrum hereon Geesthacht Germany Institute of Diagnostic and Interventional Radiology Hannover Medical School Hannover Germany Research Campus STIMULATE Otto von Guericke University Magdeburg Magdeburg Germany Institute for Laboratory Animal Science Hannover Medical School Hannover Germany Department of Biomedical Magnetic Resonance Faculty of Nature Science Otto von Guericke University Magdeburg German Center for Neurodegenerative Disease Magdeburg Germany Center for Behavioral Brain Sciences Magdeburg Germany

ISBN: (纸本)9781665462204

Perfusion imaging is a valuable tool for diagnosing and treatment planning for liver tumours. The time separation technique (TST) has been successfully used for modelling C-arm cone-beam computed tomography (CBCT) perfusion data. The reconstruction can be accompanied by the segmentation of the liver - for better visualisation and for generating comprehensive perfusion maps. Recently introduced Turbolift learning has been seen to perform well while working with TST reconstructions, but has not been explored for the time-resolved volumes (TRV) estimated out of TST reconstructions. The segmentation of the TRVs can be useful for tracking the movement of the liver over time. This research explores this possibility by training the multi-scale attention UNet of Turbolift learning at its third stage on the TRVs and shows the robustness of Turbolift learning since it can even work efficiently with the TRVs, resulting in a Dice score of $0.864\pm 0.004$ .

关键词： Training Image segmentation Computed tomography Computational modeling Motion segmentation Liver Imaging

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：