Ye Chen

Prof. Dr. Ye Chen

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 February 2020 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YCYe Chen
Ye Chen
HWHongzhi Wang
Hongzhi Wang
WLWenbo Lu
Wenbo Lu
JLJianzhong Li
Jianzhong Li

23 March 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YCYe Chen
Ye Chen
Hongzhi WangHongzhi Wang
Hongzhi Wang
KZKangjie Zheng
Kangjie Zheng
YKYouKang Kong
YouKang Kong
RZRong Zhu
Rong Zhu
JLJianzhong Li
Jianzhong Li
To aggregate useful information among diversified sources, a hotspot research topic called truth discovery has emerged in recent years. Existing truth discovery methods attempt to infer the true attribute values for the entities by identifying and trusting reliable data sources. However, all these methods neglect the relations among different entities, which play important roles in truth discovery task. When reliable data sources cannot provide sufficient information of entities, the true attribute values of these entities can still be inferred by propagating trustworthy information from related entities. Motivated by this, in this paper, we introduce the constrained truth discovery problem. We incorporate denial constraints, a universally quantified first-order logic formalism, into the process of truth discovery. We formulate it as a constrained optimization problem and analyze its hardness. To address the problem, we propose algorithms to partition the entities into disjoint groups, and generate arithmetic constraints for each disjoint group separately. Then, the true attribute values of the entities in each disjoint group are derived by minimizing the objective function under the corresponding arithmetic constraints. Experimental results on both real-world and synthetic datasets demonstrate that the proposed approach achieves good performance even with very few constraints and reliable sources.

25 March 2016
Verified
Book Chapter
Closed access
PDF file
YCYe Chen
Ye Chen
Hongzhi WangHongzhi Wang
Hongzhi Wang
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
SCSiyao Cheng
Siyao Cheng

1 January 2020 in Information Sciences
Verified
Journal Article
Closed access
YCYe Chen
Ye Chen
Hongzhi WangHongzhi Wang
Hongzhi Wang
KZKangjie Zheng
Kangjie Zheng
JGJing Gao
Jing Gao
JLJianzhong Li
Jianzhong Li

16 May 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
YCYe Chen
Ye Chen
HDHaoyang Duan
Haoyang Duan
HZHengtong Zhang
Hengtong Zhang
HZHua zhang
Hua zhang
Hongzhi WangHongzhi Wang
Hongzhi Wang
GDGuojun Dai
Guojun Dai
In the era of Big Data, integrating information from multiple sources has proven valuable in various fields. To ensure a high-quality supply of multi-source data, repairing different types of errors in the multi-source data becomes critical. This paper categorizes errors in multi-source data into entity information overlapping, attribute value conflicts, and attribute value inconsistencies. We first summarize existing repairing methods for these errors and then examine and review the study of the detection and repair of compound-type errors in multi-source data. Finally, we indicate further research directions in multi-source data repair.

1 July 2019 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YCYe Chen
Ye Chen
HWHongzhi Wang
Hongzhi Wang
TMTingting Ma
Tingting Ma
JGJing Gao
Jing Gao
HZHengtong Zhang
Hengtong Zhang
JLJianzhong Li
Jianzhong Li