With the widespread adoption of large-scale mobile smart devices, Mobile Crowdsensing is evolving from a single-platform paradigm toward a multi-platform architecture. In such multi-platform environments, ensuring task completion while maintaining a balanced user borrowing-to-lending (BL) ratio across platforms has emerged as a critical challenge, particularly in enhancing the quality of sensing data. To address this issue, we propose a Multi-stage High-quality Data-driven Incentive Mechanism (MHDIM). The mechanism comprises three sequential stages. In the first stage, we design the ITA algorithm, which jointly considers user data quality and task urgency to allocate tasks among intra-platform users. Each platform then uploads information about its idle users and unassigned tasks to a cross-platform management entity. In the second stage, we propose the CMSIP algorithm, which leverages user quality and the BL ratio of each platform to assist the cross-platform entity in assigning tasks with shared Points of Interest. In the third stage, the CMDIP algorithm is introduced to handle cross-platform task allocation involving different points of interest, taking into account user data quality, the spatial distance between users and tasks, and the platform-level BL ratio. Experimental results demonstrate that, compared with existing mainstream incentive mechanisms, the proposed MHDIM significantly outperforms in terms of system utility, task completion rate, and data quality within multi-platform settings.

MOTIVATION: ADP-ribosylation is a critical modification involved in regulating diverse cellular processes, including chromatin structure regulation, RNA transcription, and cell death. Bacterial ADP-ribosyltransferase toxins (bARTTs) serve as potent virulence factors that orchestrate the manipulation of host cell functions to facilitate bacterial pathogenesis. Despite their pivotal role, the bioinformatic identification of novel bARTTs poses a formidable challenge due to limited verified data and the inherent sequence diversity among bARTT members. RESULTS: We proposed a deep learning-based model, ARTNet, specifically engineered to predict bARTTs from bacterial genomes. Initially, we introduced an effective data augmentation method to address the issue of data scarcity in training ARTNet. Subsequently, we employed a data optimization strategy by utilizing ART-related domain subsequences instead of the primary full sequences, thereby significantly enhancing the performance of ARTNet. ARTNet achieved a Matthew's correlation coefficient (MCC) of 0.9351 and an F1-score (macro) of 0.9666 on repeated independent test datasets, outperforming three other deep learning models and six traditional machine learning models in terms of time efficiency and accuracy. Furthermore, we empirically demonstrated the ability of ARTNet to predict novel bARTTs across domain superfamilies without sequence similarity. We anticipate that ARTNet will greatly facilitate the screening and identification of novel bARTTs from bacterial genomes. AVAILABILITY AND IMPLEMENTATION: ARTNet is publicly accessible at http://www.mgc.ac.cn/ARTNet/. The source code of ARTNet is freely available at https://github.com/zhengdd0422/ARTNet/.

A critical side effect of online social networks’ flourishing is fast-spreading rumors on the Internet, making the information diffusion control on social networks a fundamental requirement. While information diffusion control has received extensive attention at the global level, there have been fewer user-level diffusion control studies under minimal budget. In this article, we study the information diffusion at the user level and propose a diffusion control method based on gradient information to generate an optimized network structure, namely ConTroL information DIFFusion (CTL-DIFF). CTL-DIFF targets a user through subtle modifications of its local network structure. It first selects the edges with the largest absolute gradient based on the prediction model to optimize the original network’s structure. It then employs several prediction methods to verify whether the target user’s social action status is controlled. CTL-DIFF achieves state-of-the-art control performance with a minimum budget, comparing with five baselines based on edge centrality strategies on four real-world datasets. We extend the diffusion control from user-level to global-level, comparing with four baselines on three datasets. Experimental results show that CTL-DIFF can effectively control information diffusion in the global social network by identifying and controlling the most influential users.

Community detection, which focuses on clustering vertex interactions, plays a significant role in network analysis. However, it also faces numerous challenges like missing data and adversarial attack. How to further improve the performance and robustness of community detection for real-world networks has raised great concerns. In this paper, we explore robust community detection by enhancing network structure, with two generic algorithms presented: one is named robust community detection via genetic algorithm (RobustECDGA), in which the modularity and the number of clusters are combined in a fitness function to find the optimal structure enhancement scheme; the other is called robust community detection via similarity ensemble (RobustECD-SE), integrating multiple information of community structures captured by various vertex similarities, which scales well on large-scale networks. Comprehensive experiments on real-world networks demonstrate, by comparing with two traditional enhancement strategies, that the new methods help six representative community detection algorithms achieve more significant performance improvement. Moreover, experiments on the corresponding adversarial networks indicate that the new methods could also optimize the network structure to a certain extent, achieving stronger robustness against adversarial attack. The source code of this paper is released on https://github.com/jjzhou012/robustECD release.

BACKGROUND: Medication recommendation based on electronic medical record (EMR) is a research hot spot in smart healthcare. For developing computational medication recommendation methods based on EMR, an important challenge is the lack of a large number of longitudinal EMR data with time correlation. Faced with this challenge, this paper proposes a new EMR-based medication recommendation model called MR-KPA, which combines knowledge-enhanced pre-training with the deep adversarial network to improve medication recommendation from both feature representation and the fine-tuning process. Firstly, a knowledge-enhanced pre-training visit model is proposed to realize domain knowledge-based external feature fusion and pre-training-based internal feature mining for improving the feature representation. Secondly, a medication recommendation model based on the deep adversarial network is developed to optimize the fine-tuning process of pre-training visit model and alleviate over-fitting of model caused by the task gap between pre-training and recommendation. RESULT: The experimental results on EMRs from medical and health institutions in Hainan Province, China show that the proposed MR-KPA model can effectively improve the accuracy of medication recommendation on small-scale longitudinal EMR data compared with existing representative methods. CONCLUSION: The advantages of the proposed MR-KPA are mainly attributed to knowledge enhancement based on ontology embedding, the pre-training visit model and adversarial training. Each of these three optimizations is very effective for improving the capability of medication recommendation on small-scale longitudinal EMR data, and the pre-training visit model has the most significant improvement effect. These three optimizations are also complementary, and their integration makes the proposed MR-KPA model achieve the best recommendation effect.

Community detection, aiming to group nodes based on their connections, plays an important role in network analysis since communities, treated as meta-nodes, allow us to create a large-scale map of a network to simplify its analysis. However, for privacy reasons, we may want to prevent communities from being discovered in certain cases, leading to the topics on community deception. In this article, we formalize this community detection attack problem in three scales, including global attack (macroscale), target community attack (mesoscale), and target node attack (microscale). We treat this as an optimization problem and further propose a novel evolutionary perturbation attack (EPA) method, where we generate adversarial networks to realize the community detection attack. Numerical experiments validate that our EPA can successfully attack network community algorithms in all three scales, i.e., hide target nodes or communities and further disturb the community structure of the whole network by only changing a small fraction of links. By comparison, our EPA behaves better than a number of baseline attack methods on six synthetic networks and three real-world networks. More interestingly, although our EPA is based on the Louvain algorithm, it is also effective in attacking other community detection algorithms, validating its good transferability.

MOTIVATION: Identification of virulence factors (VFs) is critical to the elucidation of bacterial pathogenesis and prevention of related infectious diseases. Current computational methods for VF prediction focus on binary classification or involve only several class(es) of VFs with sufficient samples. However, thousands of VF classes are present in real-world scenarios, and many of them only have a very limited number of samples available. RESULTS: We first construct a large VF dataset, covering 3446 VF classes with 160 495 sequences, and then propose deep convolutional neural network models for VF classification. We show that (i) for common VF classes with sufficient samples, our models can achieve state-of-the-art performance with an overall accuracy of 0.9831 and an F1-score of 0.9803; (ii) for uncommon VF classes with limited samples, our models can learn transferable features from auxiliary data and achieve good performance with accuracy ranging from 0.9277 to 0.9512 and F1-score ranging from 0.9168 to 0.9446 when combined with different predefined features, outperforming traditional classifiers by 1-13% in accuracy and by 1-16% in F1-score. AVAILABILITY AND IMPLEMENTATION: All of our datasets are made publicly available at http://www.mgc.ac.cn/VFNet/, and the source code of our models is publicly available at https://github.com/zhengdd0422/VFNet. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Community detection plays an important role in social networks, since it can help to naturally divide the network into smaller parts so as to simplify network analysis. However, on the other hand, it arises the concern that individual information may be overmined, and the concept community deception has been proposed to protect individual privacy on social networks. Here, we introduce and formalize the problem of community detection attack and develop efficient strategies to attack community detection algorithms by rewiring a small number of connections, leading to privacy protection. In particular, we first give two heuristic attack strategies, i.e., Community Detection Attack (CDA) and Degree Based Attack (DBA), as baselines, utilizing the information of detected community structure and node degree, respectively. Then, we propose an attack strategy called “genetic algorithm (GA)-based Q-Attack,” where the modularity Q is used to design the fitness function. We launch community detection attack based on the above three strategies against six community detection algorithms on several social networks. By comparison, our Q-Attack method achieves much better attack effects than CDA and DBA, in terms of the larger reduction of both modularity Q and normalized mutual information (NMI). In addition, we further take transferability tests and find that adversarial networks obtained by Q-Attack on a specific community detection algorithm also show considerable attack effects while generalized to other algorithms.

Considering there is great similarity between the wave-band design and spatial resolution of the China HJ1A/1B satellite CCD Camera and Landsat TM data, this paper conducts comparison and analysis to the data from the aspects of track parameter, spectral response characteristics and imaging quality. The orbital parameters have little difference. But HJ satellite has two satellites constellations in A/B, and its width is bigger than that of Landsat, which enables it to conduct two-day earth coverage observation, so it is higher than Landsat 5 in time resolution. Radiation precision evaluation results show that in the 4 wavebands of blue, green, red and near-infrared, HJ1A-CCD1 is more sensitive to low radiance, and has a stronger capability to receive low radiance value than TM; in the blue and red wavebands, it also has a stronger capability to receive high radiance value than TM, from which we can conclude that HJ1A-CCD1 has a wider threshold value range than TM in the blue and red wavebands; it has a weaker capability to receive high radiance than TM in the green and near- infrared wavebands; from the perspective of imaging effect, the information amount, texture feature and definition of various wavebands of HJ1A-CCD1 data are not as good as Landsat TM data.