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

Conference on Empirical Methods in Natural Language Processing (EMNLP)

作者： Wu, Xin Cai, Yi Li, Qing Wang, Tao Yang, Kai South China Univ Technol Sch Software Engn Guangzhou Peoples R China South China Univ Technol Minist Educ Key Lab Big Data & Intelligent Robot Guangzhou Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Kings Coll London Dept Biostat & Hlth Informat London England City Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781952148606

Meta-embedding learning, which combines complementary information in different word embeddings, have shown superior performances across different Natural Language Processing tasks. However, domain-specific knowledge is still ignored by existing meta-embedding methods, which results in unstable performances across specific domains. Moreover, the importance of general and domain word embeddings is related to downstream tasks, how to regularize meta-embedding to adapt downstream tasks is an unsolved problem. In this paper, we propose a method to incorporate both domain-specific and task-oriented information into meta-embeddings. We conducted extensive experiments on four text classification datasets and the results show the effectiveness of our proposed method.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

SSM-DTA: Breaking the Barriers of data Scarcity in Drug-Target Affinity Prediction

arXiv

引用

arXiv 2022年

作者： Pei, Qizhi Wu, Lijun Zhu, Jinhua Xia, Yingce Xie, Shufang Qin, Tao Liu, Haiguang Liu, Tie-Yan Yan, Rui Gaoling School of Artificial Intelligence Renmin University of China No.59 Zhong Guan Cun Avenue Haidian District Beijing100872 China Microsoft Research AI4Science No.5 Dan Ling Street Haidian District Beijing100080 China CAS Key Laboratory of GIPAS EEIS Department University of Science and Technology of China No.96 JinZhai Road Baohe District Anhui Province Hefei230026 China Engineering Research Center of Next-Generation Intelligent Search and Recommendation Ministry of Education China Beijing Key Laboratory of Big Data Management and Analysis Methods China

Accurate prediction of Drug-Target Affinity (DTA) is of vital importance in early-stage drug discovery, facilitating the identification of drugs that can effectively interact with specific targets and regulate their activities. While wet experiments remain the most reliable method, they are time-consuming and resource-intensive, resulting in limited data availability that poses challenges for deep learning approaches. Existing methods have primarily focused on developing techniques based on the available DTA data, without adequately addressing the data scarcity issue. To overcome this challenge, we present the SSM-DTA framework, which incorporates three simple yet highly effective strategies: (1) A multi-task training approach that combines DTA prediction with masked language modeling (MLM) using paired drug-target data. (2) A semi-supervised training method that leverages large-scale unpaired molecules and proteins to enhance drug and target representations. This approach differs from previous methods that only employed molecules or proteins in pre-training. (3) The integration of a lightweight cross-attention module to improve the interaction between drugs and targets, further enhancing prediction accuracy. Through extensive experiments on benchmark datasets such as BindingDB, DAVIS, and KIBA, we demonstrate the superior performance of our framework. Additionally, we conduct case studies on specific drug-target binding activities, virtual screening experiments, drug feature visualizations, and real-world applications, all of which showcase the significant potential of our work. In conclusion, our proposed SSM-DTA framework addresses the data limitation challenge in DTA prediction and yields promising results, paving the way for more efficient and accurate drug discovery processes. Our code is available at https://***/QizhiPei/SSM-DTA. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Instant Edit Propagation on Images Based on Bilateral Grid

引用

Computers, Materials & Continua 2019年第8期61卷 643-656页

作者： Feng Li Chaofeng Ou Yan Gui Lingyun Xiang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Mechanical and Aerospace Engineering Nanyang Technological UniversitySingapore639798Singapore

The ability to quickly and intuitively edit digital content has become increasingly important in our everyday ***,existing edit propagation methods for editing digital images are typically based on optimization with high computational cost for large ***,existing edit propagation methods are generally inefficient and highly ***,to improve edit efficiency,this paper proposes a novel edit propagation method using a bilateral grid,which can achieve instant propagation of sparse image ***,given an input image with user interactions,we resample each of its pixels into a regularly sampled bilateral grid,which facilitates efficient mapping from an image to the bilateral *** a result,all pixels with the same feature information(color,coordinates)are clustered to the same grid,which can achieve the goal of reducing both the amount of image data processing and the cost of *** then reformulate the propagation as a function of the interpolation problem in bilateral space,which is solved very efficiently using radial basis *** results show that our method improves the efficiency of color editing,making it faster than existing edit approaches,and results in excellent edited images with high quality.

关键词： Instant edit propagation bilateral grid radial basis function image editing

来源：评论

学校读者我要写书评

暂无评论

Dynamic asymmetric reflective decision-making supports the evolution of cooperation

引用

Chaos, Solitons & Fractals 2025年 199卷

作者： Xiaopeng Li Xiuli Zhang Zhonglin Wang Yicheng Pang College of Big Data Statistics Guizhou University of Finance and Economics Guiyang Guizhou 550025 PR China Shanxi Key Laboratory of Intelligent Optimization Computing and Blockchain Technology Taiyuan Normal University Taiyuan Shanxi 030619 PR China Department of Applied Mathematics Guizhou University of Finance and Economics Guiyang Guizhou 550025 PR China

Up to now, most previous studies have assumed that agents employed symmetric decision-updating mechanisms to investigate how cooperation evolved in selfish populations. However, dynamic and asymmetric decision-making update is overlooked. In this paper, we try our best to construct a reputation-driven dynamic asymmetric reflective decision-making model to fill in the blanks. Initially, each agent is randomly assigned a reputation value within the range [1,100], which will increase or decrease if it makes cooperative or defective decision in the process of evolution. Then, we distinguish agents as standouts or laymen by the pivotal reputation threshold R c . The standouts with high-reputation are cautious in updating their decisions and therefore may think more times. In sharp contrast, the laymen with low-reputation, appear too reckless and just only think once in the similar process. Simulation results show that this simple model can support the evolution of cooperation, especially expanding the threshold for cooperation annihilation. Through qualitative micro-analysis and quantitative statistical analysis, we find that standouts with high reputations play an irreplaceable role in facilitating cooperation. The robustness test further confirms that the promoting effect of this mechanism on cooperation is independent of network structures, decision update patterns, and social dilemma types. We hope that our research can deepen the understanding and cognition of the evolution of cooperation.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Deep Separable Spatiotemporal Learning for Fast Dynamic Cardiac MRI

arXiv

引用

arXiv 2024年

作者： Wang, Zi Xiao, Min Zhou, Yirong Wang, Chengyan Wu, Naiming Li, Yi Gong, Yiwen Chang, Shufu Chen, Yinyin Zhu, Liuhong Zhou, Jianjun Cai, Congbo Wang, He Guo, Di Yang, Guang Qu, Xiaobo Department of Electronic Science Intelligent Medical Imaging R&D Center Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Xiamen University China Institute of Artificial Intelligence Xiamen University China Human Phenome Institute Fudan University China Department of Imaging Xiamen Cardiovascular Hospital of Xiamen University School of Medicine Xiamen University China Department of Cardiovascular Medicine Heart Failure Center Ruijin Hospital Lu Wan Branch Shanghai Jiaotong University School of Medicine China Shanghai Institute of Cardiovascular Diseases Zhongshan Hospital Fudan University China Department of Radiology Zhongshan Hospital Fudan University Department of Medical Imaging Shanghai Medical School Shanghai Institute of Medical Imaging China Fujian Province Key Clinical Specialty Construction Project Medical Imaging Department Xiamen Key Laboratory of Clinical Transformation of Imaging Big Data and Artificial Intelligence China School of Computer and Information Engineering Xiamen University of Technology China Department of Bioengineering and Imperial-X Imperial College London United Kingdom Department of Bioengineering Imperial College London United Kingdom

Dynamic magnetic resonance imaging (MRI) plays an indispensable role in cardiac diagnosis. To enable fast imaging, the k-space data can be undersampled but the image reconstruction poses a great challenge of high-dimensional processing. This challenge necessitates extensive training data in deep learning reconstruction methods. In this work, we propose a novel and efficient approach, leveraging a dimension-reduced separable learning scheme that can perform exceptionally well even with highly limited training data. We design this new approach by incorporating spatiotemporal priors into the development of a Deep Separable Spatiotemporal Learning network (DeepSSL), which unrolls an iteration process of a 2D spatiotemporal reconstruction model with both temporal low-rankness and spatial sparsity. Intermediate outputs can also be visualized to provide insights into the network behavior and enhance interpretability. Extensive results on cardiac cine datasets demonstrate that the proposed DeepSSL surpasses state-of-the-art methods both visually and quantitatively, while reducing the demand for training cases by up to 75%. Additionally, its preliminary adaptability to unseen cardiac patients has been verified through a blind reader study conducted by experienced radiologists and cardiologists. Furthermore, DeepSSL enhances the accuracy of the downstream task of cardiac segmentation and exhibits robustness in prospectively undersampled real-time cardiac MRI. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Online Tensor Decomposition for Hyperspectral data Representation

Online Tensor Decomposition for Hyperspectral Data Represent...

引用

Chinese Automation Congress (CAC)

作者： Jinrong He Yanxin Shi Chengwang Xie Zeyu Bao Zongwen Bai College of Mathematics and Computer Science Yan’an University Shaanxi China School of Computer and Information Engineering South China Normal University Shanwei China School of the Gifted Young University of Science and Technology of China Hefei China Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yan’an University Shaanxi China

ISBN: (纸本)9781665426480

Tensor is a natural representation of visual data, such as hyperspectral image data. Other than vector representation based feature extraction methods, tensor-based representation methods are more informative. Most existing data representation methods only work on vector spaces which are implemented by stacking the original tensor elements into a long vector. However, the vectorization will inevitably lost the underlying structural information and lead to high computational complexity. In order to reduce the memory requirements, we proposed an online tensor decomposition (OTD) method for hyperspectral image feature extraction. It does not require to load the whole tensor data set into main memory, and with the insertion of new tensor samples, it can update projection matrices incrementally, which is desirable for large data sets. In the experiments, the proposed method was applied into the task of apple hyperspectral data classification. The classification results confirm the effectiveness of online tensor decom-position method.

关键词： Visualization Tensors Memory management Stacking Feature extraction Matrix decomposition Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

arXiv

引用

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States 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

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation 21

APDPk-means: A new differential privacy clustering algorithm...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Fan, Zexuan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

How to protect users' private data during network data mining has become a hot issue in the fields of big data and network information security. Most current researches on differential privacy k-means clustering algorithms focus on optimizing the selection of initial centroids. However, the traditional privacy budget allocation has the problem that the random noise becomes too large as the number of iterations increases, which will reduce the performance of data clustering. To solve the problem, we improved the way of privacy budget allocation in differentially private clustering algorithm DPk-means, and proposed APDPk-means, a new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. APDPk-means decomposes the total privacy budget into a decreasing arithmetic progression, allocating the privacy budgets from large to small in the iterative process, so as to ensure the rapid convergence in early iteration. The experiment results show that compared with the other differentially private k-means algorithms, APDPk-means has better performance in availability and quality of the clustering result under the same level of privacy protection. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Causal Adversarial Graph Neural Network for Multi-Center Autism Spectrum Disorder Identification

SSRN

引用

SSRN 2025年

作者： Zhang, Zhuan Wang, Lihui Chen, Qijian Wang, Li Jian, Caiqing Zhu, Yue-Min Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 Lyon69621 France

Due to the heterogeneous distributions of multi-center rs-fMRI data, currently it is still challenging to identify accurately autism spectrum disorder (ASD) patients from these heterogenous data. To deal with the influence of heterogeneous distributions on multi-center ASD diagnosis, a novel causal adversarial graph neural network (CAG) for multi-center ASD prediction is proposed in this work. CAG mainly consists of a graph filtering (GF) module and a learnable causal graph predictor (CGP). Specifically, the brain connection graph is first constructed from rs-fMRI data, after passing a GF module, the filtered graph is further divided by a causal subgraph and causally irrelevant subgraph. The ground-truth environmental labels and ASD labels are predicted from causal subgraph by a clustering method and a classification block, respectively. In addition, from the filtered graph and causally irrelevant subgraph, the environmental labels are predicted, while from the causally irrelevant subgraph the ASD labels are predicted. Assuming that the predicted environmental labels are independent to causal subgraph, while the predicted ASD labels are independent to causally irrelevant subgraph, accordingly, several adversarial losses are implemented by reversing the gradient. Through this adversarial learning strategy, the derived causal graph can predict multi-center ASD. The comparison experiments on both ABIDE-I and ABIDE-II datasets demonstrate that, the ACC and AUC of CAG has been improved by 3.78\% and 7.38\% at least comparing against the existing methods. Moreover, some abnormal functional connectivities in ASD group are identified from the causal subgraph which may provide useful imaging biomarkers for the early diagnosis of ASD. © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An adaptive flow table adjustment algorithm for SDN 21

An adaptive flow table adjustment algorithm for SDN

引用

作者： Xu, Xiaolong Hu, Liuyun Lin, Haowei Fan, Zexuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

SDN (Software-defined networking) are important for current network systems, such as cloud systems. The characteristics of flow in SDN and the impact of flow table entries and controllers on data packet transmission are analyzed. We propose an adaptive flow table adjustment algorithm for SDN called CFC (Combine flow table and controller). It is important for CFC to monitor the network traffic in real time. According to the proportion of active flow entries in the OpenFlow switch, the value of idle-timeout will be set dynamically based on the characteristics of different data flows. When the switch forwards packets, it will minimize the calculation load of controller, and allocate a reasonable value of idle-timeout to the idle flow table entries. So it can delete discarded flow table entries in time and improve the hit rate of data packets. The experiments show that the utilization rate of the flow table resource is enhanced. With the improvement of data packets' forwarding rate, the average throughput of the network has also increased. At the same time, it can also cope with the burst traffic in SDN and ensure them to be forwarded normally and effectively. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：