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

Hai Liu 0006

dblp:46/2375-6 · DBLP profile ↗
← Back
22ranked-venue papers
4as first author
11since 2021 · last 2026
0000-0003-4062-4945ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 4 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 3 · 2 since 2021Human-computer interaction and ubiquitous computing · 3 · 1 first-authorSecurity and privacy · 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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
cross-modal retrieval
0.912025
Diverse Co-Saliency Feature Learning for Text-Based Person Retrieval · IEEE Trans. Inf. Forensics Secur. 2025
Multimedia analysis and retrieval › visual search › person search
text-based person search
0.912025
Diverse Co-Saliency Feature Learning for Text-Based Person Retrieval · IEEE Trans. Inf. Forensics Secur. 2025

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

weighted mask mechanism · 0.9diversity regularization · 0.9
YearPublicationVenuePosition
2026 HFTS: Time-Span-Aware Historical-Future Modeling for Temporal Knowledge Graph Completion
Wei Huang 0013, Tianyong Hao, Fu Lee Wang, Jing He 0004, Hai Liu 0006
DASFAA (5)5
2026 PaR: Prompt-as-Expert Routing with Context-Aware Fusion for Efficient Visual Document Understanding
Bangsen Lin, Hai Liu 0006, Chaobo He, Tianyong Hao
ICIC (1)2
2025 Diverse Co-Saliency Feature Learning for Text-Based Person Retrieval
abstract
Text-based Person Retrieval (TPR) plays a pivotal role in video surveillance systems for safeguarding public safety. As a fine-grained retrieval task, TPR faces the significant challenge of precisely capturing highly discriminative features across image and text modalities. Existing methods primarily focus on establishing modality-shared feature spaces to bridge cross-modal discrepancies. However, these methods are prone to disturbances from irrelevant information, such as background noises in the visual modality, and often over-emphasize specific local regions while neglecting the capture of diverse discriminative modal features, thereby limiting the robustness of cross-modal matching. In this paper, we introduce a novel framework, termed the Diverse Co-saliency Feature Learning Network (DCFL), which mines the co-saliency information between image and text modalities and enhances the diversity of cross-modal discriminative features while mitigating the interference of noise. Specifically, to construct cross-modal co-saliency features, we devise the Intra-modal Saliency Feature Learning (ISFL) and Cross-modal Saliency Feature Matching (CSFM) modules. ISFL employs a weighted mask mechanism to guide the model in reducing the impact of noise information in both modalities. Complementing ISFL, CSFM establishes consistent relationships between saliency features across modalities, leveraging text descriptions to align pedestrian-relevant visual regions. Furthermore, we propose the Diverse Co-saliency Feature Mining (DCFM) to bolster the diversity of discriminative co-saliency features across both image and text modalities. This module integrates a diversity regularization term, enabling the extraction of varied visual cues and capturing comprehensive features of the target individual. Extensive benchmark experiments demonstrate a substantial superiority of our approach over the state-of-the-art methods. The code will be released publicly.
Shuai You, Cuiqun Chen, Yujian Feng, Hai Liu 0006, Yimu Ji 0001, Mang Ye
IEEE Trans. Inf. Forensics Secur.4
2024 Multi-stage enhanced representation learning for document reranking based on query view
Hai Liu 0006, Xiaozhi Zhu, Yong Tang 0001, Chaobo He, Tianyong Hao
World Wide Web (WWW)1
2023 OdeBERT: One-stage Deep-supervised Early-exiting BERT for Fast Inference in User Intent Classification
abstract
User intent classification is a vital task for analyzing users’ essential requirements from the users’ input query in information retrieval systems, question answering systems, and dialogue systems. Pre-trained language model Bidirectional Encoder Representation from Transformers (BERT) has been widely applied to the user intent classification task. However, BERT is compute intensive and time-consuming during inference and usually causes latency in real-time applications. To improve the inference efficiency of BERT for the user intent classification task, this article proposes a new network named one-stage deep-supervised early-exiting BERT as one-stage deep-supervised early-exiting BERT (OdeBERT). In addition, a deep supervision strategy is developed to incorporate the network with internal classifiers by one-stage joint training to improve the learning process of classifiers by extracting discriminative category features. Experiments are conducted on publicly available datasets, including ECDT, SNIPS, and FDQuestion. The results show that the OdeBERT can speed up original BERT 12 times faster at most with the same performance, outperforming state-of-the-art baseline methods.
Yuanxia Liu, Tianyong Hao, Hai Liu 0006, Yuanyuan Mu, Heng Weng, Fu Lee Wang
ACM Trans. Asian Low Resour. Lang. Inf. Process.3
2022 Semi-supervised overlapping community detection in attributed graph with graph convolutional autoencoder
Chaobo He, Yulong Zheng, Junwei Cheng, Yong Tang 0001, Hai Liu 0006
Inf. Sci.6
2021 FABERT: A Feature Aggregation BERT-Based Model for Document Reranking
Xiaozhi Zhu, Leung Pun Wong, Lap-Kei Lee, Hai Liu 0006, Tianyong Hao
NLPCC (2)4
2021 RAMCI: a novel asynchronous memory copying mechanism based on I/OAT
Zhenke Chen, Dingding Li, Hai Liu 0006, Yong Tang 0001
CCF Trans. High Perform. Comput.4
2021 Similarity preserving overlapping community detection in signed networks
Chaobo He, Hai Liu 0006, Yong Tang 0001, Shuangyin Liu, Qiwei Cheng, Hanchao Li
Future Gener. Comput. Syst.2
2021 Learning knowledge graph embedding with a bi-directional relation encoding network and a convolutional autoencoder decoding network
Kairong Hu, Hai Liu 0006, Choujun Zhan, Yong Tang 0001, Tianyong Hao
Neural Comput. Appl.2
2021 Correction to: Aggregating neighborhood information for negative sampling for knowledge graph embedding
Hai Liu 0006, Kairong Hu, Fu Lee Wang, Tianyong Hao
Neural Comput. Appl.1
2020 Aggregating neighborhood information for negative sampling for knowledge graph embedding
Hai Liu 0006, Kairong Hu, Fu Lee Wang, Tianyong Hao
Neural Comput. Appl.1
2020 Deep Representation Learning for Location-Based Recommendation
abstract
Location-based recommendation has recently received a lot of attention in the communities of information service and mobile application. Its task is to provide personalized recommendations of points of interest (POIs) to users at a certain time and location. However, existing location-based recommendation models have at least two main drawbacks: first they cannot adequately capture semantic features of POIs and users, which may lead to unsatisfactory recommendations and second they cannot effectively address the cold-start problem. To address the above drawbacks, in this article, we first propose a novel deep representation learning-based model (DRLM) for improving the recommendation accuracy. In DRLM, we mainly focus on learning to accurately represent semantic features of POIs and users. Specifically, four co-occurrence matrices are constructed to produce four different original features for each POI, and a principal component analysis (PCA) algorithm is utilized to generate a semantic feature of each POI from its four original features. On the other hand, a three-modal simple recurrent unit (TMSRU) network is given to constructed semantic features of users using semantic features of POIs, times, and locations. We further propose minimum description length (MDL)-based and skyline-based strategies to address the cold-start issues for new users and new POIs, respectively. Through experiments on two real-world data sets, we show that compared with the state-of-the-art approaches, the proposed model DRLM can achieve the superior performance in terms of high recommendation accuracy and effectiveness in handling the cold-start problem.
Zhenhua Huang 0001, Xiaolong Lin, Hai Liu 0006, Bo Zhang 0004, Yunwen Chen, Yong Tang 0001
IEEE Trans. Comput. Soc. Syst.3
2019 A Sequence-to-Sequence Text Summarization Model with Topic Based Attention Mechanism
Heng-Xi Pan, Hai Liu 0006, Yong Tang 0001
WISA2
2019 A Knowledge Selective Adversarial Network for Link Prediction in Knowledge Graph
Kairong Hu, Hai Liu 0006, Tianyong Hao
NLPCC (1)2
2018 Improving NMF-based community discovery using distributed robust nonnegative matrix factorization with SimRank similarity measure
Chaobo He, Hanchao Li, Yong Tang 0001, Hai Liu 0006, Shuangyin Liu
J. Supercomput.5
2017 Citation Based Collaborative Summarization of Scientific Publications by a New Sentence Similarity Measure
Chengzhe Yuan, Dingding Li, Jia Zhu 0003, Yong Tang 0001, Shahbaz Hassan Wasti, Chaobo He, Hai Liu 0006, Ronghua Lin
CollaborateCom7
2015 Mining streams of short text for analysis of world-wide event evolutions
Guangyan Huang, Jing He 0004, Yanchun Zhang, Wanlei Zhou 0001, Hai Liu 0006, Peng Zhang 0063, Zhiming Ding, Yue You, Jian Cao 0001
World Wide Web5
2013 Entropy on intuitionistic fuzzy soft sets and on interval-valued fuzzy soft sets
Yong Tang 0001, Hai Liu 0006, Zhenzhou Chen
Inf. Sci.3
2011 Extending fuzzy soft sets with fuzzy description logics
Yong Tang 0001, Qimai Chen, Hai Liu 0006, Jianchao Tang
Knowl. Based Syst.4
2009 A role hierarchical group awareness model and its time possibility analysis based fuzzy time
abstract
A role based hierarchical group awareness model (RHGAM) on the basis of the previous research was presented in this paper. Regarding role as the basis of the group cooperation, firstly RHGAM constructed a group cooperation environment (GCE), and then GCE was extended by group awareness content, awareness hierarchy, the task decomposition rule. The model divided the awareness information into four levels by decomposition and recombination using a role-task graph and the thinking of group structure. The time possibility analysis based fuzzy time and the implementation mechanism of the model to provide group cooperation and awareness mechanism in the project Personal Research Information Workspace were also discussed in this paper.
Yong Tang 0001, Hai Liu 0006
CSCWD4
2007 The Online Cooperating View Maintenance Based on Source View Increment
abstract
View maintenance is an important field in the research of dataware house. This paper provides an online view self-maintenance method based on source view's increment to keep the materialized view consistent with the data source. We use the cooperation between the integrator at warehouse and the monitor at data source to maintenance the view, and the method does not require to query back to data source, it can accelerate view maintenance and lessen the burden of communication between dataware house and data sources.
Hai Liu 0006, Yong Tang 0001, Qimai Chen
CSCWD1