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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： CHAO LIU XIZHAO WANG QIANG LIU Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

ISBN: (数字)9798331528041

ISBN: (纸本)9798331528058

Drug-drug interactions (DDIs) refer to the synergistic or antagonistic effects between different drugs. Synergistic effects can enhance therapeutic efficacy, while antagonistic effects may reduce efficacy or even trigger adverse reactions, worsening the patient's condition. Most existing DDI prediction studies overlook the features of chemical bonds between atoms within drug molecules and the interaction types between drug pairs, which to some extent limits the accuracy and reliability of the predictions. In view of this, we have designed a novel framework called KGE-DDI, which leverages knowledge graph embedding (KGE) technology to enhance the prediction of DDIs. Specifically, for individual drug molecules, KGE-DDI first integrates the features of atoms and chemical bond. Then, by introducing attention mechanisms and graph neural network technology, it learns representations of the drug molecules. For pairs of drug molecules, KGE-DDI models their interactions utilizing atom-level Pearson correlation matrices. Finally, it predicts the interactions between drug pairs by employing our designed scoring function. We conducted comprehensive experiments under both transductive and inductive settings, and the results demonstrate the effectiveness and superiority of KGE-DDI in three scenarios: (existing drug, existing drug), (new drug, new drug), and (new drug, existing drug).

关键词： Drugs Measurement Correlation Knowledge graphs Atoms Predictive models Graph neural networks Reliability Chemicals Cybernetics

来源：评论

学校读者我要写书评

暂无评论

KAN-Face: Efficient Resource Usage and Precision Lip-Sync in Talking Head Generation

KAN-Face: Efficient Resource Usage and Precision Lip-Sync in...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Guanwen Feng Siyu Jin Zhihao Qian Yunan Li Qiguang Miao School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Despite significant progress in NeRF-based talking head generation, problems like poor lip synchronization and inefficient resource usage remain. To solve these, we propose KANFace, a lightweight framework. In preprocessing, we introduce a Lip-Sync Enhancement Module that uses Wav2Lip to extract high-resolution audio features and map them to an explicit intermediate representation, ensuring precise lip movement alignment with the speaker’s identity. These predicted lip-sync features are combined with fundamental audio-extracted lip features and injected into the rendering module to improve synchronization. For rendering, we introduce FastKAN to map spatial points to color values. As a variant of KAN, FastKAN’s sensitivity to 3D scenes and efficient structure enable precise, fast color prediction. Our framework reduces resource consumption while enhancing lip-sync accuracy and facial reconstruction, making it ideal for talking head generation tasks in resource-limited settings. Project: https://***/KAN-Face/

关键词： Accuracy Three-dimensional displays Lips Color Signal processing Rendering (computer graphics) Feature extraction Synchronization Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving Objects

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： You Chen Hua Dai Mingfeng Jiang Qu Lu Pengyue Li Bohan Li Geng Yang Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

During infectious disease outbreaks, tracking contacted objects is important for suppressing the spread of the virus and using trajectories of moving objects to discover contacted objects is one of effective approaches. Existing algorithms focus on individual contact event discovery but lack the ability to obtain the k-degree contact events. In this paper, we propose efficient k-degree contact pattern mining algorithms that are capable of mining k-degree contact events. The definition of k-degree contact event is first formulated. Based on the definition, a sliding window-based baseline k-degree contact pattern mining algorithm (KCPMA) is presented. To improve the mining efficiency, the sample-point checking strategy and R-tree index are adopted and the optimized mining algorithm (KCPMA+) is proposed. Comprehensive experiments on real datasets demonstrate that the proposed algorithms are effective and efficient in mining k-degree contact events.

关键词： Costs Infectious diseases Federated learning Computer viruses Trajectory Indexes data mining

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stream Network for Mesh Denoising Via Graph Neural Networks with Gaussian Curvature

A Multi-Stream Network for Mesh Denoising Via Graph Neural N...

引用

IEEE International Conference on Image Processing

作者： Zhibo Zhao Wenhui Wu Hongjie Liu Yuanhao Gong Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China GuangdongHK Joint Laboratory for Big Data Imaging and Communication Reexen Technology Ltd

3D meshes are getting popular in both research and industry. However, the meshes obtained via the 3D scanning equipment frequently contain a high level of noise. In this paper, we present a Gaussian Curvature Driven Multi-stream Network (GCM-Net) based on graph convolutional networks. This network can remove the noise while preserving the essential features during the 3D mesh denoising process. Our method is the first attempt to apply the high-order feature (i.e., Gaussian curvature) in the denoising task, which is more descriptive for the shape of the mesh. GCM-Net consists of curvature stream, vertex stream, and face normal stream, where the curvature stream focuses on the high-order Gaussian curvature feature of 3D mesh. Our method achieves state-of-the-art results on a publicly available dataset, demonstrating its effectiveness. The proposed method can be applied in various applications, such as 3D human body modeling, metaverse, object tracking and biomedical visualization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Multi-direction Prediction Multi-objective Hybrid Chemical Reaction Optimization Algorithm for Dynamic Multi-objective Optimization 16th

A Multi-direction Prediction Multi-objective Hybrid Chemical...

引用

16th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2021

作者： Li, Hongye Pan, Xiaoying Gan, Wei Wang, Lei School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China Xi’an Shiyou University Shaanxi Xi’an710065 China School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China Shaanxi University of Technology Shaanxi Han Zhong723001 China

ISBN: (纸本)9789811912559

The challenge of solving dynamic multi-objective optimization problems is to trace the varying Pareto optimal front and/or Pareto optimal set quickly and efficiently. This paper proposes a multi-direction prediction strategy using a hybrid chemical reaction optimization, aimed at finding the dynamic Pareto optimal front and/or Pareto optimal set as quickly and accurately as possible before the next environmental change occurs. The proposed method, multi-direction prediction multi-objective hybrid chemical reaction optimization algorithm which mainly includes a hybrid chemical reaction optimization algorithm is proposed for solving dynamic multi-objective problems, which can guide population trace the optimum. When the environment has changed, the population is divided into several subpopulations. In subpopulation, a center point was found to construct multi-direction prediction model. As a result, this approach enhances the diversity of algorithm. While the environment has not changed, the hybrid chemical reaction algorithm with particle swarm optimization algorithm can efficiency find the optimal solution, it can achieve good diversity as well as guarantee the avoidance of local optimal solutions. The proposed algorithm is measured on several benchmark test suites with various dynamic characteristics and different difficulties. Experimental results show that this algorithm is very competitive in dealing with dynamic multi-objective optimization problems when compared with four state-of-the-art approaches. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptation Random Vector Functional Link for White Blood Cell Classification

Domain Adaptation Random Vector Functional Link for White Bl...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Qin Wang Xi-Zhao Wang Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

ISBN: (数字)9798331528041

ISBN: (纸本)9798331528058

There's growing recognition of how machine learning can revolutionize the precision and swiftness of clinical diagnoses by improving the classification of white blood cells. However, a machine learning model specialized in white blood cell classification demands access to a large trove of well-annotated data. This poses a challenge, as in the medical field, annotating data comprehensively comes with a high cost in terms of both money and time. To circumvent this, domain adaptation (DA) techniques are employed to leverage similar cell images from related domains, thereby boosting the model's performance in white blood cell classification in specific contexts. Among the myriad DA approaches available for this application, including TCA-based and deep learning methods, all typically suffer from lengthy training durations. Addressing this challenge, we introduce a novel DA method inspired by the random vector functional link (RVFL) network, a type of neural network characterized by its random weights. Our proposed method, named Domain Adaptation Random Vector Functional Link (DA-RVFL), capitalizes on the efficiency of RVFL networks to enhance white blood cell classification. This innovative approach shows some insights for future research in the efficient and effective classification of white blood cells.

关键词： White blood cells Training Deep learning Adaptation models Neural networks Focusing Vectors data models Medical diagnosis Medical diagnostic imaging

来源：评论

学校读者我要写书评

暂无评论

Dynamic Alarm Causality Analysis Method Integrating Monitoring Contribution and Transfer Entropy

Dynamic Alarm Causality Analysis Method Integrating Monitori...

引用

2023 China Automation Congress, CAC 2023

作者： Luo, Yi Yang, Lingkai Nie, Linhao Xu, Yuan Zhu, Qunxiong Cheng, Jian Research Institute of Mine Big Data Chinese Institute of Coal Science Tiandi Science and Technology Co. Ltd. State Key Laboratory for Intelligent Coal Mining and Strata Control Beijing China College of Information Science and Technology Beijing University of Chemical Technology Beijing China

ISBN: (纸本)9798350303759

Alarm flooding poses a significant safety hazard in industry. It is of paramount importance to uncover the causality behind alarm flooding at its early stages. On one hand, limited data samples make it challenging to accurately determine the causal relationships among alarms. On the other hand, a massive volume of data samples may lead to delays in causal inference. This paper proposes a Contribution and Transfer-entropy based Dynamic Alarm Causality analysis method (CT-DAC) to address this. CT-DAC reconstructs the contribution of each monitored variable to the dynamic anomalies in the system, enabling dynamic causal relationship mining based on limited data. This approach offers a faster and more accurate solution for identifying the initial alarm causality triggering alarm flooding problems. Experimental work conducted on the Tennessee Eastman Process demonstrates the superior performance of the CT-DAC method. © 2023 IEEE.

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D point clouds: class-wise transformation is all you need 24

Unlearnable 3D point clouds: class-wise transformation is al...

引用

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

作者： Xianlong Wang Minghui Li Wei Liu Hangtao Zhang Shengshan Hu Yechao Zhang Ziqi Zhou Hai Jin National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9798331314385

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples; (ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

KAC-Unet: A Medical Image Segmentation With the Adaptive Group Strategy and Kolmogorov-Arnold Network

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Lin, Shiying Hu, Rong Li, Zuoyong Lin, Qinghua Zeng, Kun Wu, Xiang Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Fuzhou350121 China Fuzhou University Affiliated Provincial Hospital Provincial Clinical Medical College Fujian Medical University Department of Urology Fuzhou350001 China

In the field of deep learning-based medical image segmentation, convolutional neural networks (CNNs) extract image features by combining linear convolutional layers with nonlinear activation functions. However, excessive stacking of linear layers in the network limits the model’s ability to capture fine-grained details. In addition, the feature distribution imbalance caused by the traditional fixed grouping strategy (FGS) can affect the deep model’s capacity to perceive the overall structure of the image. To address these challenges, we propose a medical image segmentation framework, called Kolmogorov-Arnold Network with the adaptive group strategy and contextual Transformer based on Unet (KAC-Unet). First, we propose the adaptive group strategy (AGS) to balance the grouping of different input channels, alleviating the performance degradation caused by differences in group information. Then, we propose the Shift Tokenized Kolmogorov-Arnold Network (KAN) Block to capture complex features in medical images through flexible nonlinear transformations and shift operations. Extensive experiments are conducted on three medical image segmentation datasets. The results demonstrate the effectiveness and superiority of our proposed method compared with state-of-the-art algorithms. © 1963-2012 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary 39

Multi-Granularity Open Intent Classification via Adaptive Gr...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Yanhua Ouyang, Xiaocao Pan, Chaofan Zhang, Jie Zhao, Sen Xia, Shuyin Yang, Xin Wang, Guoyin Li, Tianrui School of Computing and Artificial Intelligence Southwestern University of Finance and Economics Chengdu611130 China Engineering Research Center of Intelligent Finance Ministry of Education Chengdu611130 China Key Laboratory of Big Data Intelligent Computing Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China

ISBN: (纸本)157735897X

Open intent classification is critical for the development of dialogue systems, aiming to accurately classify known intents into their corresponding classes while identifying unknown intents. Prior boundary-based methods assumed known intents fit within compact spherical regions, focusing on coarse-grained representation and precise spherical decision boundaries. However, these assumptions are often violated in practical scenarios, making it difficult to distinguish known intent classes from unknowns using a single spherical boundary. To tackle these issues, we propose a Multi-granularity Open intent classification method via adaptive Granular-Ball decision boundary (MOGB). Our MOGB method consists of two modules: representation learning and decision boundary acquiring. To effectively represent the intent distribution, we design a hierarchical representation learning method. This involves iteratively alternating between adaptive granular-ball clustering and nearest sub-centroid classification to capture fine-grained semantic structures within known intent classes. Furthermore, multi-granularity decision boundaries are constructed for open intent classification by employing granular-balls with varying centroids and radii. Extensive experiments conducted on three public datasets demonstrate the effectiveness of our proposed method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：