Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wenmin Lin

dblp:53/8558 · DBLP profile ↗
← Back
23ranked-venue papers
8as first author
9since 2021 · last 2025
0000-0002-2423-7542ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 8 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Computer networks · 3 · 1 first-author · 3 since 2021Software engineering, systems software and programming languages · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 62% Generative modeling · 19% Probabilistic and Bayesian machine learning · 19%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
robustness
0.912025
Text-Guided Fine-grained Counterfactual Inference for Short Video Fake News Detection · AAAI 2025
Services computing and microservices › service recommendation
web API recommendation
0.712023
A Correlation Graph Based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Probabilistic and Bayesian machine learning › causal inference
counterfactual prediction
0.312025
Text-Guided Fine-grained Counterfactual Inference for Short Video Fake News Detection · AAAI 2025
Machine learning › Generative modeling
diffusion model
0.312025
Text-Guided Fine-grained Counterfactual Inference for Short Video Fake News Detection · AAAI 2025
Recommender systems
graph-based recommendation
0.212023
A Correlation Graph Based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development · IEEE Trans. Knowl. Data Eng. 2023

Methods — techniques the papers use, named apart from their topics

random walk · 1.3correlation graph · 1.3multi-head attention · 0.9knowledge distillation · 0.9diffusion model · 0.9counterfactual inference · 0.9
YearPublicationVenuePosition
2025 Text-Guided Fine-grained Counterfactual Inference for Short Video Fake News Detection
abstract
Detecting fake news in short videos is crucial for combating misinformation. Existing methods utilize topic modeling and co-attention mechanism, overlooking the modality heterogeneity and resulting in suboptimal performance. To address this issue, we introduce Text-Guided Fine-grained Counterfactual Inference for Short Video Fake News detection (TGFC-SVFN). TGFC-SVFN leverages modality bias removal and teacher-model-enhanced inter-modal knowledge distillation to integrate the heterogeneous modalities in short videos. Specifically, we use causality-based reasoning prompts guided text as teacher model, which then transfers knowledge to the video and audio student models. Subsequently, a multi-head attention mechanism is employed to fuse information from different modalities. In each module, we utilize fine-grained counterfactual inference based on a diffusion model to eliminate modality bias. Experimental results on publicly available fake short video news datasets demonstrate that our method outperforms state-of-the-art techniques.
Linlin Zong, Wenmin Lin, Jiahui Zhou, Xinyue Liu 0002, Xianchao Zhang 0001, Bo Xu 0009, Shimin Wu
AAAI2
2024 A Blockchain-enabled decentralized settlement model for IoT data exchange services
Wenmin Lin, Shoujin Wang, Mohammad Reza Khosravi
Wirel. Networks1
2024 Cloud Computing-aided Multi-type Data Fusion with Correlation for Education
Baoqing Tai, Xindong Li, Lifang Yang, Ying Miao 0004, Wenmin Lin
Wirel. Networks5
2023 A Design of Hybrid Transactional and Analytical Processing Database for Energy Efficient Big Data Queries
Wenmin Lin
GPC (1)1
2023 A federated collaborative recommendation model for privacy-preserving distributed recommender applications based on microservice framework
Wenmin Lin, Hui Leng, Ruihan Dou, Lianyong Qi, Md. Arafatur Rahman
J. Parallel Distributed Comput.1
2023 A Correlation Graph Based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development
abstract
Using Web APIs registered in service sharing communities for mobile APP development can not only reduce development period and cost, but also fully reuse state-of-the-art research outcomes in broad domain so as to ensure up-to-date APP development and applications. However, the big volume of available APIs in Web communities as well as their differences make it difficult for APIs selection considering compatibility, preferred partial APIs and expected APIs functions which are often of high variety. Accordingly, how to recommend a set of functional-satisfactory and compatibility-optimal APIs based on the APP developer's multiple function expectation and pre-chosen partial APIs is on demand as a significant challenge for successful APP development. To address this challenge, we first construct a Web APIs correlation graph that incorporates functional descriptions and compatibility information of Web APIs, and then propose a correlation graph-based approach for personalized and compatible Web APIs recommendation in mobile APP development. Finally, through extensive experiments on a real dataset crawled from Web APIs websites, we prove the feasibility of our proposed recommendation approach.
Lianyong Qi, Wenmin Lin, Xuyun Zhang, Wan-Chun Dou, Xiaolong Xu 0001, Jinjun Chen
IEEE Trans. Knowl. Data Eng.2
2023 Energy-saving Service Offloading for the Internet of Medical Things Using Deep Reinforcement Learning
abstract
As a critical branch of the Internet of Things (IoT) in the medicine industry, the Internet of Medical Things (IoMT) significantly improves the quality of healthcare due to its real-time monitoring and low medical cost. Benefiting from edge and cloud computing, IoMT is provided with more computing and storage resources near the terminal to meet the low-delay requirements of computation-intensive services. However, the service offloading from health monitoring units (HMUs) to edge servers generates additional energy consumption. Fortunately, artificial intelligence (AI), which has developed rapidly in recent years, has proved effective in some resource allocation applications. Taking both energy consumption and delay into account, we propose an energy-aware service offloading algorithm under an end-edge-cloud collaborative IoMT system with Asynchronous Advantage Actor-critic (A3C), named ECAC. Technically, ECAC uses the structural similarity between the natural distributed IoMT system and A3C, whose parameters are asynchronously updated. Besides, due to the typical delay-sensitivity mechanism and time-energy correction, ECAC can adjust dynamically to the diverse service types and system requirements. Finally, the effectiveness of ECAC for IoMT is proved on real data.
Jielin Jiang, Jiajie Guo, Maqbool Khan, Yan Cui 0007, Wenmin Lin
ACM Trans. Sens. Networks5
2022 A blockchain- and artificial intelligence-enabled smart IoT framework for sustainable city
abstract
Advancements in digital technologies, such as the Internet of Things (IoT), fog/edge/cloud computing, and cyber-physical systems have revolutionized a broad spectrum of smart city applications. The significant contributions and rapid developments of advanced artificial intelligence-based technologies and approaches, like, machine learning and deep learning, which are applied for extracting accurate information from extensive data, perform a potential role in IoT applications. Moreover, blockchain technology's fast adoption also contributes a significant role in the development of the new digital smart city ecosystem. Thus, artificial intelligence and blockchain technology convergence revolutionize smart city infrastructures to establish sustainable ecosystems for IoT applications. Nevertheless, these advancements and technological improvements also provide both opportunities and challenges for developing sustainable IoT applications. This paper aims to examine the convergence of blockchain technology and artificial intelligence, a unique driver towards technological transformation in intelligent and sustainable IoT applications. We mainly discussed the advantages of blockchain technology that might promote the advancement and development of sustainable IoT applications. On the basis of the discussion, we introduced a smart and sustainable conceptual framework that leverages cloud computing, IoT devices, and artificial intelligence to process and obtain necessary information. The system provides digital analytics and saves results in decentralized cloud repositories through blockchain technology to promote various applications. Moreover, the layer-based architecture allows a sustainable incentive structure, which can possibly assist secure and protected smart city applications. We reviewed the enhanced solutions, summing up the key points that can be applied for generating various artificial intelligence and blockchain-based systems. Also, we discussed the issues that still remain open and our future research goals; that can introduce new ideas and future guidelines for sustainable IoT applications.
Imran Ahmed 0002, Yulan Zhang, Gwanggil Jeon, Wenmin Lin, Mohammad Reza Khosravi, Lianyong Qi
Int. J. Intell. Syst.4
2021 Location-Aware Service Recommendations With Privacy-Preservation in the Internet of Things
abstract
With the ever-increasing maturity and popularization of the Internet of Things (IoT), tremendous business applications developed by distinct enterprises or organizations have been encapsulated into lightweight web services that can easily be accessed or invoked remotely. However, the big volume of candidate web services places a heavy burden on the users' service selection decision-making process. Under the circumstance, a variety of intelligent recommendation solutions have been developed to reduce the high decision-making cost. Traditional resolutions usually challenge in two aspects. First, the recommendation parameters, i.e., the quality of services (QoS), usually relies on user/service location heavily; therefore, low-quality recommended results may be returned to users if user/service location information is overlooked. Second, historical QoS data often contain partial sensitive information of users; therefore, it becomes a necessity to protect the sensitive QoS data while making accurate recommendation decisions. To tackle the above challenges, we introduce the concepts of user/service location information and locality-sensitive hashing (LSH) in the domain and propose a location-aware recommendation approach with privacy-preservation capability. A wide range of experiments is set up based on the popular WS-DREAM data set, whose results prove the effectiveness and efficiency of our approach.
Wenmin Lin, Xuyun Zhang, Lianyong Qi, Weimin Li 0001, Shancang Li, Victor S. Sheng, Surya Nepal
IEEE Trans. Comput. Soc. Syst.1
2020 Temporal-aware and sparsity-tolerant hybrid collaborative recommendation method with privacy preservation
abstract
Summary With the explosive growth of cloud services, how to design effective recommendation models has become more and more important. Temporal information has been proved to be an important factor affecting recommendation performance. Actually, both of user behaviors and QoS performance of services are time‐sensitive, especially in dynamic cloud environment. However, most existing collaborative recommendation methods seldom consider temporal influence to QoS performance. Furthermore, with the ever‐increasing number of security threats in clouds, privacy preservation becomes an important problem to be addressed in recommender systems. Based on these observations, in this paper, we propose a temporal‐aware and sparsity‐tolerant hybrid collaborative recommendation method with privacy preservation, where tensor factorization‐based CF model is integrated into neighborhood‐based CF model to achieve improved recommendation performance. Specifically, temporal influence is considered into recommendation model by distinguishing short‐term QoS metrics from long‐term QoS metrics. A privacy‐aware time aggregation mechanism is adopted to preserve the sensitive time information of users. Moreover, to deal with the sparsity problem, a sparsity‐oriented data QoS rating prediction mechanism based on tensor factorization technique is applied to predict the missing or unrated QoS rating data. Finally, predictions are made based on both stable and temporal nearest neighbors. Experiments are conducted to demonstrate the prediction performance of our proposal.
Shunmei Meng, Qianmu Li, Jing Zhang 0015, Wenmin Lin, Wan-Chun Dou
Concurr. Comput. Pract. Exp.4
2020 Dynamic Resource Provisioning With Fault Tolerance for Data-Intensive Meteorological Workflows in Cloud
abstract
Cloud computing is a formidable paradigm to provide resources for handling the services from Industrial Internet of Things (IIoT), such as meteorological industry. Generally, the meteorological services, with complex interdependent logics, are modeled as workflows. When any of the computing nodes for hosting the meteorological workflows fail, all sorts of consequences (e.g., data loss, makespan enlargement, performance degradation, etc.) could arise. Thus recovering the failed tasks as well as optimizing the makespan and the load balance of the computing nodes is still a critical challenge. To address this challenge, a dynamic resource provisioning method (DRPM) with fault tolerance for the data-intensive meteorological workflows is proposed in this article. Technically, the Virtual Layer 2 (VL2) network topology is exploited to build meteorological cloud infrastructure. Then, the nondominated sorting genetic algorithm II (NSGA-II) is employed to minimize the makespan and improve the load balance. Finally, comprehensive experimental analysis of DRPM are proceeded.
Xiaolong Xu 0001, Ruichao Mo, Fei Dai 0002, Wenmin Lin, Shaohua Wan 0001, Wan-Chun Dou
IEEE Trans. Ind. Informatics4
2020 Efficient computation offloading for Internet of Vehicles in edge computing-assisted 5G networks
Shaohua Wan 0001, Yuan Xue 0013, Wenmin Lin, Xiaolong Xu 0001
J. Supercomput.4
2019 Multiobjective computation offloading for workflow management in cloudlet-based mobile cloud using NSGA-II
abstract
Abstract Cloudlet is a novel computing paradigm, introduced to the mobile cloud service framework, which moves the computing resources closer to the mobile users, aiming to alleviate the communication delay between the mobile devices and the cloud platform and optimize the energy consumption for mobile devices. Currently, the mobile applications, modeled by the workflows, tend to be complicated and computation‐intensive. Such workflows are required to be offloaded to the cloudlet or the remote cloud platform for execution. However, it is still a key challenge to determine the offloading resolvent for the deadline‐constrained workflows in the cloudlet‐based mobile cloud, since a cloudlet often has limited resources. In this paper, a multiobjective computation offloading method, named MCO, is proposed to address the above challenge. Technically, an energy consumption model for the mobile devices is established in the cloudlet‐based mobile cloud. Then, a corresponding computation offloading method, by improving Nondominated Sorting Genetic Algorithm II, is designed to achieve the goal of energy saving for all the mobile device while satisfying the deadline constraints of the workflows. Finally, extensive experimental evaluations are conducted to demonstrate the efficiency and effectiveness of our proposed method.
Xiaolong Xu 0001, Shucun Fu, Yuan Yuan 0004, Lianyong Qi, Wenmin Lin, Wan-Chun Dou
Comput. Intell.6
2019 Privacy-preserving and sparsity-aware location-based prediction method for collaborative recommender systems
Shunmei Meng, Lianyong Qi, Qianmu Li, Wenmin Lin, Xiaolong Xu 0001, Shaohua Wan 0001
Future Gener. Comput. Syst.4
2018 An Optimized Multi-Paxos Protocol with Centralized Failover Mechanism for Cloud Storage Applications
Wenmin Lin, Nailiang Zhao
CollaborateCom1
2018 Temporal-Sparsity Aware Service Recommendation Method via Hybrid Collaborative Filtering Techniques
Shunmei Meng, Qianmu Li, Shiping Chen 0001, Shui Yu 0001, Lianyong Qi, Wenmin Lin, Xiaolong Xu 0001, Wan-Chun Dou
ICSOC6
2015 A cloud-based framework for Home-diagnosis service over big medical data
Wenmin Lin, Wan-Chun Dou, Zuojian Zhou, Chang Liu 0001
J. Syst. Softw.1
2013 A QoS-aware service discovery method for elastic cloud computing in an unstructured peer-to-peer network
abstract
SUMMARY Traditionally, service discovery is often promoted by the centralized approach that typically suffers from single point of failure, poor reliability, poor scalability, to name a few. In view of this challenge, a QoS‐aware service discovery method is investigated for elastic cloud computing in an unstructured peer‐to‐peer network in this paper. Concretely speaking, the method is deployed by two phases, that is, service registering phase and service discovery phase. More specifically, for a peer node engaged in the unstructured peer‐to‐peer network, it firstly registers its functional and nonfunctional information to its neighbors in a flooding way. With the multiple registered information, the QoS‐aware service discovery is promoted in a probabilistic flooding way according to the network traffic. At last, extensive simulations are conducted to evaluate the feasibility of our method. Copyright © 2013 John Wiley & Sons, Ltd.
Wenmin Lin, Wan-Chun Dou, Zhanyang Xu, Jinjun Chen
Concurr. Comput. Pract. Exp.1
2013 An adaptive service selection method for cross-cloud service composition
abstract
SUMMARY Cloud computing aims at providing elastic applications that can be scaled at runtime. In practice, traditional service composition methods are not flexible enough to changes in cross‐cloud environment. In view of this challenge, an adaptive service selection method for cross‐cloud service composition is proposed in this paper, by dynamically selecting proper services with near‐optimal performance for adapting to changes in time. First, concretely speaking, the service selection and execution are modeled with Markov decision process to ensure flexibility. Second, service pair is defined, and the way to build service pairs set is proposed to predict the performance of candidate services. Third, the adaptive service selection algorithm is designed to select proper cloud services for changing cross‐cloud environment. Finally, a case study for cross‐cloud service composition and experiments are presented for validating the feasibility of our proposal. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.
Wenmin Lin, Wan-Chun Dou
Concurr. Comput. Pract. Exp.2
2011 CBF: A Packet Filtering Method for DDoS Attack Defense in Cloud Environment
abstract
Distributed Denial-of-Service attack (DDoS) is a major threat for cloud environment. Traditional defending approaches cannot be easily applied in cloud security due to their relatively low efficiency, large storage, to name a few. In view of this challenge, a Confidence-Based Filtering method, named CBF, is investigated for cloud computing environment, in this paper. Concretely speaking, the method is deployed by two periods, i.e., non-attack period and attack period. More specially, legitimate packets are collected at non-attack period, for extracting attribute pairs to generate a nominal profile. With the nominal profile, the CBF method is promoted by calculating the score of a particular packet at attack period, to determine whether to discard it or not. At last, extensive simulations are conducted to evaluate the feasibility of the CBF method. The result shows that CBF has a high scoring speed, a small storage requirement and an acceptable filtering accuracy, making it suitable for real-time filtering in cloud environment.
Wenmin Lin, Wan-Chun Dou, Shui Yu 0001
DASC2
2011 A History Record-Based Service Optimization Method for QoS-Aware Service Composition
abstract
The performance of a service's QoS may evolve relatively frequently with its internal changes or the changes of dynamic Internet environment, especially when some"intentional" deceptions are taken into consideration. Therefore, the service providers could not always deliver their services according to their "promised" quality. In view of this challenge, a history record-based service optimization method, named Hire Some, is investigated in this paper. This method aims at enhancing the credibility of service composition plan, taking advantage of a web service's QoShistory records, rather than using the tentative QoS values advertised by the service provider. At last, a case study and an experiment is presented for validating the method.
Wenmin Lin, Wan-Chun Dou, Xiangfeng Luo, Jinjun Chen
ICWS1
2011 A QoS-aware exception handling method in scientific workflow execution
abstract
Abstract Scientific workflow is gaining ever‐increasing attention as it integrates a wide range of heterogeneous services to enable and accelerate the scientific discovery processes. However, the exception occurred in a scientific workflow execution often decreases the robustness of a scientific workflow system. For example, if a service engaged in a scientific workflow schedule becomes unavailable during its execution, an exception might be raised and the whole workflow execution may be interrupted unexpectedly. In this situation, it is a challenge to smooth the interrupted workflow execution. In view of this challenge, an exception handling method, named RelaxingMe (constraints Relaxing Method, RelaxingMe) is proposed in this paper. This method aims at relaxing the original QoS constraint values requested by the interrupted task node, in order to find a near‐to‐optimal candidate service to replace the unavailable one. At last, the feasibility of our method is evaluated by an experiment. Copyright © 2011 John Wiley & Sons, Ltd.
Lianyong Qi, Wenmin Lin, Wan-Chun Dou, Jinjun Chen
Concurr. Comput. Pract. Exp.2
2010 A QoS-aware Web Service Selection Method Based on Credibility Evaluation
abstract
There exist so many web services that share same or similar functional properties, so it is often a challenging effort to select a credible and optimal web service based on their various history QoS records. In view of this challenge, in this paper, a novel QoS-aware web service selection method is put forward, based on credibility evaluation associated with negotiated QoS dimensions. More specifically, the historical empirical data, i.e., execution logs of a service, are used for evaluation purpose. At last, a case study is employed for illustration purpose, and the evaluations are presented to demonstrate the feasibility of our method.
Lianyong Qi, Rutao Yang, Wenmin Lin, Xuyun Zhang, Wan-Chun Dou, Jinjun Chen
HPCC3