Jianming Lv

dblp:51/3036 · DBLP profile ↗
← Back
9ranked-venue papers in the field
5as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 4 (3 first)Knowledge Engineering, Semantic Web & Information Systems · 4 (1 first)Database Systems & Data Management · 1 (1 first)
YearPublicationVenuePosition
2026 Dual-debiasing network for continual named entity recognition
Shengjie Qiu, Junhao Zheng, Zhenyuan Ma, Jianming Lv, Qianli Ma 0001
Inf. Sci.4
2023 Adaptive Multivariate Time-Series Anomaly Detection
Jianming Lv, Yaquan Wang, Shengjing Chen
Inf. Process. Manag.1
2022 Unsupervised Person Re-ID via Loose-Tight Alternate Clustering
Tianbao Liang, Jianming Lv, Shengjing Chen, Hongjian Xie
KSEM (2)3
2020 Plausibility-promoting generative adversarial network for abstractive text summarization with multi-task constraint
Min Yang 0007, Xintong Wang 0001, Jianming Lv, Ying Shen 0001, Chengming Li 0004
Inf. Sci.4
2018 Homepage Augmentation by Predicting Links in Heterogenous Networks
abstract
Scholars' homepages are important places to show personal research interest and academic achievement through the Web. However, according to our observation, only a small portion of scholars update their publications and related events on their homepages in time. In this paper, we propose a homepage augmentation technique, which automatically shows the newest academic events related to a scholar on his/her homepage. Specifically, we model the relations between homepages and the events collected from the Web as a complex heterogenous network, and propose an Embedding-based Heterogenous random Walk algorithm, namely EHWalk, to predict the links between homepages and events. Compared with existing embedding-based link prediction algorithms, EHWalk supports more efficient modeling of complex heterogenous relations in a dynamically changing network, which helps link the massive new updated events to homepages precisely and efficiently. Comprehensive experiments on a real-world dataset are conducted and the results show that our algorithm can achieve both good effectiveness and efficiency for real-world deployment.
Jianming Lv, Jiajie Zhong, Weihang Chen, Qinzhe Xiao, Zhenguo Yang, Qing Li 0001
CIKM1
2018 Cross-Dataset Person Re-identification Using Similarity Preserved Generative Adversarial Networks
Jianming Lv, Xintong Wang 0001
KSEM (2)1
2018 Improving Maximum Classifier Discrepancy by Considering Joint Distribution for Domain Adaptation
Zehang Lin, Zhenguo Yang, Runwei Situ, Feitao Huang, Jianming Lv, Qing Li 0001, Wenyin Liu
WISE (2)5
2014 Identify and Trace Criminal Suspects in the Crowd Aided by Fast Trajectories Retrieval
Jianming Lv, Haibiao Lin, Zhiwen Yu 0002, Yinghong Chen, Miaoyi Deng
DASFAA (2)1
2007 CTO: concept tree based semantic overlay for pure peer-to-peer information retrieval
abstract
Inspired by how search behavior works in human society, we propose CTO, a self-organized semantic overlay based on concept tree for P2P IR infrastructure, which is efficient for full text search in pure P2P environment without any central control or powerful peer as hub node. Especially, CTO performs very well on searching the unpopular resources shared by a few peers. In our experiment, while searching for the scarce documents shared by the peers, CTO achieves about 80% recall rate when the search covers less than 5% peers in the overlay. The search latency of CTO is also very low, which is controlled in the range about 5~12 hops.
Jianming Lv, Xueqi Cheng 0001
CIKM1