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

arXiv 2023年

作者： Ma, Jun Zhang, Yao Gu, Song Ge, Cheng Ma, Shihao Young, Adamo Zhu, Cheng Meng, Kangkang Yang, Xin Huang, Ziyan Zhang, Fan Liu, Wentao Pan, YuanKe Huang, Shoujin Wang, Jiacheng Sun, Mingze Xu, Weixin Jia, Dengqiang Choi, Jae Won Alves, Natália de Wilde, Bram Koehler, Gregor Wu, Yajun Wiesenfarth, Manuel Zhu, Qiongjie Dong, Guoqiang He, Jian Wang, Bo He, Junjun Yang, Hua Yang, Huihua Huang, Bingding Lyu, Mengye Ma, Yongkang Guo, Heng Zhang, Rongguo Maier-Hein, Klaus The Department of Laboratory Medicine and Pathobiology University of Toronto Peter Munk Cardiac Centre University Health Network Vector Institute Toronto Canada Shanghai AI Laboratory Shanghai200232 China The Department of Image Reconstruction Nanjing Anke Medical Technology Co. Ltd. Nanjing211113 China Ocean University of China Qingdao266100 China The Department of Computer Science University of Toronto Peter Munk Cardiac Centre University Health Network Vector Institute Toronto Canada Tinavi Medical Technologies Co. Ltd. Beijing100192 China University of Science and Technology Beijing Beijing100083 China The School of Biomedical Engineering Health Science Center Shenzhen University Shenzhen518055 China The Department of Radiological Algorithm Fosun Aitrox Information Technology Co. Ltd. Shanghai200033 China The School of Artificial Intelligence Beijing University of Posts and Telecommunications Beijing100876 China Shenzhen Technology University Shenzhen518000 China Xiamen University Xiamen361005 China Alibaba Beijing100084 China Infervision Medical Technology Co. Ltd. Beijing100025 China Hong Kong Centre for Cerebro-cardiovascular Health Engineering 000000 Hong Kong The Department of Radiology Armed Forces Yangju Hospital Yangju11429 Korea Republic of The Department of Radiology Radboudumc Nijmegen6525XZ Netherlands The Department of Medical Image Computing German Cancer Research Center Heidelberg69120 Germany ShenZhen Yorktal DMIT LLC Shenzhen518100 China Heidelberg69120 Germany The Department of Nuclear Medicine Nanjing Drum Tower Hospital Nanjing210008 China The College of Big Data and Internet Shenzhen Technology University Shenzhen518188 China The College of Health Science and Environmental Engineering Shenzhen Technology University Shenzhen China The Manteia Technologies Co. Ltd Xiamen China The Alibaba DAMO Academy Beijing China The Peter Munk Cardiac Centre University Health Network Department of Laboratory M

Quantitative organ assessment is an essential step in automated abdominal disease diagnosis and treatment planning. Artificial intelligence (AI) has shown great potential to automatize this process. However, most existing AI algorithms rely on many expert annotations and lack a comprehensive evaluation of accuracy and efficiency in real-world multinational settings. To overcome these limitations, we organized the FLARE 2022 Challenge, the largest abdominal organ analysis challenge to date, to benchmark fast, low-resource, accurate, annotation-efficient, and generalized AI algorithms. We constructed an intercontinental and multinational dataset from more than 50 medical groups, including Computed Tomography (CT) scans with different races, diseases, phases, and manufacturers. We independently validated that a set of AI algorithms achieved a median Dice Similarity Coefficient (DSC) of 90.0% by using 50 labeled scans and 2000 unlabeled scans, which can significantly reduce annotation requirements. The best-performing algorithms successfully generalized to holdout external validation sets, achieving a median DSC of 89.5%, 90.9%, and 88.3% on North American, European, and Asian cohorts, respectively. They also enabled automatic extraction of key organ biology features, which was labor-intensive with traditional manual measurements. This opens the potential to use unlabeled data to boost performance and alleviate annotation shortages for modern AI models. © 2023, CC BY-NC-ND.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Eye tracking: empirical foundations for a minimal reporting guideline

引用

Behavior research methods 2023年第1期55卷 364-416页

作者： Kenneth Holmqvist Saga Lee Örbom Ignace T C Hooge Diederick C Niehorster Robert G Alexander Richard Andersson Jeroen S Benjamins Pieter Blignaut Anne-Marie Brouwer Lewis L Chuang Kirsten A Dalrymple Denis Drieghe Matt J Dunn Ulrich Ettinger Susann Fiedler Tom Foulsham Jos N van der Geest Dan Witzner Hansen Samuel B Hutton Enkelejda Kasneci Alan Kingstone Paul C Knox Ellen M Kok Helena Lee Joy Yeonjoo Lee Jukka M Leppänen Stephen Macknik Päivi Majaranta Susana Martinez-Conde Antje Nuthmann Marcus Nyström Jacob L Orquin Jorge Otero-Millan Soon Young Park Stanislav Popelka Frank Proudlock Frank Renkewitz Austin Roorda Michael Schulte-Mecklenbeck Bonita Sharif Frederick Shic Mark Shovman Mervyn G Thomas Ward Venrooij Raimondas Zemblys Roy S Hessels Department of Psychology Nicolaus Copernicus University Torun Poland. kenneth.holmqvist@ur.de. Department of Computer Science and Informatics University of the Free State Bloemfontein South Africa. kenneth.holmqvist@ur.de. Department of Psychology Regensburg University Regensburg Germany. kenneth.holmqvist@ur.de. Department of Psychology Regensburg University Regensburg Germany. Experimental Psychology Helmholtz Institute Utrecht University Utrecht The Netherlands. Lund University Humanities Lab and Department of Psychology Lund University Lund Sweden. Department of Ophthalmology SUNY Downstate Health Sciences University Brooklyn NY USA. Tobii Pro AB Danderyd Sweden. Social Health and Organizational Psychology Utrecht University Utrecht The Netherlands. Department of Computer Science and Informatics University of the Free State Bloemfontein South Africa. TNO Soesterberg The Netherlands. Department of Ergonomics Leibniz Institute for Working Environments and Human Factors Dortmund Germany. Institute of Informatics LMU Munich Munich Germany. Institute of Child Development University of Minnesota Minneapolis USA. School of Psychology University of Southampton Southampton UK. School of Optometry and Vision Sciences Cardiff University Cardiff UK. Department of Psychology University of Bonn Bonn Germany. Vienna University of Economics and Business Vienna Austria. Department of Psychology University of Essex Essex UK. Department of Neuroscience Erasmus MC Rotterdam The Netherlands. Machine Learning Group Department of Computer Science IT University of Copenhagen Copenhagen Denmark. SR Research Ltd Ottawa Canada. Human-Computer Interaction University of Tübingen Tübingen Germany. University of British Columbia Columbia Canada. Department of Eye and Vision Science Institute of Life Course and Medical Sciences University of Liverpool Liverpool UK. Department of Education and Pedagogy Division Education Faculty of Social and Behavioral Sciences Ut

In this paper, we present a review of how the various aspects of any study using an eye tracker (such as the instrument, methodology, environment, participant, etc.) affect the quality of the recorded eye-tracking data and the obtained eye-movement and gaze measures. We take this review to represent the empirical foundation for reporting guidelines of any study involving an eye tracker. We compare this empirical foundation to five existing reporting guidelines and to a database of 207 published eye-tracking studies. We find that reporting guidelines vary substantially and do not match with actual reporting practices. We end by deriving a minimal, flexible reporting guideline based on empirical research (Section "An empirically based minimal reporting guideline").

关键词： data quality Eye movements Eye tracking Replicability Reporting guidelines Reporting practices Reporting standards Reproducibility

来源：评论

学校读者我要写书评

暂无评论

Micro-supervised disturbance learning: A perspective of representation probability distribution

arXiv

引用

arXiv 2020年

作者： Chu, Jielei Liu, Jing Wang, Hongjun Meng, Hua Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The School of Business Sichuan University Sichuan Chengdu610065 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

The instability is shown in the existing methods of representation learning based on Euclidean distance under a broad set of conditions. Furthermore, the scarcity and high cost of labels prompt us to explore more expressive representation learning methods which depends on the labels as few as possible. To address these issues, the small-perturbation ideology is firstly introduced on the representation learning model based on the representation probability distribution. The positive small-perturbation information (SPI) which only depend on two labels of each cluster is used to stimulate the representation probability distribution and then two variant models are proposed to fine-tune the expected representation distribution of RBM, namely, Micro-supervised Disturbance GRBM (Micro-DGRBM) and Micro-supervised Disturbance RBM (Micro-DRBM) models. The Kullback-Leibler (KL) divergence of SPI is minimized in the same cluster to promote the representation probability distributions to become more similar in Contrastive Divergence (CD) learning. In contrast, the KL divergence of SPI is maximized in the different clusters to enforce the representation probability distributions to become more dissimilar in CD learning. To explore the representation learning capability under the continuous stimulation of the SPI, we present a deep Micro-supervised Disturbance Learning (Micro-DL) framework based on the Micro-DGRBM and Micro-DRBM models and compare it with a similar deep structure which has not any external stimulation. Experimental results demonstrate that the proposed deep Micro-DL architecture shows better performance in comparison to the baseline method, the most related shallow models and deep frameworks for clustering. © 2020, CC0.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

FAIR for AI: An interdisciplinary and international community building perspective

arXiv

引用

arXiv 2022年

作者： Huerta, E.A. Blaiszik, Ben Brinson, L. Catherine Bouchard, Kristofer E. Diaz, Daniel Doglioni, Caterina Duarte, Javier M. Emani, Murali Foster, Ian Fox, Geoffrey Harris, Philip Heinrich, Lukas Jha, Shantenu Katz, Daniel S. Kindratenko, Volodymyr Kirkpatrick, Christine R. Lassila-Perini, Kati Madduri, Ravi K. Neubauer, Mark S. Psomopoulos, Fotis E. Roy, Avik Rübel, Oliver Zhao, Zhizhen Zhu, Ruike Data Science and Learning Division Argonne National Laboratory LemontIL60439 United States Department of Computer Science University of Chicago ChicagoIL60637 United States Globus University of Chicago ChicagoIL60637 United States Department of Mechanical Engineering and Materials Science Duke University DurhamNC27708 United States Scientific Data Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Biological Systems & Engineering Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Helen Wills Neuroscience Institute University of California Berkeley BerkeleyCA94720 United States Department of Physics University of California La Jolla San DiegoCA92093 United States Lund University Department of Physics Box 118 Lund221 00 Sweden School of Physics & Astronomy The University of Manchester ManchesterM13 9PL United Kingdom Leadership Computing Facility Argonne National Laboratory LemontIL60439 United States Biocomplexity Institute Department of Computer Science University of Virginia CharlottesvilleVA22904 United States Department of Physics Massachusetts Institute of Technology CambridgeMA02139 United States Technical University Munich Arcisstraße 21 München80333 Germany Computational Science Initiative Brookhaven National Laboratory UptonNY11973 United States Electrical and Computer Engineering Rutgers The State University of New Jersey PiscatawayNJ08854 United States National Center for Supercomputing Applications University of Illinois Urbana-Champaign UrbanaIL61801 United States Department of Computer Science University of Illinois at Urbana-Champaign UrbanaIL61801 United States Department of Electrical & Computer Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States School of Information Sciences University of Illinois at Urbana-Champaign UrbanaIL61801 United States San Diego Supercomputer Center University of California La Jolla San DiegoCA

A foundational set of findable, accessible, interoperable, and reusable (FAIR) principles were proposed in 2016 as prerequisites for proper data management and stewardship, with the goal of enabling the reusability of scholarly data. The principles were also meant to apply to other digital assets, at a high level, and over time, the FAIR guiding principles have been reinterpreted or extended to include the software, tools, algorithms, and workflows that produce data. FAIR principles are now being adapted in the context of AI models and datasets. Here, we present the perspectives, vision, and experiences of researchers from different countries, disciplines, and backgrounds who are leading the definition and adoption of FAIR principles in their communities of practice, and discuss outcomes that may result from pursuing and incentivizing FAIR AI research. The material for this report builds on the FAIR for AI Workshop held at Argonne National Laboratory on June 7, 2022. Copyright © 2022, The Authors. All rights reserved.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification

Learning Structured Twin-Incoherent Twin-Projective Latent D...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Guangcan Liu Meng Wang School of Computer Science and Technology Soochow University Suzhou China 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 Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information and Control Nanjing University of Information Science and Technology Nanjing China

In this paper, we extend the popular dictionary pair learning (DPL) into the scenario of twin-projective latent flexible DPL under a structured twin-incoherence. Technically, a novel framework called Twin-Projective Latent Flexible DPL (TP-DPL) is proposed, which minimizes the twin-incoherence constrained flexibly-relaxed reconstruction error to avoid the possible over-fitting issue and produce accurate reconstruction. In this setting, TP-DPL integrates the twin-incoherence based latent flexible DPL and the joint embedding of codes as well as salient features by twin-projection into a unified model in an adaptive neighborhood-preserving manner. Therefore, TP-DPL can unify the procedures of salient feature representation and classification. The twin-incoherence constraint on coefficients and features can explicitly ensure high intra-class compactness and inter-class separation over them. TP-DPL also integrates the adaptive weighting to preserve local neighborhood of both coefficients and salient features within each class explicitly. For efficiency, TP-DPL selects the Frobenius-norm and abandons the costly l0/l1-norm for group sparse representation. Another byproduct is that TP-DPL can directly apply the class-specific twin-projective reconstruction residual to compute the label of data. Extensive results on public databases show that TP-DPL can deliver the state-of-the-art performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust unsupervised feature selection by nonnegative sparse subspace learning

引用

Neurocomputing 2019年 334卷 156-171页

作者： Wei Zheng Hui Yan Jian Yang School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China School of Computer Engineering Jinling Institute of Technology Nanjing PR China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing PR China

Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoint of sparse subspace learning. By minimizing the reconstruction residual, the learned feature weight matrix with the l 2,1 -norm and the non-negative constraints not only removes the irrelevant features, but also captures the underlying low dimensional structure of the data points. Meanwhile in order to enhance the model's robustness, l 1 -norm error function is used to resistant to outliers and sparse noise. An efficient iterative algorithm is introduced to optimize this non-convex and non-smooth objective function and the proof of its convergence is given. Although, there is a subtraction item in our multiplicative update rule, we validate its non-negativity. The superiority of our model is demonstrated by comparative experiments on various original datasets with and without malicious pollution.

关键词： Subspace learning Non-negative matrix factorization Unsupervised feature selection

来源：评论

学校读者我要写书评

暂无评论

Adaptive Structure-Constrained Robust Latent Low-Rank Coding for Image Recovery

Adaptive Structure-Constrained Robust Latent Low-Rank Coding...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Lei Wang Sheng Li Yang Wang Zheng Zhang Zhengjun Zha Meng Wang School of Computer Science and Technology Soochow University Suzhou China 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 University of Georgia Athens GA Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2, 1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-view graph learning by joint modeling of consistency and inconsistency

arXiv

引用

arXiv 2020年

作者： Liang, Youwei Huang, Dong Wang, Chang-Dong Yu, Philip S. College of Mathematics and Informatics South China Agricultural University Guangzhou China Tencent Shenzhen China College of Mathematics and Informatics South China Agricultural University Guangzhou China Pazhou Lab Guangzhou China School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

—Graph learning has emerged as a promising technique for multi-view clustering due to its ability to learn a unified and robust graph from multiple views. However, existing graph learning methods mostly focus on the multi-view consistency issue, yet often neglect the inconsistency between views, which makes them vulnerable to possibly low-quality or noisy datasets. To overcome this limitation, we propose a new multi-view graph learning framework, which for the first time simultaneously and explicitly models multi-view consistency and inconsistency in a unified objective function, through which the consistent and inconsistent parts of each single-view graph as well as the unified graph that fuses the consistent parts can be iteratively learned. Though optimizing the objective function is NP-hard, we design a highly efficient optimization algorithm that can obtain an approximate solution with linear time complexity in the number of edges in the unified graph. Furthermore, our multi-view graph learning approach can be applied to both similarity graphs and dissimilarity graphs, which lead to two graph fusion-based variants in our framework. Experiments on twelve multi-view datasets have demonstrated the robustness and efficiency of the proposed approach. Copyright © 2020, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Preface

EAI/Springer Innovations in Communication and Computing

引用

EAI/Springer Innovations in Communication and computing 2022年 vii-viii页

作者： Johri, Prashant Diván, Mario José Khanam, Ruqaiya Marciszack, Marcelo Will, Adrián Yamuna Expressway School of Computing Science & Engineering Galgotias University G.B.Nagar Plot No 2 Sector 17 A Greater Noida Uttar Pradesh India Computer Science and Engineering Department SET Sharda University Greater Noida Uttar Pradesh India Information System Department National Technological University-Tucumán Regional Faculty Tucumán Tucumán Argentina Data Science Research Group at Economy School National University of La Pampa Santa Rosa Argentina National Technological University-Córdoba Regional Faculty Córdoba Argentina

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：