Bifan Wei

Bifan Wei

Auto-generated profile, based on publicly available information

Bifan Wei

Ministry of Education Key Laboratory of Intelligent Networks and Network Security, and School of Computer Science and Technology, Xian Jiaotong University, Xian, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
19 November 2025 in Information Fusion
Verified
Journal Article
Closed access
JZJian Zhang
Jian Zhang
SQShihao Qi
Shihao Qi
YDYuxuan Dong
Yuxuan Dong
LYLi Yuan
Li Yuan
TSTiesunlong Shen
Tiesunlong Shen
Jun LiuJun Liu
Jun Liu

16 December 2013 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
BWBifan Wei
Bifan Wei
JLJun Liu
Jun Liu
JMJian Ma
Jian Ma
QZQinghua Zheng
Qinghua Zheng
WZWei Zhang
Wei Zhang
BFBoqin Feng
Boqin Feng
Discovering hyponym relations among domain-specific terms is a fundamental task in taxonomy learning and knowledge acquisition. However, the great diversity of various domain corpora and the lack of labeled training sets make this task very challenging for conventional methods that are based on text content. The hyperlink structure of Wikipedia article pages was found to contain recurring network motifs in this study, indicating the probability of a hyperlink being a hyponym hyperlink. Hence, a novel hyponym relation extraction approach based on the network motifs of Wikipedia hyperlinks was proposed. This approach automatically constructs motif-based features from the hyperlink structure of a domain; every hyperlink is mapped to a 13-dimensional feature vector based on the 13 types of three-node motifs. The approach extracts structural information from Wikipedia and heuristically creates a labeled training set. Classification models were determined from the training sets for hyponym relation extraction. Two experiments were conducted to validate our approach based on seven domain-specific datasets obtained from Wikipedia. The first experiment, which utilized manually labeled data, verified the effectiveness of the motif-based features. The second experiment, which utilized an automatically labeled training set of different domains, showed that the proposed approach performs better than the approach based on lexico-syntactic patterns and achieves comparable result to the approach based on textual features. Experimental results show the practicability and fairly good domain scalability of the proposed approach.

1 July 2021
Verified
Conference Paper
Closed access
HZHanning Zhang
Hanning Zhang
BDBo Dong
Bo Dong
BFBoqin Feng
Boqin Feng
BWBifan Wei
Bifan Wei
The typical RDF querying method is a structured query language such as SPARQL. However, a structured query language requires issuers to understand the data model and query language syntax, limiting the accessibility of RDF data. The keyword query is regarded as an intuitive way for searching the RDF data. This paper proposes a keyword query approach based on the community structure of the RDF entity graph, which utilizes the characteristics of the community structure on the RDF graph. We propose a novel RDF entity graph model by designing an efficient entity index mechanism by treating the RDF entity as the virtual document, which reduces the graph scale while improving the efficiency of retrieving entities. We design an effective hierarchical and overlapping community-based index mechanism on the RDF entity graph, improving the efficiency and accuracy of the subgraph (sub-community) matching. Our approach takes full advantage of the schema of the RDF data and the community structural characteristic of the RDF entity graph. We evaluate our approach using two real-world datasets, and the experiment demonstrates the effectiveness and efficiency of our approach.

8 February 2026 in Information Fusion
Verified
Journal Article
Closed access
YWYaxian Wang
Yaxian Wang
Qika LinQika Lin
Qika Lin
JSJiangbo Shi
Jiangbo Shi
YAYisheng An
Yisheng An
Jun LiuJun Liu
Jun Liu
Xudong JiangXudong Jiang
Xudong Jiang

15 May 2026 in Information and Computation
Verified
Journal Article
Closed access
TBTingting Bao
Tingting Bao
BWBifan Wei
Bifan Wei
BLBo Li
Bo Li
LZLingling Zhang
Lingling Zhang
HPHong Peng
Hong Peng
Jun LiuJun Liu
Jun Liu

5 January 2026 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
YWYaxian Wang
Yaxian Wang
BWBifan Wei
Bifan Wei
YMYinghong Ma
Yinghong Ma
LZLingling Zhang
Lingling Zhang
Xudong JiangXudong Jiang
Xudong Jiang
Jun LiuJun Liu
Jun Liu
Geometry problem solving (GPS) requires high-level symbolic and logical reasoning based on geometry theorem knowledge to arrive at the answer. Despite the remarkable advances achieved by Large Language Models (LLMs) in various problem-solving tasks, they still struggle to perform rigorous multi-step geometry reasoning, which is essential for GPS. In this paper, we propose a dynamic tree-based geometry problem solver named GeoTree, which combines a knowledgeable LLM with a rigorous symbolic solver to perform geometry reasoning cooperatively. Specifically, an iterative multi-step geometry reasoning process is performed dynamically based on a tree-like structure, thereby emulating divergent and deliberate human problem-solving thinking. Each geometry reasoning step is completed collaboratively through four components, consisting of Theorem Seeker, Symbolic Solver, Evaluator, and Controller. First, Theorem Seeker prompts LLMs to seek out candidate theorems with their inherent geometry theorem knowledge. Subsequently, Symbolic Solver applies the theorems on the known conditions to obtain new additional conditions. Then, Evaluator assesses the availability of the theorems and prompts LLMs to judge the usefulness of these new conditions for the problem target, which serves as the heuristic guidance for subsequent reasoning. Finally, Controller determines the termination state, which decides whether to continue invoking the other three components for further attempts. Extensive experiments on Geometry3K demonstrate the superiority of GeoTree in accuracy, efficiency, and explainability.