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

Kevin C. Chen

dblp:18/10543 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Theory of computation · 3Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1

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 · 100%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.212015
Spectral Learning of Large Structured HMMs for Comparative Epigenomics · NIPS 2015
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.212015
Spectral Learning of Large Structured HMMs for Comparative Epigenomics · NIPS 2015
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
spectral learning
0.212015
Spectral Learning of Large Structured HMMs for Comparative Epigenomics · NIPS 2015
Bioinformatics and computational biology › comparative genomics
genome rearrangement
0.112006
On the tandem duplication-random loss model of genome rearrangement · SODA 2006
Algorithms and data structures › data streams
streaming algorithms
0.012002
Finding Frequent Items in Data Streams · ICALP 2002
Bioinformatics and computational biology
phylogenetics
0.012000
Notung: dating gene duplications using gene family trees · RECOMB 2000

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

spectral algorithm · 0.4method of moments · 0.4combinatorial optimization · 0.1
YearPublicationVenuePosition
2015 Spectral Learning of Large Structured HMMs for Comparative Epigenomics
abstract
We develop a latent variable model and an efficient spectral algorithm motivated by the recent emergence of very large data sets of chromatin marks from multiple human cell types. A natural model for chromatin data in one cell type is a Hidden Markov Model (HMM); we model the relationship between multiple cell types by connecting their hidden states by a fixed tree of known structure. The main challenge with learning parameters of such models is that iterative methods such as EM are very slow, while naive spectral methods result in time and space complexity exponential in the number of cell types. We exploit properties of the tree structure of the hidden states to provide spectral algorithms that are more computationally efficient for current biological datasets. We provide sample complexity bounds for our algorithm and evaluate it experimentally on biological data from nine human cell types. Finally, we show that beyond our specific model, some of our algorithmic ideas can be applied to other graphical models.
Chicheng Zhang, Jimin Song, Kamalika Chaudhuri, Kevin C. Chen
NIPS4
2006 On the tandem duplication-random loss model of genome rearrangement
Kamalika Chaudhuri, Kevin C. Chen, Radu Mihaescu, Satish Rao
SODA2
2005 Bioinformatics for Whole-Genome Shotgun Sequencing of Microbial Communities
abstract
The application of whole-genome shotgun sequencing to microbial communities represents a major development in metagenomics, the study of uncultured microbes via the tools of modern genomic analysis. In the past year, whole-genome shotgun sequencing projects of prokaryotic communities from an acid mine biofilm, the Sargasso Sea, Minnesota farm soil, three deep-sea whale falls, and deep-sea sediments have been reported, adding to previously published work on viral communities from marine and fecal samples. The interpretation of this new kind of data poses a wide variety of exciting and difficult bioinformatics problems. The aim of this review is to introduce the bioinformatics community to this emerging field by surveying existing techniques and promising new approaches for several of the most interesting of these computational problems.
Kevin C. Chen, Lior Pachter
PLoS Comput. Biol.1
2004 Finding frequent items in data streams
Moses Charikar, Kevin C. Chen, Martin Farach-Colton
Theor. Comput. Sci.2
2002 Finding Frequent Items in Data Streams
Moses Charikar, Kevin C. Chen, Martin Farach-Colton
ICALP2
2000 Notung: dating gene duplications using gene family trees
abstract
Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important role in the evolution of the maize, yeast and vertebrate genomes. The use of evolutionary trees to analyze the history of gene duplication and estimate duplication times provides a powerful tool for studying this process. Many studies in the molecular evolution literature have used this approach on small data sets, using analyses performed by hand. The rapid growth of genetic sequence data will soon allow similar studies on a genomic scale but such studies will be limited unless the analysis can be automated. Even existing data sets admit alternative hypotheses that would be too tedious to consider without automation.
Kevin C. Chen, Dannie Durand, Martin Farach-Colton
RECOMB1