default search action
Andrew B. Nobel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Pratyaydipta Rudra, Yi-Hui Zhou
, Andrew B. Nobel, Fred A. Wright:
Control of false discoveries in grouped hypothesis testing for eQTL data. BMC Bioinform. 25(1): 147 (2024) - 2023
- [j24]Miheer Dewaskar, John Palowitch, Mark He, Michael I. Love, Andrew B. Nobel:
Finding Groups of Cross-Correlated Features in Bi-View Data. J. Mach. Learn. Res. 24: 398:1-398:47 (2023) - 2022
- [j23]Kevin O'Connor, Kevin McGoff, Andrew B. Nobel:
Optimal Transport for Stationary Markov Chains via Policy Iteration. J. Mach. Learn. Res. 23: 45:1-45:52 (2022) - [j22]Shankar Bhamidi
Community modulated recursive trees and population dependent branching processes. Random Struct. Algorithms 60(2): 201-232 (2022) - 2021
- [i8]Kevin O'Connor, Bongsoo Yi, Kevin McGoff, Andrew B. Nobel:
Graph Optimal Transport with Transition Couplings of Random Walks. CoRR abs/2106.07106 (2021) - 2020
- [j21]Rafael M. Frongillo, Andrew B. Nobel:
Memoryless Sequences for General Losses. J. Mach. Learn. Res. 21: 80:1-80:28 (2020) - [i7]Kevin O'Connor, Kevin McGoff, Andrew B. Nobel:
Optimal Transport for Stationary Markov Chains via Policy Iteration. CoRR abs/2006.07998 (2020) - [i6]Miheer Dewaskar
Finding Stable Groups of Cross-Correlated Features in Multi-View data. CoRR abs/2009.05079 (2020)
2010 – 2019
- 2018
- [j20]Gen Li
HT-eQTL: integrative expression quantitative trait loci analysis in a large number of human tissues. BMC Bioinform. 19(1): 95:1-95:11 (2018) - 2017
- [j19]James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Community Extraction in Multilayer Networks with Heterogeneous Community Structure. J. Mach. Learn. Res. 18: 149:1-149:49 (2017) - [j18]John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Significance-based community detection in weighted networks. J. Mach. Learn. Res. 18: 188:1-188:48 (2017) - [c7]Rafael M. Frongillo, Andrew B. Nobel:
Memoryless Sequences for Differentiable Losses. COLT 2017: 925-939 - 2016
- [j17]Gen Li, Dan Yang, Andrew B. Nobel, Haipeng Shen:
Supervised singular value decomposition and its asymptotic properties. J. Multivar. Anal. 146: 7-17 (2016) - [i5]John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
The Continuous Configuration Model: A Null for Community Detection on Weighted Networks. CoRR abs/1601.05630 (2016) - [i4]James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel:
Community Extraction in Multilayer Networks with Heterogeneous Community Structure. CoRR abs/1610.06511 (2016) - 2013
- [j16]Andrey A. Shabalin
Reconstruction of a low-rank matrix in the presence of Gaussian noise. J. Multivar. Anal. 118: 67-76 (2013) - [i3]James D. Wilson, Simi Wang, Peter J. Mucha, Shankar Bhamidi, Andrew B. Nobel:
A Testing Based Extraction Algorithm for Identifying Significant Communities in Networks. CoRR abs/1308.0777 (2013) - 2011
- [j15]Vonn Walter
DiNAMIC: a method to identify recurrent DNA copy number aberrations in tumors. Bioinform. 27(5): 678-685 (2011)
2000 – 2009
- 2009
- [j14]Daniel M. Gatti, Andrey A. Shabalin
FastMap: Fast eQTL mapping in homozygous populations. Bioinform. 25(4): 482-489 (2009) - 2008
- [j13]Andrey A. Shabalin
Merging two gene-expression studies via cross-platform normalization. Bioinform. 24(9): 1154-1160 (2008) - [j12]Xiang Zhang, Feng Pan, Wei Wang
Mining non-redundant high order correlations in binary data. Proc. VLDB Endow. 1(1): 1178-1188 (2008) - [j11]Florentina Bunea, Andrew B. Nobel:
Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean. IEEE Trans. Inf. Theory 54(4): 1725-1735 (2008) - 2007
- [i2]Gusztáv Morvai, Sanjeev R. Kulkarni, Andrew B. Nobel:
Regression estimation from an individual stable sequence. CoRR abs/0710.2496 (2007) - [i1]Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni:
Density estimation from an individual numerical sequence. CoRR abs/0710.2500 (2007) - 2006
- [c6]Xing Sun, Andrew B. Nobel:
Significance and Recovery of Block Structures in Binary Matrices with Noise. COLT 2006: 109-122 - [c5]Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang
Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis. SDM 2006: 407-418 - 2005
- [j10]William T. Barry, Andrew B. Nobel, Fred A. Wright:
Significance analysis of functional categories in gene expression studies: a structured permutation approach. Bioinform. 21(9): 1943-1949 (2005) - [c4]Jinze Liu, Susan Paulsen, Wei Wang
Mining Approximate Frequent Itemsets from Noisy Data. ICDM 2005: 721-724 - [c3]Félix Hernández-Campos, Andrew B. Nobel, F. Donelson Smith, Kevin Jeffay:
Understanding Patterns of TCP Connection Usage with Statistical Clustering. MASCOTS 2005: 35-44 - 2004
- [j9]Andrew B. Nobel:
Some stochastic properties of memoryless individual sequences. IEEE Trans. Inf. Theory 50(7): 1497-1505 (2004) - [c2]Andrew B. Nobel:
Memoryless individual sequences. ISIT 2004: 559 - 2003
- [j8]Andrew B. Nobel:
On optimal sequential prediction for general processes. IEEE Trans. Inf. Theory 49(1): 83-98 (2003) - 2002
- [j7]Andrew B. Nobel:
Analysis of a complexity-based pruning scheme for classification trees. IEEE Trans. Inf. Theory 48(8): 2362-2368 (2002) - 2001
- [j6]Andrew B. Nobel, Terrence M. Adams
Estimating a function from ergodic samples with additive noise. IEEE Trans. Inf. Theory 47(7): 2895-2902 (2001)
1990 – 1999
- 1998
- [j5]Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni:
Density Estimation from an Individual Numerical Sequence. IEEE Trans. Inf. Theory 44(2): 537-541 (1998) - 1997
- [j4]Andrew B. Nobel:
Recursive partitioning to reduce distortion. IEEE Trans. Inf. Theory 43(4): 1122-1133 (1997) - 1996
- [j3]Andrew B. Nobel, Richard A. Olshen:
Termination and continuity of greedy growing for tree-structured vector quantizers. IEEE Trans. Inf. Theory 42(1): 191-205 (1996) - [j2]Andrew B. Nobel:
Vanishing distortion and shrinking cells. IEEE Trans. Inf. Theory 42(4): 1303-1305 (1996) - 1992
- [j1]Andrew B. Nobel, Aaron D. Wyner:
A recurrence theorem for dependent processes with applications to data compression. IEEE Trans. Inf. Theory 38(5): 1561-1564 (1992) - 1991
- [c1]Andrew B. Nobel:
Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error. COLT 1991: 267-274
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: