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

arXiv 2023年

作者： Xu, Fangzhi Liu, Jun Lin, Qika Zhao, Tianzhe Zhang, Jian Zhang, Lingling School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D National Engineering lab for Big Data Analytics Xi’an China

Logical reasoning task involves diverse types of complex reasoning over text, based on the form of multiple-choice question answering. Given the context, question and a set of options as the input, previous methods achieve superior performances on the full-data setting. However, the current benchmark dataset has the ideal assumption that the reasoning type distribution on the train split is close to the test split, which is inconsistent with many real application scenarios. To address it, there remain two problems to be studied: (1) How is the zero-shot capability of the models (train on seen types and test on unseen types)? (2) How to enhance the perception of reasoning types for the models? For problem 1, we propose a new benchmark for generalized zero-shot logical reasoning, named ZsLR. It includes six splits based on the three type sampling strategies. For problem 2, a type-aware model TaCo is proposed. It utilizes both the heuristic input reconstruction and the contrastive learning to improve the type perception in the global representation. Extensive experiments on both the zero-shot and full-data settings prove the superiority of TaCo over the state-of-the-art methods. Also, we experiment and verify the generalization capability of TaCo on other logical reasoning dataset. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Network for Segmenting Pathology Lesion of the Focal Lymphocytic Sialadenitis

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Ne...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Hao Han Feng Lu Yanhan Deng Xiaofang Luo Hai Jin Wei Tu Xia Xie National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

In the medical realm, the pivotal role of pathological Whole Slide Images (WSIs) in detecting cancer, tracking disease progression, and evaluating treatment efficacy is indisputable. Nevertheless, the identification and quantification of lesion areas in these gigapixel WSIs present a significant challenge due to their substantial size and the intricate details of lesions. To address these issues, we developed a novel multi-resolution and multi-scale cross fusion network (M 2 CF-Net), adept at managing large-scale pathological WSIs and capturing both fine details and context. Our model particularly focuses on segmenting local lymphocyte infiltration lesions in pathological WSIs of patients diagnosed with primary Sjogren's syndrome. By employing a patch-based training approach and combining interconnected elements via a multi-scale fusion technique, we enhance our model's capacity to detect and analyze structures and features in minor salivary gland section WSIs. Extensive experiments and ablation studies conducted on real-world clinical datasets affirm our model's superior accuracy in identifying lymphocyte-infiltrated regions over state-of-the-art models, with a performance improvement of up to 4.32% in terms of the Dice Similarity Coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

引用

Intelligent data Analysis 2020年第4期24卷 941-958页

作者： Liu, Guliu Li, Lei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei Anhui 230009 China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Mininglamp Academy of Sciences Mininglamp Technologies Beijing China

Graph pattern matching has been widespread used for protein structure analysis, expert finding and social group selection, ect. Recently, the study of graph pattern matching using the abundant attribute information of vertices and edges as constraint conditions has attracted the attention of scholars, and multi-constrained simulation has been proposed to address the problem in contextual social networks. Actually, multi-constrained graph pattern matching is an NP-complete problem and the fuzziness of constraint variables may exist in many applications. In this paper, we introduce a multi-fuzzy-constrained graph pattern matching problem in big graph data, and propose an efficient first-k algorithm Fuzzy-ETOF-K for solving it. Specifically, exploration-based method based on edge topology is adopted to improve the efficiency of edge connection, and breadth-first bounded search is used for edge matching instead of shortest path query between two nodes to improve the efficiency of edge matching. The results of our experiments conducted on three datasets of real social networks illustrate that our proposed algorithm Fuzzy-ETOF-K significantly outperforms existing approaches in efficiency and the introduction of fuzzy constraints makes our proposed algorithm more efficient and effective. © 2020 - IOS Press and the authors. All rights reserved.

关键词： big graph data Graph pattern matching multi-fuzzy-constrained

来源：评论

学校读者我要写书评

暂无评论

Motif-based graph self-supervised learning for molecular property prediction 21

Motif-based graph self-supervised learning for molecular pro...

引用

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

作者： Zaixi Zhang Qi Liu Hao Wang Chengqiang Lu Chee-Kong Lee Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Tencent America

ISBN: (纸本)9781713845393

Predicting molecular properties with data-driven methods has drawn much attention in recent years. Particularly, Graph Neural Networks (GNNs) have demonstrated remarkable success in various molecular generation and prediction tasks. In cases where labeled data is scarce, GNNs can be pre-trained on unlabeled molecular data to first learn the general semantic and structural information before being finetuned for specific tasks. However, most existing self-supervised pre-training frameworks for GNNs only focus on node-level or graph-level tasks. These approaches cannot capture the rich information in subgraphs or graph motifs. For example, functional groups (frequently-occurred subgraphs in molecular graphs) often carry indicative information about the molecular properties. To bridge this gap, we propose Motif-based Graph Self-supervised Learning (MGSSL) by introducing a novel self-supervised motif generation framework for GNNs. First, for motif extraction from molecular graphs, we design a molecule fragmentation method that leverages a retrosynthesis-based algorithm BRICS and additional rules for controlling the size of motif vocabulary. Second, we design a general motif-based generative pre-training framework in which GNNs are asked to make topological and label predictions. This generative framework can be implemented in two different ways, i.e., breadth-first or depth-first. Finally, to take the multi-scale information in molecular graphs into consideration, we introduce a multi-level self-supervised pre-training. Extensive experiments on various downstream benchmark tasks show that our methods outperform all state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Boosting Factorization Machines via Saliency-Guided Mixup

arXiv

引用

arXiv 2022年

作者： Wu, Chenwang Lian, Defu Ge, Yong Zhou, Min Chen, Enhong Tao, Dacheng School of Data Science University of Science and Technology of China Anhui Hefei230000 China Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Anhui Hefei230000 China Eller College of Management University of Arizona United States Huawei Noah’s Ark Lab Hong Kong JD Explore Academy in *** China University of Sydney Australia

Factorization machines (FMs) are widely used in recommender systems due to their adaptability and ability to learn from sparse data. However, for the ubiquitous non-interactive features in sparse data, existing FMs can only estimate the parameters corresponding to these features via the inner product of their embeddings. Undeniably, they cannot learn the direct interactions of these features, which limits the model’s expressive power. To this end, we first present MixFM, inspired by Mixup, to generate auxiliary training data to boost FMs. Unlike existing augmentation strategies that require labor costs and expertise to collect additional information such as position and fields, these extra data generated by MixFM only by the convex combination of the raw ones without any professional knowledge support. More importantly, if the parent samples to be mixed have non-interactive features, MixFM will establish their direct interactions. Second, considering that MixFM may generate redundant or even detrimental instances, we further put forward a novel Factorization Machine powered by Saliency-guided Mixup (denoted as SMFM). Guided by the customized saliency, SMFM can generate more informative neighbor data. Through theoretical analysis, we prove that the proposed methods minimize the upper bound of the generalization error, which hold a beneficial effect on enhancing FMs. Significantly, we give the first generalization bound of FM, implying the generalization requires more data and a smaller embedding size under the sufficient representation capability. Finally, extensive experiments on five datasets confirm that our approaches are superior to baselines. Besides, the results show that"poisoning" mixed data is likewise beneficial to the FM variants. Copyright © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Attenuated niacin-induced skin flush response in individuals with clinical high risk for psychosis

引用

General Psychiatry 2022年第2期35卷 92-100页

作者： Ranpiao Gan Yanyan Wei Guisen Wu Jiahui Zeng Yegang Hu Lihua Xu Xiaochen Tang Xiaohua Liu Haichun Liu Tao Chen Jijun Wang Tianhong Zhang Shanghai Intelligent Psychological Evaluation and Intervention Engineering Technology Research Center Shanghai Key Laboratory of Psychotic DisordersShanghai Mental Health CenterShanghai Jiao Tong University School of MedicineShanghaiChina Department of Automation Shanghai Jiao Tong UniversityShanghaiChina Big Data Research Lab University of WaterlooWaterlooOntarioCanada Center for Excellence in Brain Science and Itelligence Technology(CEBSIT) Chinese Academy of ScienceShanghaiChina Brain Science and Technology Research Center Shanghai Jiao Tong UniversityShanghaiChina

Background Im paired sesitwity of he soin Mlush response bo miacin is one of the most rpicated findngs in patents with schizoprenia *** studies have usaly focused on postonset psychusis,and ll is knowm about the dinical high-risk(CHR)phase of niacin senstity in psychosis Aims To proftle and compare the miacin flush responsge among CHR individuals(converters and non-coverters)patients with frstepso schinophrenia(FES)and healty controls(HCs).Methods Sensivily 1o ftour concentralions (0.1-0001M)of aqueous methylnicotinate was tested in 105 CHR individuals,57 patients with FES and 52 *** individuals were further grouped as converters and non converters according to the 2-year follow-up *** flush response scores were rated on a 4-point *** Of the 105 CHR individuals,21 individuals were lost during the study,leaving 84 CHR individuals;16(19.0%)converted to full psychosis at 2 years of *** response scores identifed in the CHR samples were characterised as modest degree levels,intermediate between those of HC individuals and patients with *** flush responses in the CHR group mimicked the responses observed in the FES group at higher concentrations(0.01 M,0.1 M)and longer time points(15 min,20min);however,these became comparable vith the responses in the HC group at the shorter time points and at lower concentr *** converters exhibited lower mean flush response scores than the *** Attenuated niacin-induced flushing emerged during the early phase of *** devices should be developed and verified for objective quantification of skin responses in the CHR population.

关键词： Skin high shorter

来源：评论

学校读者我要写书评

暂无评论

Meta-Path Based Graph Contrastive Learning for Micro-Video Recommendation

SSRN

引用

SSRN 2022年

作者： He, Ying Wu, Gongqing Cai, Desheng Hu, Xuegang Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230009 China

Nowadays, micro-video sharing platforms have become popular tools for people creating and viewing micro-videos in daily life. Micro-video recommendation task has attracted significant attention from researchers, recently. The key to a high-quality micro-video recommendation system is learning meaningful user and micro-video representations. Recently, many graph neural networks (GNNs) are proposed to learn node representations in graphs, which could be useful for recommendation tasks. However, we argue that directly utilizing existing GNNs in micro-video recommendations is ill-posed. The reasons are: (1) most previous GNNs fail to capture the heterogeneity of heterogeneous graphs since they are designed for homogeneous graphs;(2) they overemphasize node proximity and could hurt the robustness of node embeddings. In contrast to previous work, we propose a meta-path-based graph contrastive learning network (MPGCL) that learns more meaningful user and video embeddings for recommendation. Specifically, we yield homogeneous graphs for user type and video type to better capture heterogeneity based on a well-designed meta-path-based random walk strategy. Furthermore, to learn more robust node embeddings that are less sensitive to noise, we propose a graph contrastive learning network on different types of homogeneous graphs, which maximizes the consistency between graph representations with different views. We do extensive experiments on three real-world datasets and the results show that our model can learn more meaningful embeddings for user and micro-videos and outperforms the strong baselines. © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Accelerating Backward Aggregation in GCN Training with Execution Path Preparing on GPUs

arXiv

引用

arXiv 2022年

作者： Xu, Shaoxian Shao, Zhiyuan Yang, Ci Liao, Xiaofei Jin, Hai The National Engineering Research Center for Big Data Technology and System 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 Zhejiang Lab Hangzhou311121 China

The emerging Graph Convolutional Network (GCN) has been widely used in many domains, where it is important to improve the efficiencies of applications by accelerating GCN trainings. Due to the sparsity nature and exploding scales of input real-world graphs, state-of-the-art GCN training systems (e.g., GNNAdvisor) employ graph processing techniques to accelerate the message exchanging (i.e. aggregations) among the graph vertices. Nevertheless, these systems treat both the aggregation stages of forward and backward propagation phases as all-active graph processing procedures that indiscriminately conduct computations on all vertices of an input graph. In this paper, we first point out that in a GCN training problem with a given training set on an input graph, its aggregation stages of backward propagation phases (called as backward aggregations in this paper) can be equivalently converted to partially-active graph processing procedures, which conduct computations on only partial vertices of the input graph. By leveraging such a finding, we propose an execution path preparing method that collects and coalesces the graph data used during different training layers of backward aggregations, and constructs their corresponding sub-graphs (called as execution paths in this paper) as inputs to conduct the backward training on GPUs. Further, we propose a structural-aware strategy for the execution paths to compute their optimal group sizes, so as to gain as high as possible performances on GPUs during the backward aggregations. The experiment results by conducting GCN training in typical real-world graphs show that compared with GNNAdvisor, our approach improves the performance of backward aggregations by up to 5.68x on NVIDIA P100 GPU, and up to 6.57x on NVIDIA V100S GPU. Copyright © 2022, The Authors. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Multiagent Q-Learning for Multicrew Dynamic Scheduling and Routing in Road Network Restoration

Multiagent Q-Learning for Multicrew Dynamic Scheduling and R...

引用

Chinese Control and Decision Conference, CCDC

作者： Yufeng Shen Lianqi Duan Qianshun Zhu Zhaopin Su Guofu Zhang School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 School of Computer Science and Information Engineering Hefei University of Technology Hefei Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) Hefei Anhui Province Key Laboratory of Industry Safety and Emergency Technology (Hefei University of Technology) Heifei

ISBN: (纸本)9781665478977

Road network restoration is an important issue in the post-disaster disposal and rescue, especially when extraordinarily serious natural disasters (e.g., floods and earthquakes) occur. Central to this endeavour is the problem of determining how to reasonably schedule and route the repair crew to quickly restore the damaged road network and establish reliable supply lines from supply nodes to demand nodes. However, most existing work focuses on the activities of the single repair crew in the static road network, which is unable to adapt to the dynamic changes of the road network caused by secondary disasters, such as rock slides and debris flows. Consequently, this work is concentrated on multicrew dynamic scheduling and routing in road network restoration. Specifically, a model of multicrew dynamic scheduling and routing is first presented. Next, the Markov decision process is adopted to construct a decision model for repair crews, based on which a multiagent Q-learning algorithm is developed to find the best scheduling and routing strategy. Finally, experimental results demonstrate that the proposed method can make repair crews adjust their scheduling and routing strategies according to the dynamic changes of the damaged road network and provides a useful attempt to restore the damaged road network in complex, dynamic emergency scenarios of post-disaster.

关键词： Schedules Q-learning Roads Heuristic algorithms Maintenance engineering Markov processes Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Improving human brucellosis susceptibility mapping using effective and simultaneously metaheuristic-based feature selection and hyperparameter tuning

引用

Acta Tropica 2025年 267卷 107657页

作者： Zandi, Iman Jafari, Ali Alesheikh, Ali Asghar Department of GIS School of Surveying and Geospatial Engineering College of Engineering University of Tehran Tehran Iran Department of GIS Faculty of Geodesy and Geomatics Engineering K. N. Toosi University of Technology Tehran Iran Geospatial Big Data Computations and Internet of Things (IoT) Lab K. N. Toosi University of Technology Tehran Iran

Human Brucellosis, a neglected zoonotic disease, affects 1.6 to 2.1 million people globally each year. In Iran, it has become a significant health concern, with an average annual incidence rate of 19.91 cases per 100,000 people. This study aims to create a reliable Human Brucellosis Susceptibility Map (HBSM) for Mazandaran Province using a hybrid machine learning approach that enhances performance through metaheuristic algorithms for feature and hyperparameter optimization. A transformation function is integrated into these algorithms to reduce computational and time complexities while simultaneously executing feature selection and hyperparameter tuning. Additionally, a two-phase mutation operator is employed to improve the performance of feature selection. The results indicate that the hybrid model of Support Vector Regression-Transformation Mutation Grey Wolf Optimizer (SVR-TMGWO) outperformed other models, achieving RMSE=0.7723, MAE=0.614, MdAE=0.473, and R = 0.536. The predicted HBSM for 2018 identified 68 rural districts in Mazandaran Province as being in the High and Very High susceptibility classes. The susceptibility map can help decision-makers more effectively prevent, control, and manage Human Brucellosis in Mazandaran Province. © 2025 Elsevier B.V.

关键词： Feature selection Human brucellosis susceptibility mapping Hyperparameter tuning Metaheuristics algorithms Support vector regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：