Mengchen Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mengchen Zhang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Chen Jason Zhang
The Hong Kong Polytechnic University, Hong Kong, Hong Kong
1 shared publication - Hosagrahar Visvesvaraya Jagadish
University of Michigan Ann Arbor MI USA
1 shared publication - Lei Chen
HKUST, Hong Kong, Hong Kong
1 shared publication - Qi-Man Shao
The Chinese University of Hong Kong
1 shared publication - Yongxin Tong
School of Computer Science and Engineering, Beihang University, Beijing, China
1 shared publication - Zhuo-Song Zhang
Department of Statistics and Applied Probability National University of Singapore 117546 Singapore
1 shared publication
Latest Publications
- Open Access
Cramér-type Moderate Deviation Theorems for Nonnormal Approximation
A Cram\'er-type moderate deviation theorem quantifies the relative error of the tail probability approximation. It provides theoretical justification when the limiting tail probability can be used to estimate the tail probability under study. Chen Fang and Shao (2013) obtained a general Cram\'er-type moderate result using Stein's method when the limiting was a normal distribution. In this paper, Cram\'er-type moderate deviation theorems are established for nonnormal approximation under a general Stein identity, which is satisfied via the exchangeable pair approach and Stein's coupling. In particular, a Cram\'er-type moderate deviation theorem is obtained for the general Curie--Weiss model and the imitative monomer-dimer mean-field model.
Open AccessCramér-type Moderate Deviation Theorems for Nonnormal Approximation
A Cram\'er-type moderate deviation theorem quantifies the relative error of the tail probability approximation. It provides theoretical justification when the limiting tail probability can be used to estimate the tail probability under study. Chen Fang and Shao (2013) obtained a general Cram\'er-type moderate result using Stein's method when the limiting was a normal distribution. In this paper, Cram\'er-type moderate deviation theorems are established for nonnormal approximation under a general Stein identity, which is satisfied via the exchangeable pair approach and Stein's coupling. In particular, a Cram\'er-type moderate deviation theorem is obtained for the general Curie--Weiss model and the imitative monomer-dimer mean-field model.
- 13 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (1) , 135-151
Reducing Uncertainty of Schema Matching via Crowdsourcing with Accuracy Rates
Schema matching is a central challenge for data integration systems. Inspired by the popularity and the success of crowdsourcing platforms, we explore the use of crowdsourcing to reduce the uncertainty of schema matching. Since crowdsourcing platforms are most effective for simple questions, we assume that each Correspondence Correctness Question (CCQ) asks the crowd to decide whether a given correspondence should exist in the correct matching. Furthermore, members of a crowd may sometimes return incorrect answers with different probabilities. Accuracy rates of individual crowd workers can be attributes of CCQs as well as evaluations of individual workers. We prove that uncertainty reduction equals to entropy of answers minus entropy of crowds and show how to obtain lower and upper bounds for it. We propose frameworks and efficient algorithms to dynamically manage the CCQs to maximize the uncertainty reduction within a limited budget of questions. We develop two novel approaches, namely "Single CCQ" and "Multiple CCQ", which adaptively select, publish and manage the questions. We verify the value of our solutions with simulation and real implementation.
- 13 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (1) , 135-151
Reducing Uncertainty of Schema Matching via Crowdsourcing with Accuracy Rates
Schema matching is a central challenge for data integration systems. Inspired by the popularity and the success of crowdsourcing platforms, we explore the use of crowdsourcing to reduce the uncertainty of schema matching. Since crowdsourcing platforms are most effective for simple questions, we assume that each Correspondence Correctness Question (CCQ) asks the crowd to decide whether a given correspondence should exist in the correct matching. Furthermore, members of a crowd may sometimes return incorrect answers with different probabilities. Accuracy rates of individual crowd workers can be attributes of CCQs as well as evaluations of individual workers. We prove that uncertainty reduction equals to entropy of answers minus entropy of crowds and show how to obtain lower and upper bounds for it. We propose frameworks and efficient algorithms to dynamically manage the CCQs to maximize the uncertainty reduction within a limited budget of questions. We develop two novel approaches, namely "Single CCQ" and "Multiple CCQ", which adaptively select, publish and manage the questions. We verify the value of our solutions with simulation and real implementation.