Hailin Zhou

Hailin Zhou

Auto-generated profile, based on publicly available information

Hailin Zhou

School of Computer and Information, Hefei University of Technology, Anhui, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
15 December 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YYYonghui Yang
Yonghui Yang
LWLe Wu
Le Wu
KZKun Zhang
Kun Zhang
RHRichang Hong
Richang Hong
HZHailin Zhou
Hailin Zhou
MWMeng Wang
Meng Wang
Social recommendation provides an auxiliary social network structure to enhance recommendation performances. By formulating user-user social network and user-item interaction graph, modern social recommendation architecture is built on learning user and item embeddings into Euclidean space with graph convolution operations. However, the Euclidean space suffers structure distortion when representing the nature power-law distribution of graphs, leading to sub-optimal results for graph based social recommendation. Recently, some studies have explored the alternative of graph embedding learning into hyperbolic space, which can preserve the hierarchy of real-world graphs. However, directly applying current hyperbolic graph embedding models for social recommendation is non-trivial as two challenges: network heterogeneity and social diffusion noise. First, due to the semantic gap existing between social networks and user-item interactions, how to tackle the heterogeneity issue of social recommendation under hyperbolic formulation? Second, explicit modeling of social diffusion easily introduces noise for user preference learning, especially for those active users with amounts of interactions. To tackle the above challenges, in this paper, we propose a Hyperbolic Graph Learning based Social Recommendation (HGSR) model. Firstly, we exploit social structure with hyperbolic social embedding pre-training, which could preserve the hierarchical properties of social networks. Secondly, we construct the heterogeneous graph based on user-item interactions and social networks, then treat the pre-trained social embeddings as an additional feature input for user preference learning. Such that, we combine explicit heterogeneous graph learning and implicit feature enhancement for the hyperbolic social recommendation, which can well tackle heterogeneity and social noise issues. We conduct empirical studies on four datasets, and extensive experiments demonstrate the effectiveness of our proposed model compared to state-of-the-art baselines.

4 September 2020 in arXiv
Verified
Preprint
Open access
PDF file
SZShuang Zhou
Shuang Zhou
LYLu You
Lu You
HZHailin Zhou
Hailin Zhou
YPYong Pu
Yong Pu
ZGZhigang Gui
Zhigang Gui
JWJunling Wang
Junling Wang
Copper indium thiophosphate, CuInP2S6, has attracted much attention in recent years due to its van der Waals layered structure and robust ferroelectricity at room temperature. In this review, we aim to give an overview of the various properties of CuInP2S6, covering structural, ferroelectric, dielectric, piezoelectric and transport properties, as well as its potential applications. We also highlight the remaining questions and possible research directions related to this fascinating material and other compounds of the same family.

19 May 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
BLBo Li
Bo Li
KZKun Zhang
Kun Zhang
CSCheng Song
Cheng Song
XCXi Chen
Xi Chen
HZHailin Zhou
Hailin Zhou
RHRichang Hong
Richang Hong
Text watermarking focuses on embedding identifiable information into the generated content, which has become increasingly important with the rapid development of large language models (LLMs). Existing watermarking works either divide the vocabulary of LLMs into “green” and “red” tokens for the watermark generation (i.e., token-level watermark), or use the distance of generated sentence embeddings to distinguish the “green” and “red” partitions (i.e., sentence-level watermark). Despite the achieved progress, existing methods remain vulnerable to various attacks or exhibit limited generalization to out-of-distribution (OOD) scenarios. To this end, we focus on sentence-level watermarking and propose a novel semantic-oriented robust text watermark for LLMs (SoTW). Specifically, we first employ a pre-trained embedding model to extract representations of generated sentences. Then, different from existing sentence-level works, we design a novel semantic quantization autoencoder (SQAE) to generate discrete sentence partition representations. Moreover, a semantic loss and a consistency loss are designed to ensure the generalization and robustness of generated watermarks. Furthermore, we develop an efficient detection method for our proposed SoTW. Extensive experiments on three LLMs across three publicly available datasets demonstrate the robustness of SoTW against various attacks in OOD settings. We also release the code to facilitate the community1https://github.com/libolb/SoTW.