Wanli Huang

Wanli Huang

Auto-generated profile, based on publicly available information

Wanli Huang

School of Computer Science, Qufu Normal University, Rizhao, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

11 September 2020 in IEEE Access
Verified
Journal Article
Open access
QZQingguo Zhang
Qingguo Zhang
BLBizhen Lian
Bizhen Lian
PCPing Cao
Ping Cao
YSYong Sang
Yong Sang
WHWanli Huang
Wanli Huang
Lianyong QiLianyong Qi
Lianyong Qi
With the advent of Internet of Health (IoH) age, traditional medical or healthy services are gradually migrating to the Web or Internet and have been producing a considerable amount of medical data associated with patients, doctors, medicine, medical infrastructure and so on. Effective fusion and analyses of these IoH data are of positive significances for the scientific disaster diagnosis and medical care services. However, IoH data are often distributed across different departments and contain partial user privacy. Therefore, it is often a challenging task to effectively integrate or mine the sensitive IoH data, during which user privacy is not disclosed. To overcome the above difficulty, we put forward a novel multi-source medical data integration and mining solution for better healthcare services, named PDFM (Privacy-free Data Fusion and Mining). Through PDFM, we can search for similar medical records in a time-efficient and privacy-preserving manner, so as to offer patients with better medical and health services. A group of experiments are enacted and implemented to demonstrate the feasibility of the proposal in this work.

16 December 2020 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
SWShengqi Wu
Shengqi Wu
HKHuaizhen Kou
Huaizhen Kou
CLChao Lv
Chao Lv
WHWanli Huang
Wanli Huang
LQLianyong Qi
Lianyong Qi
Hao WangHao Wang
Hao Wang
In recent years, the number of web services grows explosively. With a large amount of information resources, it is difficult for users to quickly find the services they need. Thus, the design of an effective web service recommendation method has become the key factor to satisfy the requirements of users. However, traditional recommendation methods often tend to pay more attention to the accuracy of the results but ignore the diversity, which may lead to redundancy and overfitting, thus reducing the satisfaction of users. Considering these drawbacks, a novel method called DivMTID is proposed to improve the effectiveness by achieving accurate and diversified recommendations. First, we utilize users’ historical scores of web services to explore the users’ preferences. And we use the TF-IDF algorithm to calculate the weight vector of each web service. Second, we utilize cosine similarity to calculate the similarity between candidate web services and historical web services and we also forecast the ranking scores of candidate web services. At last, a diversification method is used to generate the top- recommended list for users. And through a case study, we show that DivMTID is an effective, accurate, and diversified web service recommendation method.

15 June 2021 in IEEE Access
Verified
Journal Article
Open access
CLChao Liu
Chao Liu
ZLZengxi Li
Zengxi Li
SLShunshun Liu
Shunshun Liu
JXJushi Xie
Jushi Xie
CYChao Yan
Chao Yan
WHWanli Huang
Wanli Huang
With the wide popularity of various sport items and the continuous prosperity of sport business, player transfer events are becoming more and more frequent, which gives birth to a big player transfer market with attractive attentions of spectators. However, for the purposes of business competition or concerns of privacy disclosure, the multiple parties involved in an identical player transfer event are often reluctant to release the concrete transfer fees of a player as the transfer fee is always sensitive enough for the player himself or herself as well as the involved multiple sport clubs. The hidden player transfer fees block the fair and transparent sport business trades and cheat prospective spectators to some extent, which decreases the spectator trust towards player market value and finally, lowers the spectators' satisfaction towards sport business. In this situation, it is becoming a necessity to develop a trusted player transfer evaluation method supported by all the parties involved in player transfer events. Inspired by this challenging task, a trusted player transfer evaluation method with privacy protection is put forward in this paper, which is mainly based on Locality-Sensitive Hashing (LSH) and Blockchain technologies and named TPTE LSH+B . At last, a series of simulated experiments are deployed to validate the feasibility of our proposed TPTE LSH+B algorithm. Experimental results report that TPTE LSH+B has a good evaluation performance with competitive approaches.

10 March 2021 in IEEE Access
Verified
Journal Article
Open access
YLYu Li
Yu Li
YZYulan Zhang
Yulan Zhang
WHWanli Huang
Wanli Huang
XZXiumei Zhang
Xiumei Zhang
RMRuichao Mo
Ruichao Mo
JSJia Song
Jia Song
With the continuous progress of world economy and human society, people’s life span is increasingly growing and as a result, the whole world is stepping into the aging society. In the aging society, the elder people generally call for specialized healthcare services that are often provisioned by their residential areas or houses or communities. In this situation, recommending appropriate houses or real estates to the elder people becomes a necessity to help create a healthy elderly care service community, which contribute much to the stability and health of the whole nation even all the world. However, the personalized preferences of the elder people are often hard to capture and profile as the requirements from the elder people are generally vague and undetermined. Moreover, the profiles of the elder people stored in different cloud platforms are often sensitive enough, which block the rational and full use of the valuable elder people profiles for better elder people preference prediction. Considering the above two challenging issues, in this research work, we propose a privacy-aware real estate recommendation method for elderly care based on the historical consumption behaviors of the elder people stored in cloud platforms. At last, the effectiveness and efficiency of the proposal are validated by a series of experiments based on a real-world dataset. Comparison results show the feasibility of the proposal in this research work.

1 April 2026 in Tsinghua Science and Technology
Verified
Journal Article
Open access
PDF file
XZXiaoran Zhao
Xiaoran Zhao
SLShanqun Lu
Shanqun Lu
CYChao Yan
Chao Yan
RZRuowei Zhang
Ruowei Zhang
WHWanli Huang
Wanli Huang
RJRong Jiang
Rong Jiang
The increasing number of available Web Application Programming Interfaces (APIs) in various service sharing communities have enabled software developers to develop their interested multimedia mashups quickly and conveniently. In this situation, a multimedia mashup with complex functionalities could be achieved by composing a set of pre-selected Web APIs by software developers. However, due to the APIs diversity in terms of development organization, programming language, invocation interface, etc, it is often difficult to determine the compatibility between the APIs selected by multimedia mashup developers beforehand especially when the developers have little background knowledge of APIs, which significantly decreases the successful rate of subsequent multimedia mashup development. In response to this challenge, we propose a subgraph matching-based compatible API’s composition recommendation method, called SubMCWACR· The advantage of SubMCWACR is that it can directly search for the API’s subgraphs that not only meet the functional requirements of the multimedia mashup but also are compatible with each other, thus boosting the effectiveness of multimedia mashup development. Through extensive experiments on a real dataset crawled from the Web API sharing platform ProgrammableWeb.com, we have demonstrated that our proposed recommendation method achieves significant improvements in terms of recommendation precision and compatibility compared with other competitive API recommendation methods.