Wenjun Liu

Dr. Wenjun Liu

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
27 January 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
WLWenjun Liu
Wenjun Liu
YSYuyan Sun
Yuyan Sun
BYBao Yu
Bao Yu
HWHailan Wang
Hailan Wang
QPQingcheng Peng
Qingcheng Peng
CLCheng Liu
Cheng Liu

5 July 2022 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
WLWenjun Liu
Wenjun Liu
YHYu He
Yu He
JWJing Wu
Jing Wu
YDYajun Du
Yajun Du
XLXing Liu
Xing Liu
XHXiaoping Huang
Xiaoping Huang
The focused crawler grabs continuously web pages related to the given topic according to priorities of unvisited hyperlinks. In many previous studies, the focused crawlers predict priorities of unvisited hyperlinks based on the text similarity models. However, the representation terms of the web page ignore the phenomenon of polysemy, and the topic similarity of the text cannot combine the cosine similarity and the semantic similarity effectively. To address these problems, this paper proposes a focused crawler based on semantic disambiguation vector space model (SDVSM). The SDVSM method combines the semantic disambiguation graph (SDG) and the semantic vector space model (SVSM). The SDG is used to remove the ambiguation terms irrelevant to the given topic from representation terms of retrieved web pages. The SVSM is used to calculate the topic similarity of the text by constructing text and topic semantic vectors based on TF × IDF weights of terms and semantic similarities between terms. The experiment results indicate that the SDVSM method can improve the performance of the focused crawler by comparing different evaluation indicators for four focused crawlers. In conclusion, the proposed method can make the focused crawler grab the higher quality and more quantity web pages related to the given topic from the Internet.

14 February 2025 in IEEE Access
Verified
Journal Article
Open access
WHWenhao Huang
Wenhao Huang
JZJiahao Zhang
Jiahao Zhang
XLXin Li
Xin Li
XZXiao Zhou
Xiao Zhou
DQDeyu Qi
Deyu Qi
WLWenjun Liu
Wenjun Liu
The goal of a focused crawler is to selectively fetch pages that are relevant to a given topic. Previous crawlers use text content to determine text topic relevance and manually determined weighting factors to predict the priority of unvisited URLs. However, there are still some problems in the above focused crawler methods, the calculation formula of semantic similarity between words is flawed. The weighting factor for the priority of unvisited URLs is determined arbitrarily. In order to solve the above problems, this paper proposes a semantic and intelligent focused crawler based on BERT semantic vector space model and hybrid algorithm. This method used BERT semantic vector space model to calculate the topic relevance of documents, and used a hybrid algorithm to optimize the weighting factor of unvisited URL priority. The experimental results show that the proposed BSVSM-HA crawler can obtain better evaluation indicators compared with the other three crawlers including Word2vec crawler, ELMO crawler and BSVSM crawler. In conclusion, the semantic and intelligent crawler proposed in this paper makes the semantic similarity between terms more accurate, and improves the topic relevance of the text, and the optimized weighting factor makes the priority evaluation of unvisited URLs more accurate.

17 February 2025 in World Wide Web
Verified
Journal Article
Closed access
PDF file
WHWenhao Huang
Wenhao Huang
YWYiyao Wang
Yiyao Wang
ZGZurui Gan
Zurui Gan
TXTiejun Xi
Tiejun Xi
JXJianqing Xi
Jianqing Xi
WLWenjun Liu
Wenjun Liu

30 October 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
WHWenhao Huang
Wenhao Huang
XLXiaoyan Li
Xiaoyan Li
XZXiao Zhou
Xiao Zhou
DQDeyu Qi
Deyu Qi
JXJianqing Xi
Jianqing Xi
FZFeiyu Zhao
Feiyu Zhao
A focused crawler automatically retrieves, organizes, and extracts specific topic-related information from the internet for analysis and application. Currently, most focused crawlers assess the relevance of web pages to a given topic through methods such as keyword matching, semantic analysis, and link structures. However, these existing focused crawlers suffer from issues such as misleading directions and reduced accuracy due to the lack of semantic analysis of topic terms, as well as biased computation of topic relevance caused by the absence of effective weighting factors. To solve the above-mentioned problems, this study proposes a semantic and optimized focused crawler based on Semantic Graph and Genetic Algorithm. The proposed crawler eliminates ambiguous terms by constructing a semantic graph, optimizes the weighting factors of topic relevance with asymmetry by using a genetic algorithm, and combines both above two points to predict the priority of each unvisited hyperlink. The experiment results indicate that the proposed SG-GA Crawler improves the evaluation indicators compared with the other three focused crawlers, including VSM Crawler, SSRM Crawler, and SG Crawler. More specifically, the percentage improvement achieved by the proposed method exceeds 19%, 19%, and 13% in terms of three evaluation indicators, including the number of relevant web pages, acquisition rate, and average relevance, respectively. In conclusion, the proposed focused crawler can grab more quantity and higher quality topic-related web pages from the Internet.

7 August 2024 in Soft Computing
Verified
Journal Article
Closed access
PDF file
WLWenjun Liu
Wenjun Liu
HGHuan Guo
Huan Guo
JGJiaxin Gan
Jiaxin Gan
HWHai Wang
Hai Wang
HWHailan Wang
Hailan Wang
XLXiaolei Li
Xiaolei Li