Demo Data from VLDB 2026 / reviewers in the wild / expert
Caleb Weinreb
dblp:181/1376
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-6100-6084ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021
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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.6 | 1 | 2022 | Distinguishing discrete and continuous behavioral variability using warped autoregressive HMMs · NeurIPS 2022 |
Bioinformatics and computational biology › single-cell analysis
single-cell transcriptomics |
0.3 | 1 | 2018 | SPRING: a kinetic interface for visualizing high dimensional single-cell expression data · Bioinform. 2018 |
Bioinformatics and computational biology › epigenomics
chromatin conformation analysis |
0.2 | 1 | 2016 | Identification of hierarchical chromatin domains · Bioinform. 2016 |
Bioinformatics and computational biology › single-cell analysis
single-cell trajectory analysis |
0.1 | 1 | 2018 | SPRING: a kinetic interface for visualizing high dimensional single-cell expression data · Bioinform. 2018 |
Bioinformatics and computational biology › epigenomics
hi-c data analysis |
0.1 | 1 | 2016 | Identification of hierarchical chromatin domains · Bioinform. 2016 |
Methods — techniques the papers use, named apart from their topics
warped autoregressive HMM · 0.6depth-camera recordings · 0.6k-nearest-neighbor graph · 0.3force-directed layout · 0.3nested TAD decomposition model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Distinguishing discrete and continuous behavioral variability using warped autoregressive HMMsabstractA core goal in systems neuroscience and neuroethology is to understand how neural circuits generate naturalistic behavior. One foundational idea is that complex naturalistic behavior may be composed of sequences of stereotyped behavioral syllables, which combine to generate rich sequences of actions. To investigate this, a common approach is to use autoregressive hidden Markov models (ARHMMs) to segment video into discrete behavioral syllables. While these approaches have been successful in extracting syllables that are interpretable, they fail to account for other forms of behavioral variability, such as differences in speed, which may be better described as continuous in nature. To overcome these limitations, we introduce a class of warped ARHMMs (WARHMM). As is the case in the ARHMM, behavior is modeled as a mixture of autoregressive dynamics. However, the dynamics under each discrete latent state (i.e. each behavioral syllable) are additionally modulated by a continuous latent ``warping variable.'' We present two versions of warped ARHMM in which the warping variable affects the dynamics of each syllable either linearly or nonlinearly. Using depth-camera recordings of freely moving mice, we demonstrate that the failure of ARHMMs to account for continuous behavioral variability results in duplicate cluster assignments. WARHMM achieves similar performance to the standard ARHMM while using fewer behavioral syllables. Further analysis of behavioral measurements in mice demonstrates that WARHMM identifies structure relating to response vigor. Julia Costacurta, Lea Duncker, Blue Sheffer, Winthrop Gillis, Caleb Weinreb, Jeffrey E. Markowitz, Sandeep R. Datta, Alex H. Williams, Scott W. Linderman |
NeurIPS | 5 |
| 2018 | SPRING: a kinetic interface for visualizing high dimensional single-cell expression dataabstractMotivation: Single-cell gene expression profiling technologies can map the cell states in a tissue or organism. As these technologies become more common, there is a need for computational tools to explore the data they produce. In particular, visualizing continuous gene expression topologies can be improved, since current tools tend to fragment gene expression continua or capture only limited features of complex population topologies. Results: Force-directed layouts of k-nearest-neighbor graphs can visualize continuous gene expression topologies in a manner that preserves high-dimensional relationships and captures complex population topologies. We describe SPRING, a pipeline for data filtering, normalization and visualization using force-directed layouts and show that it reveals more detailed biological relationships than existing approaches when applied to branching gene expression trajectories from hematopoietic progenitor cells and cells of the upper airway epithelium. Visualizations from SPRING are also more reproducible than those of stochastic visualization methods such as tSNE, a state-of-the-art tool. We provide SPRING as an interactive web-tool with an easy to use GUI. Availability and implementation: https://kleintools.hms.harvard.edu/tools/spring.html, https://github.com/AllonKleinLab/SPRING/. Contact: [email protected] or [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online. Caleb Weinreb, Samuel L. Wolock, Allon M. Klein |
Bioinform. | 1 |
| 2016 | Identification of hierarchical chromatin domainsabstractMOTIVATION: The three-dimensional structure of the genome is an important regulator of many cellular processes including differentiation and gene regulation. Recently, technologies such as Hi-C that combine proximity ligation with high-throughput sequencing have revealed domains of self-interacting chromatin, called topologically associating domains (TADs), in many organisms. Current methods for identifying TADs using Hi-C data assume that TADs are non-overlapping, despite evidence for a nested structure in which TADs and sub-TADs form a complex hierarchy. RESULTS: We introduce a model for decomposition of contact frequencies into a hierarchy of nested TADs. This model is based on empirical distributions of contact frequencies within TADs, where positions that are far apart have a greater enrichment of contacts than positions that are close together. We find that the increase in contact enrichment with distance is stronger for the inner TAD than for the outer TAD in a TAD/sub-TAD pair. Using this model, we develop the TADtree algorithm for detecting hierarchies of nested TADs. TADtree compares favorably with previous methods, finding TADs with a greater enrichment of chromatin marks such as CTCF at their boundaries. AVAILABILITY AND IMPLEMENTATION: A python implementation of TADtree is available at http://compbio.cs.brown.edu/software/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Caleb Weinreb, Benjamin J. Raphael |
Bioinform. | 1 |