Hongchen Wu

Dr. Hongchen Wu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
29 October 2022 in Information Processing & Management
Verified
Journal Article
Open access
JJJing Jing
Jing Jing
HWHongchen Wu
Hongchen Wu
JSJie Sun
Jie Sun
XFXiaochang Fang
Xiaochang Fang
HZHuaxiang Zhang
Huaxiang Zhang

26 November 2023 in Information Processing & Management
Verified
Journal Article
Open access
XFXiaochang Fang
Xiaochang Fang
HWHongchen Wu
Hongchen Wu
JJJing Jing
Jing Jing
YMYihong Meng
Yihong Meng
BYBing Yu
Bing Yu
HZHuaxiang Zhang
Huaxiang Zhang

26 September 2019 in IEEE Access
Verified
Journal Article
Open access
MLMingyang Li
Mingyang Li
HWHongchen Wu
Hongchen Wu
HZHuaxiang Zhang
Huaxiang Zhang
Collaborative filtering with implicit feedback is regarded as one of the most challenging issues in social ecommerce networks. However, the scarcity of negative feedback and the impact of time makes collaborative filtering difficult to use. Most models assign a uniform weight to missing data, but this method is invalid in the real world and leads to a biased representation of user profiles. In social ecommerce networks, the popularity of an item is implicit social information that is dynamic and can affect the preferences of a user. In this paper, we propose a smart model named TimeMF to address the above issues by incorporating implicit feedback and temporal information into social ecommerce recommendation. The weighting scheme is based on the dynamic popularity of an item. Then, we present an objective function and adopt an optimization strategy to enhance the efficiency. The experimental results for a real-world dataset reveal that our model outperforms the baselines on several metrics.

17 March 2025 in Neurocomputing
Verified
Journal Article
Open access
HYHongzhu Yu
Hongzhu Yu
HWHongchen Wu
Hongchen Wu
XFXiaochang Fang
Xiaochang Fang
MLMeng Li
Meng Li
HZHuaxiang Zhang
Huaxiang Zhang

15 April 2019 in IEEE Access
Verified
Journal Article
Open access
HWHongchen Wu
Hongchen Wu
MLMingyang Li
Mingyang Li
HZHuaxiang Zhang
Huaxiang Zhang
Security enhancement is and always will be a prime concern for the deployment of point-of-interest (POI) recommendation services in mobile sensing environment. Recent tamper-proof technical protection such as strong encryption has undoubtedly become a major safeguard against threats to privacy in location-based services. Although the disclosure of location information could increase recommendation accuracy, the publication of trajectory data to untrusted entities could reveal sensitive details, e.g., daily routes, destinations, and favorite restaurants. In this paper, we propose a smart scheme named BUSA to approach the above problem by reconciling the tension between privacy protection and recommendation accuracy in location-based recommendation services. This scheme uses anonymizer agents positioned between the service-requesting users and location service providers; these agents operate by dividing the query information and using $k$ -anonymity to enhance privacy protection. The scheme also utilizes clustering techniques to group users into clusters by learning their trajectory data and selects the spatial center cells as a cluster core and a benchmark for calculating recommendations via trust computing. An anonymizer coordination strategy is proposed to replace a low-performing anonymizer with one that provides stronger privacy protection for a recommendation service. The BUSA scheme adopts $k$ -anonymity and clustering to protect privacy, and the calculated recommendation will be suitable for the cluster core that represents the entirety of users’ location preferences. The security analysis reveals that the BUSA scheme can effectively protect privacy against fraudulent query requestors and the simulation results also indicate that it provides stronger privacy protection than its counterparts from the perspective of recommendation hit rate and the extent of disclosure.

1 January 2018 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
HWHongchen Wu
Hongchen Wu
HZHuaxiang Zhang
Huaxiang Zhang
LCLizhen Cui
Lizhen Cui
XWXinjun Wang
Xinjun Wang
For several reasons, the cloud computing paradigm, e.g., mobile edge computing (MEC), is suffering from the problem of privacy issues. MEC servers provide personalization services to mobile users for better QoE qualities, but the ongoing migrated data from the source edge server to the destination edge server cause users to have privacy concerns and unwillingness of self‐disclosure, which further leads to a sparsity problem. As a result, personalization services ignore valuable user profiles across edges where users have accounts in and tend to predict users’ potential purchases with insufficient sources, thereby limiting further improvement of QoE through personalization of the contents. This paper proposes a novel model, called CEPTM, which (1) collects mobile user data across multiple MEC edge servers, (2) improves the users’ experience in personalization services by loading collected diverse data, and (3) lowers their privacy concern with the improved personalization. This model also reveals that famous topics in one edge server can migrate into several other edge servers with users’ favorite content tags and that the diverse types of items could increase the possibility of users accepting the personalization service. In the experiment section, we use exploratory factor analysis to mathematically evaluate the correlations among those factors that influence users’ information disclosure in the MEC network, and the results indicate that CEPTM (1) achieves a high rate of personalization acceptance due to the availability of more data as input and highly diverse personalization as output and (2) gains the users’ trust because it collects user data while respecting individual privacy concerns and providing better personalization. It outperforms a traditional personalization service that runs on a single‐edge server. This paper provides new insights into MEC diverse personalization services and privacy problems, and researchers and personalization providers can apply this model to merge popular users’ like trends throughout the MEC edge servers and generate better data management strategies.