Andrew B. Nobel

According to our database, Andrew B. Nobel authored at least 36 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Control of false discoveries in grouped hypothesis testing for eQTL data.

Pratyaydipta Rudra, Yi-Hui Zhou, Andrew B. Nobel, Fred A. Wright

BMC Bioinform., December, 2024

2022

Community modulated recursive trees and population dependent branching processes.

Shankar Bhamidi, Ruituo Fan, Nicolas Fraiman, Andrew B. Nobel

Random Struct. Algorithms, 2022

Optimal Transport for Stationary Markov Chains via Policy Iteration.

Kevin O'Connor, Kevin McGoff, Andrew B. Nobel

J. Mach. Learn. Res., 2022

2021

Graph Optimal Transport with Transition Couplings of Random Walks.

Kevin O'Connor, Bongsoo Yi, Kevin McGoff, Andrew B. Nobel

CoRR, 2021

2020

Memoryless Sequences for General Losses.

Rafael M. Frongillo, Andrew B. Nobel

J. Mach. Learn. Res., 2020

Finding Stable Groups of Cross-Correlated Features in Multi-View data.

Miheer Dewaskar, John Palowitch, Mark He, Michael I. Love, Andrew B. Nobel

CoRR, 2020

2018

HT-eQTL: integrative expression quantitative trait loci analysis in a large number of human tissues.

Gen Li, Dereje Jima, Fred A. Wright, Andrew B. Nobel

BMC Bioinform., 2018

2017

Community Extraction in Multilayer Networks with Heterogeneous Community Structure.

James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel

J. Mach. Learn. Res., 2017

Significance-based community detection in weighted networks.

John Palowitch, Shankar Bhamidi, Andrew B. Nobel

J. Mach. Learn. Res., 2017

Memoryless Sequences for Differentiable Losses.

Rafael M. Frongillo, Andrew B. Nobel

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Supervised singular value decomposition and its asymptotic properties.

Gen Li, Dan Yang, Andrew B. Nobel, Haipeng Shen

J. Multivar. Anal., 2016

The Continuous Configuration Model: A Null for Community Detection on Weighted Networks.

John Palowitch, Shankar Bhamidi, Andrew B. Nobel

CoRR, 2016

2013

Reconstruction of a low-rank matrix in the presence of Gaussian noise.

Andrey A. Shabalin, Andrew B. Nobel

J. Multivar. Anal., 2013

A Testing Based Extraction Algorithm for Identifying Significant Communities in Networks.

James D. Wilson, Simi Wang, Peter J. Mucha, Shankar Bhamidi, Andrew B. Nobel

CoRR, 2013

2011

DiNAMIC: a method to identify recurrent DNA copy number aberrations in tumors.

Vonn Walter, Andrew B. Nobel, Fred A. Wright

Bioinform., 2011

2009

FastMap: Fast eQTL mapping in homozygous populations.

Daniel M. Gatti, Andrey A. Shabalin, Tieu-Chong Lam, Fred A. Wright, Ivan Rusyn, Andrew B. Nobel

Bioinform., 2009

2008

Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean.

Florentina Bunea, Andrew B. Nobel

IEEE Trans. Inf. Theory, 2008

Mining non-redundant high order correlations in binary data.

Xiang Zhang, Feng Pan, Wei Wang, Andrew B. Nobel

Proc. VLDB Endow., 2008

Merging two gene-expression studies via cross-platform normalization.

Andrey A. Shabalin, Håkon Tjelmeland, Cheng Fan, Charles M. Perou, Andrew B. Nobel

Bioinform., 2008

2007

Regression estimation from an individual stable sequence.

Gusztáv Morvai, Sanjeev R. Kulkarni, Andrew B. Nobel

CoRR, 2007

2006

Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis.

Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang, Andrew B. Nobel, Jan F. Prins

Proceedings of the Sixth SIAM International Conference on Data Mining, 2006

Significance and Recovery of Block Structures in Binary Matrices with Noise.

Xing Sun, Andrew B. Nobel

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Significance analysis of functional categories in gene expression studies: a structured permutation approach.

William T. Barry, Andrew B. Nobel, Fred A. Wright

Bioinform., 2005

Understanding Patterns of TCP Connection Usage with Statistical Clustering.

Félix Hernández-Campos, Andrew B. Nobel, F. Donelson Smith, Kevin Jeffay

Proceedings of the 13th International Symposium on Modeling, 2005

Mining Approximate Frequent Itemsets from Noisy Data.

Jinze Liu, Susan Paulsen, Wei Wang, Andrew B. Nobel, Jan F. Prins

Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

2004

Some stochastic properties of memoryless individual sequences.

Andrew B. Nobel

IEEE Trans. Inf. Theory, 2004

Memoryless individual sequences.

Andrew B. Nobel

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On optimal sequential prediction for general processes.

Andrew B. Nobel

IEEE Trans. Inf. Theory, 2003

2002

Analysis of a complexity-based pruning scheme for classification trees.

Andrew B. Nobel

IEEE Trans. Inf. Theory, 2002

2001

Estimating a function from ergodic samples with additive noise.

Andrew B. Nobel, Terrence M. Adams

IEEE Trans. Inf. Theory, 2001

1998

Density Estimation from an Individual Numerical Sequence.

Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni

IEEE Trans. Inf. Theory, 1998

1997

Recursive partitioning to reduce distortion.

Andrew B. Nobel

IEEE Trans. Inf. Theory, 1997

1996

Termination and continuity of greedy growing for tree-structured vector quantizers.

Andrew B. Nobel, Richard A. Olshen

IEEE Trans. Inf. Theory, 1996

Vanishing distortion and shrinking cells.

Andrew B. Nobel

IEEE Trans. Inf. Theory, 1996

1992

A recurrence theorem for dependent processes with applications to data compression.

Andrew B. Nobel, Aaron D. Wyner

IEEE Trans. Inf. Theory, 1992

1991

Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error.

Andrew B. Nobel

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991