Wen Lou

Dr. Wen Lou

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
2 February 2018 in Scientometrics
Verified
Journal Article
Closed access
PDF file
SZStar X. Zhao
Star X. Zhao
WLWen Lou
Wen Lou
ATAlice M. Tan
Alice M. Tan
SYShuang Yu
Shuang Yu

28 February 2019 in Journal of the Association for Information Science and Technology
Verified
Journal Article
Closed access
PDF file
JHJiangen He
Jiangen He
QPQing Ping
Qing Ping
WLWen Lou
Wen Lou
CCChaomei Chen
Chaomei Chen

27 December 2022 in Information Processing & Management
Verified
Journal Article
Closed access
WLWen Lou
Wen Lou
JMJie Meng
Jie Meng

13 July 2018 in Scientometrics
Verified
Journal Article
Closed access
PDF file
WLWen Lou
Wen Lou
YZYuehua Zhao
Yuehua Zhao
YCYuchen Chen
Yuchen Chen
JZJin Zhang
Jin Zhang

3 September 2019 in Journal of Information Science
Verified
Journal Article
Closed access
PDF file
WLWen Lou
Wen Lou
RPRuofan Pi
Ruofan Pi
HWHui Wang
Hui Wang
YJYuan Ju
Yuan Ju
Ontology fusion in knowledge bases has become less easy, due to the massive capacity involved in the process of semantic similarity calculation. Many similarity calculation methods have been developed, although they are hardly united. This article contributes a low-cost similarity calculation method for ontology fusion, based on the inspiration of binary metrics, with the aim of reducing the size of similarity calculations both spatially and logically. By introducing the definitions of a heterogeneous ontology, entities of ontologies and rules of ontology fusion on the basis of concept fusion and relationship fusion, we put forward the algorithm of main traverse procedure and calculated to be the least cost in time and space in comparison with traditional methods. We adopted three experiments to testify the usability of our approach from the perspective of actual library resources, small datasets and large datasets. In Experiment 1, the bibliographic data from East China Normal University Library were used to show the feasibility and capability of our proposal and present the process of the algorithm. In both Experiments 2 and 3, our approach had at least 88% confidence in detecting accurate merging mappings and also decreased time cost. The test demonstrated a good fusion result. The problem of lower recalls caused by error analysis results from the conflict between the complex structures in ontologies and the recursive functions, which will be improved in the future.

22 December 2023 in Journal of Informetrics
Verified
Journal Article
Closed access
YZYongjun Zhu
Yongjun Zhu
DKDonghun Kim
Donghun Kim
TJTing Jiang
Ting Jiang
YZYi Zhao
Yi Zhao
JHJiangen He
Jiangen He
WLWen Lou
Wen Lou