26 February 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Compared with traditional recommendation algorithms based on collaborative filtering and content, the sequential recommendation can better capture changes in user interests and recommend items that may be interacted with by the next time according to the user's historical interaction behaviors. Generally, there are several traditional methods for sequential recommendation: Markov Chain (MC) and Deep Neutral Network (DNN), both of which ignore the relationship between various behaviors and the dynamic changes of user interest in items over time. Furthermore, the early research methods usually deal with the user's historical interaction behavior in chronological order, which may cause the loss of partial preference information. According to the perspective that user preferences will change over time, this paper proposes a long and short-term sequential recommendation model with the enhanced self-attention network, RP-SANRec. The short-term intent module of RP-SANRec uses the Gated Recurrent Unit (GRU) to learn the comprehensive historical interaction sequence of the user to calculate the position weight information in the time order, which can be used to enhance the input of the self-attention mechanism. The long-term module captures the user's preferences through a bidirectional long and short-term memory network (Bi-LSTM). Finally, the user's dynamic interests and general preferences are fused, and the following recommendation result is predicted. This article applies the RP-SANRec model to three different public datasets under two evaluation indicators of HR@10 and NDCG@10. The extensive experiments proved that our proposed RP-SANRec model performs better than existing models.
8 July 2019 in IEEE Access
Density peaks clustering is a novel and efficient density-based clustering algorithm. However, the problem of the sensitive information leakage and the associated security risk with the applications of clustering methods is rarely considered. To address the problem, we proposed differential privacy-preserving density peaks' clustering based on the shared near neighbors similarity method in this paper. First, the Euclidean distance and the shared near neighbors similarity were combined to define the local density of a sample, and the Laplace noise was added to the local density and the shortest distance to protect privacy. Second, the process of cluster center selection was optimized to select the initial cluster centers based on the neighborhood information. Finally, each sample was assigned to the cluster as its nearest neighbor with higher local density. The experimental results on both the UCI and synthetic datasets show that compared with other algorithms, our method more effectively protects the data privacy and improves the quality of the clustering results.
1 November 2021 in IEEE Transactions on Computational Social Systems
Overlapping community detection is essential for revealing the hidden structure of complex networks. In this work, we present an overlapping community detection algorithm that selects community centers adaptively based on density peaks. The proposed algorithm, called the density-peak-based overlapping community detection (DPOCD) algorithm, defines point link strength and edge link strength to construct distance matrix. Unlike the density peaks clustering algorithm, by which cluster centers are selected manually, the DPOCD algorithm uses the linear fitting method to select community centers. To evaluate the feasibility of the presented algorithm, we compared it with other advanced methods on artificial synthetic network and real complex network datasets. The experimental results demonstrate that our method achieves excellent performance in large-scale complex networks and the robustness of the algorithm.
16 October 2023 in IEEE Transactions on Computational Social Systems
Traditional recommendation systems require users to upload local data to the server to generate recommendation results. In this process, users’ privacy is easy to disclose. Federated recommendations can solve the problem of local data privacy leakage, but the intermediate computing results are not protected. The existing work mainly protects the information in this process through encryption or disturbance schemes, which will result in complex calculations or low accuracy. Also, the two schemes only protect the rating data and process parameter information, but the existence information is not protected. Aiming at the above problems, this article proposes a federated matrix factorization based on secret sharing (FMFSS) to protect users’ privacy. The parameters are randomly divided into pieces, and then, the secret sharing technology is used to transmit private information between user–user and user–server, which does not introduce additional encryption cost and ensures value privacy, process privacy, and existence privacy. In addition, this article introduces the user–item interaction value, which is transmitted to the server with gradient information. In this way, the real gradient of the user cannot be inferred from the information received by the server from all parties, but the aggregated final average parameter information is real. The experimental comparison with the existing work and the analysis of computation time show that the proposed method can ensure the accuracy of model privacy recommendations without introducing additional encryption operations.