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

Explainable machine learning models for estimating daily dissolved oxygen concentration of the Tualatin River

engineering Applications of Computational Fluid Mechanics 2024年第1期18卷

作者： Li, Shuguang Qasem, Sultan Noman Band, Shahab S. Ameri, Rasoul Pai, Hao-Ting Mehdizadeh, Saeid School of Computer Science and Technology Shandong Technology and Business University Yantai China Computer Science Department College of Computer and Information Sciences Imam Mohammad Ibn Saud Islamic University (IMSIU) Riyadh Saudi Arabia Computer Science Department Faculty of Applied Science Taiz University Taiz Yemen Future Technology Research Center National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management International Graduate School of Artificial Intelligence National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management National Yunlin University of Science and Technology Douliu Taiwan Bachelor Program of Big Data Applications in Business National Pingtung University Pingtung Taiwan Water Engineering Department Urmia University Urmia Iran

Monitoring the quality of river water is of fundamental importance and needs to be taken into consideration when it comes to the research into the hydrological field. In this context, the concentration of the dissolved oxygen (DO) is one of the most significant indicators of the quality of river water. The current study aimed to estimate the minimum, maximum, and mean DO concentrations (DO min, DO max, DO mean) at a gauging station located on Tualatin River, United States. To that end, four machine learning models, such as support vector regression (SVR), multi-layer perceptron (MLP), random forest (RF), and gradient boosting (GB) were established. Root mean square error (RMSE), mean absolute error (MAE), coefficient of correlation (R), and Nash-Sutcliffe efficiency (NSE) metrics were employed to better assess the accuracies of these models. The modeling results demonstrated that the SVR and MLP surpassed the RF and GB models. Despite this, the SVR was concluded to be the best-performing method when used to estimate the DO min, DO max, and DO mean. The best error statistics in the testing phase were related to the SVR model with full (four) inputs to estimate DO mean concentration (RMSE = 0.663 mg/l, MAE = 0.508 mg/l, R = 0.945, NSE = 0.875). Finally, the explainability of the superior models (i.e. SVR models) was conducted using SHapley Additive exPlanations (SHAP) for the first time to estimate DO concentration. In fact, evaluating the explainability of machine learning models can provide useful information about the impact of each of the input estimators used in the procedure of models development. It was concluded that the specific conductance (SC) and followed by water temperature (WT) could provide the most contributions for estimating the DO min, DO max, and DO mean concentrations. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： dissolved oxygen concentration estimation Explainable machine learning SHapley additive explanations

来源：评论

学校读者我要写书评

暂无评论

A Text Multi-label Classification Scheme Based on Resampling and Ensemble Learning 8th

A Text Multi-label Classification Scheme Based on Resampling...

引用

8th International Conference on Artificial Intelligence and Security , ICAIS 2022

作者： Wang, Tianhao Weng, Tianrang Ji, Jiacheng Zhong, Mingjun Zhang, Baili School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration in Southeast University Ministry of Education Nanjing211189 China Research Center for Judicial Big Data Supreme Count of China Nanjing211189 China Department of Computing Science University of Aberdeen AberdeenAB24 3UE United Kingdom

ISBN: (纸本)9783031067600

The medical dispute cases are professional and closely related to medicine. Therefore, the mediation of cases in practice depends heavily on similar historical cases. Multi-label classification of legal documents can efficiently filter irrelevant historical cases, which helps to recommend the similar historical cases faster and better. However, the imbalance and label symbiosis of the data set directly affect multi-label classification of legal documents. Therefore, a multi-label classification scheme based on resampling and ensemble learning is presented in this paper The scheme includes two parts: in the first part, in order to reduce the impact of label symbiosis on resampling, a resampling algorithm based on the average sparsity of the label set is proposed improve the imbalance of the data set;in the second one, a multi-label classification algorithm based on ensemble learning is proposed to train multiple base classifiers and combine each base classifier with a voting strategy of one vote. It can effectively improve the effect of multi-label classification. The experimental results show that the scheme proposed in this paper can improve the effect of multi-label classification and is not only suitable for legal documents but also applicable for other text data sets with imbalanced classes and label symbiosis problems. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Near-optimal representation learning for linear bandits and linear RL

arXiv

引用

arXiv 2021年

作者： Hu, Jiachen Chen, Xiaoyu Jin, Chi Li, Lihong Wang, Liwei Key Laboratory of Machine Perception MOE School of EECS Peking University China Department of Electrical and Computer Engineering Princeton University United States Amazon United States Center for Data Science Peking University Beijing Institute of Big Data Research China

This paper studies representation learning for multi-task linear bandits and multi-task episodic RL with linear value function approximation. We first consider the setting where we play M linear bandits with dimension d concurrently, and these bandits share a common k-dimensional linear representation so that k d and k M. We propose a sample-efficient algorithm, MTLR-OFUL, which leverages the shared representation to achieve Õ(M√dkT + d√kMT) regret, with T being the number of total steps. Our regret significantly improves upon the baseline Õ(Md√T) achieved by solving each task independently. We further develop a lower bound that shows our regret is near-optimal when d > M. Furthermore, we extend the algorithm and analysis to multi-task episodic RL with linear value function approximation under low inherent Bellman error (Zanette et al., 2020a). To the best of our knowledge, this is the first theoretical result that characterizes the benefits of multi-task representation learning for exploration in RL with function approximation. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

NuSegDG: Integration of heterogeneous space and Gaussian kernel for domain-generalized nuclei segmentation

引用

Knowledge-Based Systems 2025年 322卷

作者： Lou, Zhenye Xu, Qing Jiang, Zekun He, Xiangjian Li, Chenxin Chen, Zhen Wang, Yi He, Maggie M. Duan, Wenting Sichuan University Pittsburgh Institute Sichuan University Chengdu China School of Computer Science Computer Vision and Intellifent Perception Laboratory and Municipal Digital Port Technology Key Laboratory University of Nottingham Ningbo Zhejiang China West China Biomedical Big Data Center West China Hospital Sichuan University Chengdu China Hong Kong Institute of Science & Innovation Chinese Academy of Sciences Hong Kong School of Software Dalian University of Technology Dalian116600 China Department of Electronic Engineering The Chinese University of Hong Kong 999077 Hong Kong Department of Cardiology Gold Coast University Hospital QLD Australia School of Computer Science University of Lincoln LincolnLN6 7TS United Kingdom

Domain-generalized nuclei segmentation refers to the generalizability of models to unseen domains based on knowledge learned from source domains and is challenged by various image conditions, cell types, and stain strategies. Recently, the Segment Anything Model (SAM) has made great success in universal image segmentation by interactive prompt modes (e.g., point and box). Despite its strengths, the original SAM presents limited adaptation to medical images. Moreover, SAM requires providing manual bounding box prompts for each object to produce satisfactory segmentation masks, so it is laborious in nuclei segmentation scenarios. To address these limitations, we propose a domain-generalizable framework for nuclei image segmentation, abbreviated to NuSegDG. Specifically, we first devise a Heterogeneous Space Adapter (HS-Adapter) to learn multi-dimensional feature representations of different nuclei domains by injecting a small number of trainable parameters into the image encoder of SAM. To alleviate the labour-intensive requirement of manual prompts, we introduce a Gaussian-Kernel Prompt Encoder (GKP-Encoder) to generate density maps driven by a single point, which guides segmentation predictions by mixing position prompts and semantic prompts. Furthermore, we present a Two-Stage Mask Decoder (TSM-Decoder) to effectively convert semantic masks to instance maps without the manual demand for morphological shape refinement. Based on our experimental evaluations, the proposed NuSegDG demonstrates state-of-the-art performance in nuclei semantic and instance segmentation, exhibiting superior domain generalization capabilities. The source code is available at https://***/xq141839/NuSegDG. © 2025 Elsevier B.V.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

data mining analysis of the influences of electrocardiogram P-wave morphology parameters on atrial fibrillation

Data mining analysis of the influences of electrocardiogram ...

引用

作者： Ouyang, Chen-Sen Chen, Yenming J. Tsai, Jinn-Tsong Chang, Yiu-Jen Huang, Tian-Hsiang Hwang, Kao-Shing Ho, Yuan-Chih Ho, Wen-Hsien Department of Information Engineering I-Shou University Kaohsiung Taiwan Department of Logistics Management National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Computer Science National Pingtung University Pingtung Taiwan Department of Healthcare Administration and Medical Informatics Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan Department of Electrical Engineering National Sun Yat-Sen University Kaohsiung Taiwan Division of Cardiology Department of Internal Medicine Yuan's General Hospital Kaohsiung Taiwan Department of Medical Research Kaohsiung Medical University Hospital Kaohsiung Taiwan

Atrial fibrillation (AF) is a type of paroxysmal cardiac disease that presents no obvious symptoms during onset, and even the electrocardiograms (ECG) results of patients with AF appear normal under a premorbid status, rendering AF difficult to detect and diagnose. However, it can result in deterioration and increased risk of stroke if not detected and treated early. This study used the ECG database provided by the Physionet website (https://***), filtered data, and employed parameter-extraction methods to identify parameters that signify ECG features. A total of 31 parameters were obtained, consisting of P-wave morphology parameters and heart rate variability parameters, and the data were further examined by implementing a decision tree, of which the topmost node indicated a significant causal relationship. The experiment results verified that the P-wave morphology parameters significantly affected the ECG results of patients with AF. © 2021-IOS Press. All rights reserved.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Record Acceleration of the Two-Dimensional Ising Model Using a High-Performance Wafer-Scale Engine

SSRN

引用

SSRN 2024年

作者： Shi, Wei Van Essendelft, Dirk Saidi, Wissam Abdo Almolyki, Hayl Jordan, Terry Wang, Mei-Yu The National Energy Technology Laboratory 3610 Collins Ferry Rd MorgantownWV26505 United States Department of Computer Science and Engineering Tandon School of Engineering New York University 6 MetroTech Center BrooklynNY11201 United States The National Energy Technology Laboratory 626 Cochrans Mill Rd PittsburghPA15236 United States HPC AI and Big Data Group Pittsburgh Supercomputing Center Carnegie Mellon University 300 S. Craig St. PittsburghPA15213 United States The National Energy Technology Laboratory 626 Cochrans Mill Rd PittsburghPA15236 United States

The versatility and wide-ranging applicability of the Ising model, originallyintroduced to study phase transitions in magnetic materials, have made it a cornerstonein statistical physics and a valuable tool for evaluating the performanceof emerging computer hardware. Here, we present a novel implementation of thetwo-dimensional Ising model on Cerebras Wafer-Scale Engine (WSE) – a revolutionaryprocessor that is opening new frontiers in computing. In our deploymentof the checkerboard algorithm, we optimized the Ising model to take advantage of the unique WSE architecture. Specifically, we employed a compressed bit representationstoring 16 spins on each int16 word, and efficiently distributed the spinsover the processing units enabling seamless weak scaling and limiting communicationsto only immediate neighboring units. Our implementation can handleup to 754 simulations in parallel, achieving an aggregate of over 61.8 trillion flipattempts per second for Ising models with up to 200 million spins. This representsa gain of up to 148 times over previously reported single-devices with a highlyoptimized implementation on NVIDIA V100 and up to 88 times in productivitycompared to NVIDIA H100. Our findings highlight the significant potential ofthe WSE in scientific computing, particularly in the field of materials modeling. © 2024, The Authors. All rights reserved.

关键词： Ising model

来源：评论

学校读者我要写书评

暂无评论

Integration of Droplet Microfluidic Tools for Single-cell Functional Metagenomics:An engineering Head Start

引用

Genomics, Proteomics & Bioinformatics 2021年第3期19卷 504-518页

作者： David Conchouso Amani Al-Ma’abadi Hayedeh Behzad Mohammed Alarawi Masahito Hosokawa Yohei Nishikawa Haruko Takeyama Katsuhiko Mineta Takashi Gojobori Department of Industrial and Mechanical Engineering Universidad de las Américas PueblaPuebla 72810Mexico Computational Bioscience Research Center King Abdullah University of Science and TechnologyThuwal 23955-6900Saudi Arabia Biological and Environmental Sciences and Engineering Division King Abdullah University of Science and TechnologyThuwal 23955-6900Saudi Arabia Research Organization for Nano&Life Innovation Waseda UniversityTokyo 162-0041Japan Department of Life Science and Medical Bioscience Waseda UniversityTokyo 162-8480Japan Institute for Advanced Research of Biosystem Dynamics Waseda Research Institute for Science and EngineeringWaseda UniversityTokyo 169-8555Japan Computational Bio Big-Data Open Innovation Laboratory AIST-Waseda UniversityTokyo 169–0072Japan Computer Electricaland Mathematical Sciences and Engineering DivisionKing Abdullah University of Science and TechnologyThuwal 23955-6900Saudi Arabia

Droplet microfluidic techniques have shown promising outcome to study single cells at high ***,their adoption in laboratories studying“-omics”sciences is still irrelevant due to the complex and multidisciplinary nature of the *** facilitate their use,here we provide engineering details and organized protocols for integrating three droplet-based microfluidic technologies into the metagenomic pipeline to enable functional screening of bioproducts at high ***,a device encapsulating single cells in droplets at a rate of~250 Hz is described considering droplet size and cell ***,we expand on previously reported fluorescence-activated droplet sorting systems to integrate the use of 4 independent fluorescence-exciting lasers(i.e.,405,488,561,and 637 nm)in a single platform to make it compatible with different fluorescence-emitting *** this sorter,both hardware and software are provided and optimized for effortlessly sorting droplets at 60 ***,a passive droplet merger is also integrated into our pipeline to enable adding new reagents to already-made droplets at a rate of 200 ***,we provide an optimized recipe for manufacturing these chips using silicon dry-etching *** of the overall integration and the technical details presented here,our approach allows biologists to quickly use microfluidic technologies and achieve both single-cell resolution and high-throughput capability(>50,000 cells/day)for mining and bioprospecting metagenomic data.

关键词： Droplet microfluidics Single cell Metagenomics Droplet sorter Biotechnology

来源：评论

学校读者我要写书评

暂无评论

Vflh: A Following-the-Leader-History Based Algorithm for Adaptive Online Convex Optimization with Stochastic Constraints

SSRN

引用

SSRN 2022年

作者： Yang, Yifan Chen, Lin Zhou, Pan Ding, Xiaofeng Department of Computer Science University of California Santa BarbaraCA93106 United States National Engineering Research Center for Big Data Technology and System Lab Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430072 China

This paper considers online convex optimization (OCO) with generated i.i.d. stochastic constraints, where the distribution of environment is changing and the performance is measured by \textit{adaptive regret}. The stochastic constraints are disclosed at each round to the learner after the decision is made. Different from the previous non-adaptive constrained OCO algorithm which is generalized based on the traditional online gradient descent algorithm, we propose a novel \textit{Virtual queue based Following-the-Leader-History} (VFLH) strategy to make the constrained OCO algorithm adaptive and design the VFLH algorithm. In this setting, the algorithm firstly generalizes all the experts in the specified time interval, then decides the optimal decision with each expert and gives out the final choice by combining the predictions of active experts. In terms of the algorithm performance, there are two performance metrics to be evaluated, i.e., the bounds of constraint violation and regret. For the constraint violation, we bring in the multi-objective drift analysis approach to deal with the constraints via a virtual queue which provides a new method to bound the constraints violations. For the regret, we give out its upper bound and then achieve a corresponding lower bound that proves the upper bound is sufficiently tight. Finally, we provide some numerical experiments to validate the feasibility of our algorithm. © 2022, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

V³H: View Variation and View Heredity for Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2020年第3期1卷 233-247页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Oliver The School of Computer Science and Technology Key Laboratory of Information Storage System Ministry of Education of China Huazhong University of Science and Technology Wuhan 430074 China The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China The Department of Electrical and Computer Engineering University of Florida Gainesville 32611 FL United States

Real data often appear in the form of multiple incomplete views. Incomplete multiview clustering is an effective method to integrate these incomplete views. Previous methods only learn the consistent information between different views and ignore the unique information of each view, which limits their clustering performance and generalizations. To overcome this limitation, we propose a novel View Variation and View Heredity approach (V³H). Inspired by the variation and the heredity in genetics, V³H first decomposes each subspace into a variation matrix for the corresponding view and a heredity matrix for all the views to represent the unique information and the consistent information respectively. Then, by aligning different views based on their cluster indicator matrices, V³H integrates the unique information from different views to improve the clustering performance. Finally, with the help of the adjustable low-rank representation based on the heredity matrix, V³H recovers the underlying true data structure to reduce the influence of the large incompleteness. More importantly, V³H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multiview data. Extensive experimental results on fifteen benchmark datasets validate its superiority over other state-of-the-arts. Impact Statement—Incomplete multiview clustering is a popular technology to cluster incomplete datasets from multiple sources. The technology is becoming more significant due to the absence of the expensive requirement of labeling these datasets. However, previous algorithms cannot fully learn the information of each view. Inspired by variation and heredity in genetics, our proposed algorithm V³H fully learns the information of each view. Compared with the state-of-the-art algorithms, V³H improves clustering

关键词： Incomplete multiview clustering view heredity view variation

来源：评论

学校读者我要写书评

暂无评论

On Explainability of graph neural networks via Subgraph explorations

arXiv

引用

arXiv 2021年

作者： Yuan, Hao Yu, Haiyang Wang, Jie Li, Kang Ji, Shuiwang Department of Computer Science & Engineering Texas A&M University TX United States Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei China West China Biomedical Big Data Center West China Hospital Chengdu China

We consider the problem of explaining the predictions of graph neural networks (GNNs), which otherwise are considered as black boxes. Existing methods invariably focus on explaining the importance of graph nodes or edges but ignore the substructures of graphs, which are more intuitive and human-intelligible. In this work, we propose a novel method, known as SubgraphX, to explain GNNs by identifying important subgraphs. Given a trained GNN model and an input graph, our SubgraphX explains its predictions by efficiently exploring different subgraphs with Monte Carlo tree search. To make the tree search more effective, we propose to use Shapley values as a measure of subgraph importance, which can also capture the interactions among different subgraphs. To expedite computations, we propose efficient approximation schemes to compute Shapley values for graph data. Our work represents the first attempt to explain GNNs via identifying subgraphs explicitly and directly. Experimental results show that our SubgraphX achieves significantly improved explanations, while keeping computations at a reasonable level. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：