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

Zenghui Lu

dblp:356/6128 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0004-4507-1205ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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.

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

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

TopicWeightPapersLastEvidence papers
Information retrieval › online advertising › sponsored search
ad retrieval
0.912025
Real-time Ad Retrieval via LLM-generative Commercial Intention for Sponsored Search Advertising · EMNLP 2025
Information retrieval › retrieval models › neural retrieval
LLM-based retrieval
0.912025
Real-time Ad Retrieval via LLM-generative Commercial Intention for Sponsored Search Advertising · EMNLP 2025
Information retrieval › online advertising
sponsored search
0.912025
Real-time Ad Retrieval via LLM-generative Commercial Intention for Sponsored Search Advertising · EMNLP 2025

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

large language model · 0.9commercial intention generation · 0.9
YearPublicationVenuePosition
2025 Real-time Ad Retrieval via LLM-generative Commercial Intention for Sponsored Search Advertising
abstract
The integration of Large Language Models (LLMs) with retrieval systems has shown promising potential in retrieving documents (docs) or advertisements (ads) for a given query.Existing LLM-based retrieval methods generate numeric or content-based DocIDs to retrieve docs or ads.However, the one-to-few mapping between numeric IDs and docs, along with the time-consuming content extraction, leads to semantic inefficiency and limits the scalability of existing methods on large-scale corpora.In this paper, we propose the Realtime Ad REtrieval (RARE) framework, which leverages LLM-generated text called Commercial Intentions (CIs) as an intermediate semantic representation to directly retrieve ads for queries in real-time.These CIs are generated by a customized LLM injected with commercial knowledge, enhancing its domain relevance.Each CI corresponds to multiple ads, yielding a lightweight and scalable set of CIs.RARE has been implemented in a real-world online system, handling daily search volumes in billions.The online implementation has yielded significant benefits: a 5.04% increase in consumption, a 6.37% increase in gross merchandise volume (GMV), a 1.28% enhancement in click-through rate (CTR) and a 5.29% increase in shallow conversions.Extensive offline experiments show RARE's superiority over ten competitive baselines in four major categories.
Meiyue Qin, Zenghui Lu, Yuekui Yang, Peng Shu
EMNLP4
2023 A Hunter-Prey Algorithm Coordinating Mutual Benefit and Sharing and Interactive Learning for High-Efficiency Design of Photovoltaic Models
abstract
It is crucial for the photovoltaic system to have an accurate model and well‐estimated parameters to further increase conversion efficiency. Most existing methods for identifying photovoltaic model parameters have problems such as high computational cost, local optimum trouble, or difficulty in providing the best performance due to complex adjustments of algorithm parameters. To improve these defects, a hunter‐prey optimization algorithm coordinating mutual benefit and sharing and interactive learning activities (EHPO) is proposed. First, based on hunter‐prey optimization, timely information sharing with the mutual benefit and sharing mechanism was achieved when the algorithm was applied to search for prey, thus improving the searching precision and convergence rate of the algorithm. Second, hunters used the history optimization information and useful information from peers to guide the search direction, thus balancing the global and local development abilities of the algorithm. Finally, a lens imaging backward learning strategy was adopted to prevent the algorithm from falling into the local optimum, thus increasing the diversity of varieties and the probability of finding the global optimal solution. The simulation results of the single‐diode model (SDM), double‐diode model (DDM), triple‐diode model (TDM), and other PV models in different environmental conditions show that the improved EHPO algorithm is more advantageous for parameter extraction than other advanced metaheuristic algorithms. This study demonstrates that EHPO is an accurate and reliable tool for predicting the parameters of PV models.
Chiwen Qu, Zenghui Lu, Xiaoning Peng, Guangkang Lin
Int. J. Intell. Syst.2