31 October 2020 in International Journal of Intelligent Systems
24 August 2021 in IEEE Transactions on Emerging Topics in Computational Intelligence
Sparsity of user-to-item rating data becomes one of challenging issues in the recommender systems, which severely deteriorates the recommendation performance. Fortunately, context-aware recommender systems can alleviate the sparsity problem by making use of some auxiliary information, such as the information of both the users and items. In particular, the visual information of items, such as the movie poster, can be considered as the supplement for item description documents, which helps to obtain more item features. In this paper, we focus on movie recommender system and propose a probabilistic matrix factorization based recommendation scheme called visual recurrent convolutional matrix factorization (VRConvMF), which utilizes the textual and multi-level visual features extracted from the descriptive texts and posters respectively. We implement the proposed VRConvMF and conduct extensive experiments on three commonly used real world datasets to validate its effectiveness. The experimental results illustrate that the proposed VRConvMF outperforms the existing schemes.
26 April 2022 in IEEE Transactions on Industrial Informatics
Convolutional neural network (CNN)-based recommender systems are playing an increasingly significant role in the vigorous development of Industrial Internet of Things, and have made great contributions to analyzing and mining a large amount of data to provide various services for terminal users. However, as the lack of explainability in deep learning, users often have low trust in the system due to their incomprehension of recommendation results. In addition, recommender systems have been facing a serious sparsity problem, and relying only on sparse rating data to learn user preferences and similarities may face malicious recommendation attacks. The abovementioned problems have been hindering the further improvement of recommendation performance. Therefore, in order to effectively alleviate the sparsity problem and meanwhile enhance the trustworthiness, an auxiliary review-based personalized attentional CNN (ARPCNN) is proposed in this article. By applying the proposed personalized word-level attention mechanism and personalized review-level attention mechanism in parallel CNNs, critical words and informative reviews are given high attention weights. Moreover, a user auxiliary network is proposed, which regards the reviews written by kindred spirits who have a trust relationship with the user as auxiliary reviews, and effectively extracts the user’s auxiliary review features, thereby achieving more accurate user modeling to improve the recommendation performance. Extensive experiments are conducted on four real-world datasets, and the results show that the performance of the proposed model is better than that of baselines, which verifies the effectiveness of ARPCNN.
30 November 2021 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
With the rapid development of Artificial Intelligence and Internet of Things, an increasing number of computation intensive or delay sensitive biomedical data processing and analysis tasks are produced in vehicles, bringing more and more challenges to the biometric monitoring of drivers. Edge computing is a new paradigm to solve these challenges by offloading tasks from the resource-limited vehicles to Edge Servers in Road Side Units. However, most of the traditional offloading schedules for vehicular networks concentrate on the edge, while some tasks may be too complex for ESs to process. To this end, we consider a collaborative vehicular network in which the cloud, edge and terminal can cooperate with each other to accomplish the tasks. The vehicles can offload the computation intensive tasks to the cloud to save the resource of edge. We further construct the virtual resource pool which can integrate the resource of multiple ESs since some regions may be covered by multiple RSUs. In this paper, we propose a Multi-Scenario offloading schedule for biomedical data processing and analysis in Cloud-Edge-Terminal collaborative vehicular networks called MSCET. The parameters of the proposed MSCET are optimized to maximize the system utility. We also conduct extensive simulations to evaluate MSCET.
12 February 2021 in IEEE Transactions on Industrial Informatics
Radio frequency identification (RFID) technology has been deployed in various scenarios in recent years. In some practical RFID applications, the items attached with tags can be divided into multiple groups. Thus, the efficient and accurate missing tag detection of each group is critical. Accordingly, this article concentrates on the problem of missing tag detection in the multiple-group RFID systems, after which three distinctive protocols are proposed. First, we propose an aptitudinal multiple-group missing tag detection protocol, which makes full use of the expected singleton slots. Then, an enhanced multiple-group missing tag detection protocol is proposed, which can achieve significant broadcast and response savings. Finally, an accurate and expeditious multiple-group missing tag detection protocol is designed, the detection reliability of which can approximate 100%. The theoretical analysis and extensive simulations are conducted and the results verify that the proposed protocols in this article outperform the other ones.
6 May 2022 in IEEE Transactions on Computational Social Systems
In recent years, wireless rechargeable sensor networks (WRSNs), as a crucial technology in cyber-physical-social systems (CPSSs), have gradually become a hotspot of research, with the development of wireless energy transmission technology. In previous works, the objective is to maximize the survival rate of sensor nodes. However, in this article, we focus on maintaining more targets. First, it details the charging scheduling problem of maximizing coverage of targets (CoT) in on-demand charging architecture of WRSNs. Also, the problem is formalized as a multiple-objective optimization problem, which aims at maximizing the CoT and the energy efficiency simultaneously. After that, the charging scheduling for maximizing coverage of targets (CSCT) scheme is proposed to achieve the above objectives. Then, the problem is reformulated as a Deadline-TSP problem that is NP-hard. To address this problem, we design an energy predictive model and propose the CSCT with an n-path (n-CSCT) scheme that has an O(|N|ⁿ) computational complexity. In addition, the resurrection of sensor nodes is considered in this article. Thus, the n-CSCT with node resurrection (n-CSCT-R) scheme is proposed for this case. Finally, we validate the effectiveness of the proposed schemes via extensive simulations.