Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David S. Choi

dblp:62/8775 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Graph learning · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 50% Bioinformatics and computational biology · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.112011
Confidence Sets for Network Structure · NIPS 2011
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › relational model
statistical network models
0.112011
Confidence Sets for Network Structure · NIPS 2011
Machine learning › Graph learning
stochastic block model
0.112011
Confidence Sets for Network Structure · NIPS 2011
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network analysis
network topology inference
0.112011
Confidence Sets for Network Structure · NIPS 2011
Computational social science and digital humanities
social network analysis
0.112011
Confidence Sets for Network Structure · NIPS 2011
Data mining
clustering
0.012011
Confidence Sets for Network Structure · NIPS 2011
Data mining › structured data mining › graph mining
community detection
0.012011
Confidence Sets for Network Structure · NIPS 2011

Methods — techniques the papers use, named apart from their topics

stochastic expectation-maximization · 0.4logistic regression · 0.4confidence set · 0.4
YearPublicationVenuePosition
2011 Confidence Sets for Network Structure
abstract
Latent variable models are frequently used to identify structure in dichotomous network data, in part because they give rise to a Bernoulli product likelihood that is both well understood and consistent with the notion of exchangeable random graphs. In this article we propose conservative confidence sets that hold with respect to these underlying Bernoulli parameters as a function of any given partition of network nodes, enabling us to assess estimates of \emph{residual} network structure, that is, structure that cannot be explained by known covariates and thus cannot be easily verified by manual inspection. We demonstrate the proposed methodology by analyzing student friendship networks from the National Longitudinal Survey of Adolescent Health that include race, gender, and school year as covariates. We employ a stochastic expectation-maximization algorithm to fit a logistic regression model that includes these explanatory variables as well as a latent stochastic blockmodel component and additional node-specific effects. Although maximum-likelihood estimates do not appear consistent in this context, we are able to evaluate confidence sets as a function of different blockmodel partitions, which enables us to qualitatively assess the significance of estimated residual network structure relative to a baseline, which models covariates but lacks block structure.
David S. Choi, Patrick J. Wolfe, Edoardo M. Airoldi
NIPS1
2000 Image compression using fuzzy subband decomposition
abstract
At low bit rates, the linear subband coders are susceptible to the ringing effect, which causes rippling and blurring around the edges in the images. On the other hand, the nonlinear coders are affected by the smearing effect wherein the detail regions are removed. In this paper, we introduce fuzzy subband coding system. This system uses fuzzy median filters in the analysis and synthesis stage of the coder. The motivation for this study is to determine if this novel system can reduce both ringing and smearing effect. Experimental results show that this new subband coder does out-perform linear and median filter subband coders, both in PSNR and visually.
Sos S. Agaian, David S. Choi, Joseph P. Noonan
FUZZ-IEEE2