Yuguo Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuguo Chen has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Ian H. Dinwoodie
2 shared publicationsBrenda MacGibbon
Département de mathématiques, Université du Québec à Montréal, C.P.8888, Succ. centre ville, Montréal, QC H3C 3P8, Canada
1 shared publication- Chia-Ho Lin
Department of Statistics, UCLA, Los Angeles CA 90095-1554, USA
1 shared publication - Chiara Sabatti
Department of Statistics, UCLA, Los Angeles CA 90095-1554, USA
1 shared publication - Haixun Wang
IBM T. J. Watson Research Center, Hawthorne, New York, USA
1 shared publication - Jiawei Han
University of Illinois Urbana-Champaign, Urbana, Illinois, USA
1 shared publication
Latest Publications
- 1 October 2011
- Published by Statistica Sinica (Institute of Statistical Science) in Statistica Sinica
- Vol. 21 (4)
Sampling large tables with constraints
- 1 October 2011
- Published by Statistica Sinica (Institute of Statistical Science) in Statistica Sinica
- Vol. 21 (4)
Sampling large tables with constraints
- 6 January 2010
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 21 (3) , 371-397
Re-examination of interestingness measures in pattern mining: a unified framework
- 6 January 2010
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 21 (3) , 371-397
Re-examination of interestingness measures in pattern mining: a unified framework
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 476-485
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. Ideally, an approach for information recovery should have the following features. First, it should be able to incorporate prior knowledge about the data, even if such knowledge is in the form of complex distributions and constraints for which no close-form solutions exist. Second, it should be able to capture complex correlations and quantify the degree of uncertainty in the recovered data, and further support queries over such data. The database community has developed a number of approaches for information recovery, but none is general enough to offer all above features. To overcome the limitations, we take a significantly more general approach to information recovery based on sampling. We apply sequential importance sampling, a technique from statistics that works for complex distributions and dramatically outperforms naive sampling when data is constrained. We illustrate the generality and efficiency of this approach in two application scenarios: cleansing RFID data, and recovering information from published data that has been summarized and randomized for privacy.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 476-485
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. Ideally, an approach for information recovery should have the following features. First, it should be able to incorporate prior knowledge about the data, even if such knowledge is in the form of complex distributions and constraints for which no close-form solutions exist. Second, it should be able to capture complex correlations and quantify the degree of uncertainty in the recovered data, and further support queries over such data. The database community has developed a number of approaches for information recovery, but none is general enough to offer all above features. To overcome the limitations, we take a significantly more general approach to information recovery based on sampling. We apply sequential importance sampling, a technique from statistics that works for complex distributions and dramatically outperforms naive sampling when data is constrained. We illustrate the generality and efficiency of this approach in two application scenarios: cleansing RFID data, and recovering information from published data that has been summarized and randomized for privacy.
- 2 March 2007
- Published by Oxford University Press (OUP) in Biometrics
- Vol. 63 (3) , 845-855
Sampling for Conditional Inference on Case–Control Data
Summary The problem of exact conditional inference for discrete multivariate case–control data has two forms. The first is grouped case–control data, where Monte Carlo computations can be done using the importance sampling method of Booth and Butler (1999, Biometrika86, 321–332), or a proposed alternative sequential importance sampling method. The second form is matched case–control data. For this analysis we propose a new exact sampling method based on the conditional-Poisson distribution for conditional testing with one binary and one integral ordered covariate. This method makes computations on data sets with large numbers of matched sets fast and accurate. We provide detailed derivation of the constraints and conditional distributions for conditional inference on grouped and matched data. The methods are illustrated on several new and old data sets.
- 2 March 2007
- Published by Oxford University Press (OUP) in Biometrics
- Vol. 63 (3) , 845-855
Sampling for Conditional Inference on Case–Control Data
Summary The problem of exact conditional inference for discrete multivariate case–control data has two forms. The first is grouped case–control data, where Monte Carlo computations can be done using the importance sampling method of Booth and Butler (1999, Biometrika86, 321–332), or a proposed alternative sequential importance sampling method. The second form is matched case–control data. For this analysis we propose a new exact sampling method based on the conditional-Poisson distribution for conditional testing with one binary and one integral ordered covariate. This method makes computations on data sets with large numbers of matched sets fast and accurate. We provide detailed derivation of the constraints and conditional distributions for conditional inference on grouped and matched data. The methods are illustrated on several new and old data sets.
- Open Access
- 17 November 2006
- Published by Springer Nature in BMC Genomic Data
- Vol. 7 (1) , 54
Volume measures for linkage disequilibrium
Background: Defining measures of linkage disequilibrium (LD) that have good small sample properties and are applicable to multiallelic markers poses some challenges. The potential of volume measures in this context has been noted before, but their use has been hampered by computational challenges. Results: We design a sequential importance sampling algorithm to evaluate volume measures on I × J tables. The algorithm is implemented in a C routine as a complement to exhaustive enumeration. We make the C code available as open source. We achieve fast and accurate evaluation of volume measures in two dimensional tables. Conclusion: Applying our code to simulated and real datasets reinforces the belief that volume measures are a very useful tool for LD evaluation: they are not inflated in small samples, their definition encompasses multiallelic markers, and they can be computed with appreciable speed.
- 17 November 2006
- Published by Springer Nature in BMC Genomic Data
- Vol. 7 (1) , 54
Open AccessVolume measures for linkage disequilibrium
Background: Defining measures of linkage disequilibrium (LD) that have good small sample properties and are applicable to multiallelic markers poses some challenges. The potential of volume measures in this context has been noted before, but their use has been hampered by computational challenges. Results: We design a sequential importance sampling algorithm to evaluate volume measures on I × J tables. The algorithm is implemented in a C routine as a complement to exhaustive enumeration. We make the C code available as open source. We achieve fast and accurate evaluation of volume measures in two dimensional tables. Conclusion: Applying our code to simulated and real datasets reinforces the belief that volume measures are a very useful tool for LD evaluation: they are not inflated in small samples, their definition encompasses multiallelic markers, and they can be computed with appreciable speed.