User profiling by inferring user personality traits,such as age and gender,plays an increasingly important role in many real-world *** existing methods for user profiling either use only one type of data or ignore han...
详细信息
User profiling by inferring user personality traits,such as age and gender,plays an increasingly important role in many real-world *** existing methods for user profiling either use only one type of data or ignore handling the noisy information of ***,they usually consider this problem from only one *** this paper,we propose a joint user profiling model with hierarchical attention networks(JUHA)to learn informative user representations for user *** JUHA method does user profiling based on both inner-user and inter-user *** explore inner-user features from user behaviors(e.g.,purchased items and posted blogs),and inter-user features from a user-user graph(where similar users could be connected to each other).JUHA learns basic sentence and bag representations from multiple separate sources of data(user behaviors)as the first round of data *** this module,convolutional neural networks(CNNs)are introduced to capture word and sentence features of age and gender while the self-attention mechanism is exploited to weaken the noisy *** this,we build another bag which contains a user-user ***-user features are learned from this bag using propagation information between linked users in the *** acquire more robust data,inter-user features and other inner-user bag representations are joined into each sentence in the current bag to learn the final bag ***,all of the bag representations are integrated to lean comprehensive user representation by the self-attention *** experimental results demonstrate that our approach outperforms several state-of-the-art methods and improves prediction performance.
With the adoption of foundation models(FMs),artificial intelligence(AI) has become increasingly significant in bioinformatics and has successfully addressed many historical challenges,such as pre-training frameworks,m...
详细信息
With the adoption of foundation models(FMs),artificial intelligence(AI) has become increasingly significant in bioinformatics and has successfully addressed many historical challenges,such as pre-training frameworks,model evaluation and *** demonstrate notable proficiency in managing large-scale,unlabeled datasets,because experimental procedures are costly and labor *** various downstream tasks,FMs have consistently achieved noteworthy results,demonstrating high levels of accuracy in representing biological entities.A new era in computational biology has been ushered in by the application of FMs,focusing on both general and specific biological *** this review,we introduce recent advancements in bioinformatics FMs employed in a variety of downstream tasks,including genomics,transcriptomics,proteomics,drug discovery and single-cell *** aim is to assist scientists in selecting appropriate FMs in bioinformatics,according to four model types:language FMs,vision FMs,graph FMs and multimodal *** addition to understanding molecular landscapes,AI technology can establish the theoretical and practical foundation for continued innovation in molecular biology.
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution,...
详细信息
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m
The future storage systems are expected to contain a wide variety of storage media and layers due to the rapid development of NVM(non-volatile memory)*** NVM-based read caches,many kinds of NVM devices cannot stand fr...
详细信息
The future storage systems are expected to contain a wide variety of storage media and layers due to the rapid development of NVM(non-volatile memory)*** NVM-based read caches,many kinds of NVM devices cannot stand frequent data updates due to limited write endurance or high energy consumption of ***,traditional cache algorithms have to update cached blocks frequently because it is difficult for them to predict long-term popularity according to such limited information about data blocks,such as only a single value or a queue that reflects frequency or *** this paper,we propose a new MacroTrend(macroscopic trend)prediction method to discover long-term hot blocks through blocks'macro trends illustrated by their access count *** then a new cache replacement algorithm is designed based on the MacroTrend prediction to greatly reduce the write amount while improving the hit *** conduct extensive experiments driven by a series of real-world traces and find that compared with LRU,MacroTrend can reduce the write amounts of NVM cache devices significantly with similar hit ratios,leading to longer NVM lifetime or less energy consumption.
Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for m...
详细信息
Recommendation systems play a crucial role in helping college students find job opportunities. However, the sparsity of interactions in employment recommendation for college students poses a challenge for models based...
详细信息
Aimedat the problem of dynamic causal discovery in the era of artificial intelligence, this article combines partial rank correlation coefficients and streaming features in the field of Bayesian network structure lear...
详细信息
Various works have utilized deep learning to address the query optimization problem in database system. They either learn to construct plans from scratch in a bottom-up manner or steer the plan generation behavior of ...
详细信息
Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the secu...
详细信息
ISBN:
(纸本)9798400712746
Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d
Major Depressive Disorder (MDD) has been a major mental disease in recent years, imposing huge negative impacts on both our society and individuals. The current clinical MDD detection methods, such as self-report scal...
详细信息
暂无评论