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

Non-invasive biopsy diagnosis of diabetic kidney disease via deep learning applied to retinal images: a population-based study

引用

The Lancet Digital Health 2025年第5期7卷 100868页

作者： Meng, Ziyao Guan, Zhouyu Yu, Shujie Wu, Yilan Zhao, Yaoning Shen, Jie Lim, Cynthia Ciwei Chen, Tingli Yang, Dawei Ran, An Ran He, Feng Hamzah, Haslina Singh, Sarkaaj Abd Raof, Anis Syazwani Lee-Boey, Jian Wen Samuel Lim, Soo-Kun Sun, Xufang Ge, Shuwang Xu, Gang Su, Hua Cheng, Yang Lu, Feng Liao, Xiaofei Jin, Hai Deng, Chenxin Ruan, Lei Zhang, Cuntai Wu, Chan Dai, Rongping Jin, Yixiao Wang, Wenxiao Li, Tingyao Liu, Ruhan Li, Jiajia Shu, Jia Lu, Yuwei Wang, Xiangning Wu, Qiang Qin, Yiming Tang, Jin Sheng, Xiaohua Jiao, Qiong Yang, Xiaokang Guo, Minyi McKay, Gareth J Hogg, Ruth E Liew, Gerald Chee, Evelyn Yi Lyn Hsu, Wynne Lee, Mong Li Szeto, Simon Luk, Andrea O Y Chan, Juliana C N Cheung, Carol Y Tan, Gavin Siew Wei Tham, Yih-Chung Cheng, Ching-Yu Sabanayagam, Charumathi Lim, Lee-Ling Jia, Weiping Li, Huating Sheng, Bin Wong, Tien Yin Shanghai Belt and Road International Joint Laboratory of Intelligent Prevention and Treatment for Metabolic Diseases Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Institute for Proactive Healthcare Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Centre for Diabetes Shanghai Key Laboratory of Diabetes Mellitus Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Beijing Tsinghua Changgung Hospital Eye Center School of Clinical Medicine Tsinghua Medicine Tsinghua University Beijing China Medical Records and Statistics Office Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Renal Medicine Singapore General Hospital SingHealth-Duke Academic Medical Centre Singapore Singapore Department of Ophthalmology Shanghai Health and Medical Center Wuxi China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong Special Administrative Region China Singapore Eye Research Institute Singapore National Eye Centre Singapore Department of Medicine Faculty of Medicine Universiti Malaya Kuala Lumpur Malaysia Department of Ophthalmology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Hubei Wuhan China Department of Nephrology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Nephrology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Ophthalmology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Centre for Big Dat

Background: Improving the accessibility of screening diabetic kidney disease (DKD) and differentiating isolated diabetic nephropathy from non-diabetic kidney disease (NDKD) are two major challenges in the field of diabetes care. We aimed to develop and validate an artificial intelligence (AI) deep learning system to detect DKD and isolated diabetic nephropathy from retinal fundus images. Methods: In this population-based study, we developed a retinal image-based AI-deep learning system, DeepDKD, pretrained using 734 084 retinal fundus images. First, for DKD detection, we used 486 312 retinal images from 121 578 participants in the Shanghai Integrated Diabetes Prevention and Care System for development and internal validation, and ten multi-ethnic datasets from China, Singapore, Malaysia, Australia, and the UK (65 406 participants) for external validation. Second, to differentiate isolated diabetic nephropathy from NDKD, we used 1068 retinal images from 267 participants for development and internal validation, and three multi-ethnic datasets from China, Malaysia, and the UK (244 participants) for external validation. Finally, we conducted two proof-of-concept studies: a prospective real-world study with 3 months' follow-up to evaluate the effectiveness of DeepDKD in screening DKD;and a longitudinal analysis of the effectiveness of DeepDKD in differentiating isolated diabetic nephropathy from NDKD on renal function changes with 4·6 years' follow-up. Findings: For detecting DKD, DeepDKD achieved an area under the receiver operating characteristic curve (AUC) of 0·842 (95% CI 0·838–0·846) on the internal validation dataset and AUCs of 0·791–0·826 across external validation datasets. For differentiating isolated diabetic nephropathy from NDKD, DeepDKD achieved an AUC of 0·906 (0·825–0·966) on the internal validation dataset and AUCs of 0·733–0·844 across external validation datasets. In the prospective study, compared with the metadata model, DeepDKD could detect DKD wit

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

The Tourism-Specific Sentiment Vector Construction Based on Kernel Optimization Function

引用

Procedia Computer Science 2017年 122卷 1162-1167页

作者： Luyao Zhu Wei Li Kun Guo Yong Shi Yuanchun Zheng School of Economics and Management University of Chinese Academy of Sciences Beijing China Fictitious Economy & Data Science Research Center Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

Sentiment analysis in tourism domain has drawn much attention in past few years, which calls for more precise sentiment word embedding method. The article proposes a kernel optimization function for sentiment word embedding. And the method aims at integrating the semantic information, statistics information and sentiment information and maintains the similarity between sentiment words in terms of sentiment orientation. The experiment result shows that the optimal sentiment vectors successfully extract the features in terms of sentiment information and the difference between concretization and abstraction of a sentiment words.

关键词： kernel function sentiment vector word embedding sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

GPTR: Gestalt-Perception Transformer for Diagram Object Detection

arXiv

引用

arXiv 2022年

作者： Hu, Xin Zhang, Lingling Liu, Jun Fan, Jinfu You, Yang Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University China Department of Control Science and Engineering Tongji University Shanghai China Department of Computer Science National University of Singapore Singapore Lenovo Research Beijing China

Diagram object detection is the key basis of practical applications such as textbook question answering. Because the diagram mainly consists of simple lines and color blocks, its visual features are sparser than those of natural images. In addition, diagrams usually express diverse knowledge, in which there are many low-frequency object categories in diagrams. These lead to the fact that traditional data-driven detection model is not suitable for diagrams. In this work, we propose a gestalt-perception transformer model for diagram object detection, which is based on an encoder-decoder architecture. Gestalt perception contains a series of laws to explain human perception, that the human visual system tends to perceive patches in an image that are similar, close or connected without abrupt directional changes as a perceptual whole object. Inspired by these thoughts, we build a gestalt-perception graph in transformer encoder, which is composed of diagram patches as nodes and the relationships between patches as edges. This graph aims to group these patches into objects via laws of similarity, proximity, and smoothness implied in these edges, so that the meaningful objects can be effectively detected. The experimental results demonstrate that the proposed GPTR achieves the best results in the diagram object detection task. Our model also obtains comparable results over the competitors in natural image object detection. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Breaking the moments condition barrier: no-regret algorithm for bandits with super heavy-tailed payoffs 21

Breaking the moments condition barrier: no-regret algorithm ...

引用

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

作者： Han Zhong Jiayi Huang Lin F. Yang Liwei Wang Center for Data Science Peking University Center for Data Science Peking University Pazhou Lab Department of Electrical and Computer Engineering University of California Los Angles Key Laboratory of Machine Perception MOE School of EECS Institute for Artificial Intelligence Peking University

ISBN: (纸本)9781713845393

Despite a large amount of effort in dealing with heavy-tailed error in machine learning, little is known when moments of the error can become non-existential: the random noise η satisfies Pr[|η| > |y|] ≤ 1/|y|α for some α > 0. We make the first attempt to actively handle such super heavy-tailed noise in bandit learning problems: We propose a novel robust statistical estimator, mean of medians, which estimates a random variable by computing the empirical mean of a sequence of empirical medians. We then present a generic reductionist algorithmic framework for solving bandit learning problems (including multi-armed and linear bandit problem): the mean of medians estimator can be applied to nearly any bandit learning algorithm as a black-box filtering for its reward signals and obtain similar regret bound as if the reward is sub-Gaussian. We show that the regret bound is near-optimal even with very heavy-tailed noise. We also empirically demonstrate the effectiveness of the proposed algorithm, which further corroborates our theoretical results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Multi-Granular Decision Networks for Hierarchical Classification

SSRN

引用

SSRN 2024年

作者： Liu, Haoyang Hu, Xue gang Bai, Shengxing Lin, Yaojin Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230009 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Anhui Hefei230009 China School of Computer Science Minnan Normal University Fujian Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Fujian Zhangzhou363000 China

Hierarchical classification learning is an effective means of solving large-scale classification problems, which models classification problems at different levels of granularity according to a hierarchical structure. In hierarchical classification tasks, classification results at different levels of granularity are mutually beneficial, where coarse-grained results can reduce the number of fine-grained candidate categories, and fine-grained results can provide a basis for coarse-grained classification. However, for the final decision, the contribution of the granularity levels in the different hierarchies is different and unknown. Feedback from different granularity levels should be flexibly integrated. In addition, errors in hierarchical classification are not equivalent, and some errors can have serious results for practical applications. In order to address the above challenges, we propose a new hierarchical network to integrate multi-granularity knowledge for decision making. On the one hand, the network computes the decision scores of instances at each granularity level and learns a set of weights to combine all scores. Based on the learnable weights, the model can effectively utilize the multi-granularity classification results to obtain the final decision. On the other hand, we design local and global classification losses to guide model optimization, which allows the model to gain a hierarchical perspective and the ability to understand the degree of hierarchical misclassification. As a result, the extent to which the method results in misclassification consequences is limited. Experimental results on five benchmark datasets show that our method arises as a state-of-the-art hierarchical classification method. © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Coarse-to-Fine Multi-stream Hybrid Deraining Network for Single Image Deraining

A Coarse-to-Fine Multi-stream Hybrid Deraining Network for S...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yanyan Wei Zhao Zhang Haijun Zhang Richang Hong Meng Wang Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China

Single image deraining task is still a very challenging task due to its ill-posed nature in reality. Recently, researchers have tried to fix this issue by training the CNN-based end-to-end models, but they still cannot extract the negative rain streaks from rainy images precisely, which usually leads to an over de-rained or under de-rained result. To handle this issue, this paper proposes a new coarse-to-fine single image deraining framework termed Multi-stream Hybrid Deraining Network (shortly, MH-DerainNet). To obtain the negative rain streaks during training process more accurately, we present a new module named dual path residual dense block, i.e., Residual path and Dense path. The Residual path is used to reuse com-mon features from the previous layers while the Dense path can explore new features. In addition, to concatenate different scaled features, we also apply the idea of multi-stream with shortcuts between cascaded dual path residual dense block based streams. To obtain more distinct derained images, we combine the SSIM loss and perceptual loss to preserve the per-pixel similarity as well as preserving the global structures so that the deraining result is more accurate. Extensive experi-ments on both synthetic and real rainy images demonstrate that our MH-DerainNet can deliver significant improvements over several recent state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning from Semi-Factuals: A Debiased and Semantic-Aware Framework for Generalized Relation Discovery

arXiv

引用

arXiv 2024年

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Guo, Tianlin Wu, Wenjun The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an710049 China

We introduce a novel task, called Generalized Relation Discovery (GRD), for open-world relation extraction. GRD aims to identify unlabeled instances in existing pre-defined relations or discover novel relations by assigning instances to clusters as well as providing specific meanings for these clusters. The key challenges of GRD are how to mitigate the serious model biases caused by labeled pre-defined relations to learn effective relational representations and how to determine the specific semantics of novel relations during classifying or clustering unlabeled instances. We then propose a novel framework, SFGRD, for this task to solve the above issues by learning from semi-factuals in two stages. The first stage is semi-factual generation implemented by a tri-view debiased relation representation module, in which we take each original sentence as the main view and design two debiased views to generate semi-factual examples for this sentence. The second stage is semi-factual thinking executed by a dual-space tri-view collaborative relation learning module, where we design a cluster-semantic space and a class-index space to learn relational semantics and relation label indices, respectively. In addition, we devise alignment and selection strategies to integrate two spaces and establish a self-supervised learning loop for unlabeled data by doing semi-factual thinking across three views. Extensive experimental results show that SFGRD surpasses state-of-the-art models in terms of accuracy by 2.36% ∼5.78% and cosine similarity by 32.19%∼ 84.45% for relation label index and relation semantic quality, respectively. To the best of our knowledge, we are the first to exploit the efficacy of semi-factuals in relation extraction. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition

A better constant approximation for minimum 3-connected m-do...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Wei Wang Bei Liu Donghyun Kim Deying Li Jingyi Wang Yaolin Jiang School of Mathematics and Statistics Xi'an Jiaotong University Xi'an China Department of Mathematics and Physics North Carolina Central University Durham USA Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Renmin University of China Beijing P.R. China

Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. One popular way to construct a quality virtual backbone is to solve the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph by the connected dominating set is one-vertex-connected. As a result, the minimum k-connected m-dominating set problem is introduced to construct a fault-tolerant virtual backbone. Currently, the best known approximation algorithm for the problem in unit disk graph assumes k ≤ 3 and m ≥ 1 and its performance ratio is 280 when k = m = 3. In this paper, we use a classical result from graph theory, Tutte decomposition, to design a new approximation algorithm for the problem in unit disk graph for k ≤ 3 and m ≥ 3. In particular, the algorithm features with much simpler structure and much smaller performance ratio, e.g. nearly 66 when k = m = 3. We also conduct simulation to evaluate the performance of our algorithm.

关键词： Particle separators Approximation algorithms Algorithm design and analysis Approximation methods Wireless networks Conferences Computers

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised classification on data streams with recurring concept drift and concept evolution

引用

knowledge-Based Systems 2021年 215卷 106749-106749页

作者： Zheng, Xiulin Li, Peipei Hu, Xuegang Yu, Kui Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei 230601 Anhui China

Mining non-stationary stream is a challenging task due to its unique property of infinite length and dynamic characteristics let alone the issues of concept drift, concept evolution and limited labeled data. Although more attention has been attracted on the issues of concept drift and evolution in data streams, however, most of existing methods are supervised in nature, which probably result in a worse classification performance and lower efficiency in the case with scarcity of labeled data. Thus, in this paper, we proposed a semi-supervised framework with recurring concept drift and novel class detection called ESCR, which aims to detect recurring concept drift and concept evolution in data streams with partially labeled data. It is firstly built on an ensemble model consisted of several clustering-based classifiers. In terms of this framework, we adopt Jensen–Shannon divergence based change detection technique on classifier confidence score instead of classification error rate to detect recurring concept drifts. Meanwhile, we take concept evolution into consideration by monitoring the outliers with strong cohesion. Moreover, we further improve the execution efficiency of our framework by exploiting the recursive function and dynamic programming. Finally, extensive experiments conducted on both benchmark and synthetic data sets demonstrate the effectiveness and efficiency of our proposed semi-supervised framework in the handling of data streams with recurring concept drifts and concept evolution, as compared to several well-known semi-supervised data stream classification methods. © 2021 Elsevier B.V.

关键词： Concept evolution data stream classification Recurring concept drift

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：