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

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuejia Wu Jian-Tao Zhou Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph is an important research field that involves the storage and management of knowledge, but the incompleteness and sparsity of Knowledge Graphs hinder their application in many fields. Knowledge Graph Reasoning aims to alleviate this problem by completing missing paths or identifying wrong paths between entities. Graph Convolution Network (GCN) based methods are one of the state-of-the-art approaches to this work. However, it is difficult to directly generalize to unknown nodes and utilizes valid information from the local neighborhood which results in poor flexibility and extensibility and will loss of important information. This paper presents EG-KGR, a plug-and-play knowledge reasoning model based on enhanced graph sampling and aggregate inductive learning algorithm to relieve the above problems and enhance existing GCN-based methods. Specifically, EG-KGR supports incremental characteristics, uses inductive learning to replace transductive learning, and designs random sampling and local information sampling optimization methods to improve the model's generalization ability, prediction accuracy, and running speed. Extensive experimental results show that our EG-KGR can achieve optimal results.

关键词： Training Knowledge engineering Convolution Aggregates Optimization methods Knowledge graphs Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

SASA-Net: A spatial-aware self-attention mechanism for building protein 3D structure directly from inter-residue distances

SASA-Net: A spatial-aware self-attention mechanism for build...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Gong, Tiansu Ju, Fusong Sun, Shiwei Bu, Dongbo Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Zhongke Big Data Academy Henan Zhengzhou450046 China

ISBN: (纸本)9781665401265

Protein structure prediction has achieved considerable progresses mainly due to the increased accuracy of inter-residue distance estimation and the application of deep learning *** of the distance-based ab initio prediction approaches adopt a two-step diagram: constructing a potential function based on the estimated inter-residue distances, and then build a 3D structure that minimizes the potential function. These approaches have proven very promising;however, they still suffer from several limitations, especially the inaccuracies incurred by the handcrafted potential ***, we present SASA-Net, a deep learning-based approach that directly learns protein 3D structure from the estimated inter-residue distances. Unlike the existing approach simply representing protein structures as coordinates of atoms, SASA-Net represents protein structures using pose of residues, i.e., the coordinate system of each individual residue in which all backbone atoms of this residue are fixed. The key element of SASA-Net is a spatial-aware self-attention mechanism, which is able to adjust a residue's pose according to all other residues' features and the estimated distances between residues. By iteratively applying the spatial-aware self-attention mechanism, SASA-Net continuously improves the structure and finally acquires a structure with high accuracy. Using the CATH35 proteins as representatives, we demonstrate that SASA-Net is able to accurately and efficiently build structures from the estimated inter-residue distances. The high accuracy and efficiency of SASA-Net enables an end-to-end neural network model for protein structure prediction through combining SASA-Net and an neural network for inter-residue distance prediction. Source code of SASA-Net is available at https://*** gongtiansu/SASA-Net/ © 2021 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

A Novel Effectiveness Assessment Framework for Neoadjuvant Chemoradiotherapy of Locally Advanced Rectal Cancer Based on Multi-modal Intelligence

A Novel Effectiveness Assessment Framework for Neoadjuvant C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiao Tian Dong Sui Weifeng Liu Maozu Guo Gongning Luo Kuanquan Wang Beijing Key Laboratory for Intelligent Processing Methods of Architectural Big Data Beijing China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China Perceptual Computing Research Center Harbin Institute of Technology Harbin China

ISBN: (数字)9798350337488

ISBN: (纸本)9798350337495

Neoadjuvant chemoradiotherapy (nCRT) is the stan-dard treatment for locally advanced rectal cancer (LARC). With the development of artificial intelligence, an increasing number of studies have begun to explore its application in cancer treatment prediction. However, the prior methods exhibit considerable variability even with slight modifications to the input data, which could potentially undermine the reliability of the results. In this paper, we proposed RP-Net, a novel multi-modal fusion-based framework that combines feature information from magnetic resonance imaging (MRI) and whole slide images (WSI), establishing a relationship to map the therapeutic effectiveness of nCRT for LARC. We investigated the relationship of the tumour region and its periphery tissues, and demonstrated the validity of the proposed framework that involving 11 different combinations of modalities. The experimental results revealed that it has achieved higher prediction accuracy compared to the four intra-categories single-modal combinations and outperformed the two intra-categories multi-modal combinations. When compared to the other four inter-categories multi-modal combinations, the fusion features get accuracy of 2 % ~ 6% improvement respectively.

关键词： Protocols Magnetic resonance imaging Decision making Cancer treatment Reliability Bioinformatics Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Blockchain and Trusted Reputation Assessment-Based Incentive Mechanism for Healthcare Services

SSRN

引用

SSRN 2023年

作者： Liu, Yanhua Liu, Zhihuang Zhang, Qiu Su, Jinshu Li, Xiaoyan College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Blockchain-based healthcare IoT technology research promotes increased security for smart healthcare services such as real-time monitoring and remote disease diagnosis. In a healthcare IoT service system, it remains a challenging problem to explore effective incentive mechanisms throughout the healthcare service process and feedback to facilitate the efficiency of the blockchain consensus process. In this paper, we propose a blockchain and trusted reputation assessment-based incentive mechanism for healthcare services (BtRaI). BtRaI provides a realistic and comprehensive reputation assessment with feedback to motivate blockchain consensus node participation, effectively defending against malicious behavior in the healthcare service system. Specifically, BtRaI first introduces multiple moderation factors for comprehensive multidimensional reputation assessment and stores the assessment results credibly on the blockchain. Then, we propose an improved PBFT algorithm based on the reputation assessment to enhance blockchain consensus efficiency. Finally, BtRaI designs a token reward and punishment mechanism to motivate all parties to participate in the blockchain honestly, inhibit potential misbehavior, and encourage the healthcare system to provide better service quality. Theoretical analysis and experimental evaluation demonstrate that BtRaI effectively suppresses malicious attacks in healthcare services, improves blockchain node failure tolerance rates, and achieves blockchain transaction processing efficiency within 0.5 seconds in a 100-node consortium chain. The reputation assessment and token incentive mechanism of BtRaI have a realistic differentiation granularity and change curve, making it suitable for dynamic and complex healthcare service scenarios. © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Feature Selection Based on Consistent Granulation

SSRN

引用

SSRN 2024年

作者： Yang, Tian Shen, Shuo Deng, Jinsheng Liang, Jie Qian, Yuhua Dai, Jianhua Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Hunan Changsha410081 China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China Institute of Big Data Science and Industry Shanxi university Shanxi Taiyuan030006 China

Classifying large-scale data is a challenging task in machine learning. Feature selection and feature construction can improve the classification performances of classifiers. However, existing feature selections struggle to handle large-scale data. Granulation is the key process for generating accurate and efficient models. In this paper, we propose a novel granulation approach based on rough sets, consistent granulation, and a novel feature construction based on consistent granulation to improve the computation speed, scale, and classification performance of feature selection. As a result, the time and space complexities are reduced to a linear level in terms of sample scales. Moreover, consistent granulation can precisely represent the topological structure of the data and reduce the parameter space from [0, 1] to a finite set lowering the difficulty of optimal parameter searching. Experiments show that the proposed algorithm, FCG, outperforms four classical feature selection algorithms in handling datasets with millions of samples or tens of thousands of dimensions. Additionally, on the first thirteen datasets, FCG reduces the average runtime by 1145.68 times (NARNeMF), 883.11 times (HANDI), 1333.10 times (GBNRS), and 3.73 times (RMDPS), while increasing the average classification accuracy by 2.73% (FARNeMF), 2.30% (HANDI), 4.61% (GBNRS) and 14.33% (RMDPS) compared to these methods. © 2024, The Authors. All rights reserved.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, Xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

arXiv

引用

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

arXiv

引用

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion

arXiv

引用

arXiv 2024年

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024, CC BY.

关键词： Color image processing

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Prediction Method Based on MODWT-EMD for Time Series in Wireless Sensor Networks 16

A Hybrid Prediction Method Based on MODWT-EMD for Time Serie...

引用

16th IEEE International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2021

作者： Wang, Zhongmin Jia, Jingwen Gao, Cong Chen, Yanping Xia, Hong Xi'an University of Posts and Telecommunications Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an China Xi'an University of Posts and Telecommunications School of Computer Science Technology Xi'an China Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an China

ISBN: (纸本)9781665405539

Time series is the main form of sensor data. Time series prediction is conducive to reduce the energy consumption of sensor nodes and increase the service life. As time cost and computation cost of the existing hybrid prediction methods for time series are not good, this paper proposes a hybrid prediction method based on MODWT-EMD for time series. Firstly, the original time series is decomposed into multiple frequency components by Maximal Overlapping Discrete Wavelet Transform (MODWT). Secondly, the multiple frequency components are decomposed successively by Empirical Mode Decomposition (EMD) to obtain IMF components and residuals. IMFs and residuals contain the feature information of time series. Then, the importance of the extracted feature information is scored and sorted by random forest. We select feature information with a higher score. Finally, the selected feature information is input into Bi-GRU for training. We predicted the original time series by the trained Bi-GRU and obtained the prediction results. The experimental results show that the method proposed in this paper can predict the time series effectively. © 2021 IEEE.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：