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

Peining Li

dblp:370/2186 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs
knowledge graph embedding
1.012026
Multi-Granularity Multi-Modal Knowledge Graph Representation Learning via Subgraph-Aware Adaptive Fusion and Hierarchical Relation Modeling · WWW 2026
Knowledge graphs › knowledge graph embedding
multimodal knowledge graph embedding
1.012026
Multi-Granularity Multi-Modal Knowledge Graph Representation Learning via Subgraph-Aware Adaptive Fusion and Hierarchical Relation Modeling · WWW 2026

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

hierarchical relation modeling · 1.0adaptive fusion · 1.0
YearPublicationVenuePosition
2026 Multi-Granularity Multi-Modal Knowledge Graph Representation Learning via Subgraph-Aware Adaptive Fusion and Hierarchical Relation Modeling
Peining Li, Meiyu Liang, Junping Du 0001, Zhe Xue, Guanhua Ye, Wu Liu 0005, Lei Shi 0030
WWW1
2023 Efficient and Private Edit Distance Based Range Query over Encrypted String Sequences
abstract
Similarity range query over string sequences plays a significant role in bioinformatics, entity extraction, data mining and information retrieval. Meanwhile, with the popularity of cloud computing, a new paradigm is to outsource the similarity range query service to the cloud. However, existing solutions still have suffer from security and query efficiency drawbacks. To address these issues, we propose an efficient and private similarity range query scheme over encrypted string sequences. Specifically, we first organize string sequences into inverted index and design an inverted index based efficient similarity range query algorithm by applying several filter strategies. Second, based on public-key homomorphic encryption, we design a set of privacy-preserving protocols to protect the privacy of inverted index based range queries. Based on this, we propose a private and computationally efficient similarity range query scheme. Finally, we analyze the security of our scheme and conduct experiments to evaluate its performance, and the results indicate that our proposed scheme is computationally effective.
Peining Li, Yandong Zheng, Hui Zhu 0001, Qi Xu 0002, Zhe Liu 0001, Hui Li 0006
GLOBECOM1