2008 |
18 | EE | Andrey A. Shabalin,
Håkon Tjelmeland,
Cheng Fan,
Charles M. Perou,
Andrew B. Nobel:
Merging two gene-expression studies via cross-platform normalization.
Bioinformatics 24(9): 1154-1160 (2008) |
17 | EE | Florentina Bunea,
Andrew B. Nobel:
Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean.
IEEE Transactions on Information Theory 54(4): 1725-1735 (2008) |
16 | EE | Xiang Zhang,
Feng Pan,
Wei Wang,
Andrew B. Nobel:
Mining non-redundant high order correlations in binary data.
PVLDB 1(1): 1178-1188 (2008) |
2006 |
15 | EE | Xing Sun,
Andrew B. Nobel:
Significance and Recovery of Block Structures in Binary Matrices with Noise.
COLT 2006: 109-122 |
14 | EE | Jinze Liu,
Susan Paulsen,
Xing Sun,
Wei Wang,
Andrew B. Nobel,
Jan Prins:
Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis.
SDM 2006 |
2005 |
13 | EE | Jinze Liu,
Susan Paulsen,
Wei Wang,
Andrew B. Nobel,
Jan Prins:
Mining Approximate Frequent Itemsets from Noisy Data.
ICDM 2005: 721-724 |
12 | EE | 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 |
11 | EE | William T. Barry,
Andrew B. Nobel,
Fred A. Wright:
Significance analysis of functional categories in gene expression studies: a structured permutation approach.
Bioinformatics 21(9): 1943-1949 (2005) |
2004 |
10 | | Andrew B. Nobel:
Some stochastic properties of memoryless individual sequences.
IEEE Transactions on Information Theory 50(7): 1497-1505 (2004) |
2003 |
9 | | Andrew B. Nobel:
On optimal sequential prediction for general processes.
IEEE Transactions on Information Theory 49(1): 83-98 (2003) |
2002 |
8 | | Andrew B. Nobel:
Analysis of a complexity-based pruning scheme for classification trees.
IEEE Transactions on Information Theory 48(8): 2362-2368 (2002) |
2001 |
7 | | Andrew B. Nobel,
Terrence M. Adams:
Estimating a function from ergodic samples with additive noise.
IEEE Transactions on Information Theory 47(7): 2895-2902 (2001) |
1998 |
6 | | Andrew B. Nobel,
Gusztáv Morvai,
Sanjeev R. Kulkarni:
Density Estimation from an Individual Numerical Sequence.
IEEE Transactions on Information Theory 44(2): 537-541 (1998) |
1997 |
5 | | Andrew B. Nobel:
Recursive partitioning to reduce distortion.
IEEE Transactions on Information Theory 43(4): 1122-1133 (1997) |
1996 |
4 | | Andrew B. Nobel,
Richard A. Olshen:
Termination and continuity of greedy growing for tree-structured vector quantizers.
IEEE Transactions on Information Theory 42(1): 191-205 (1996) |
3 | | Andrew B. Nobel:
Vanishing distortion and shrinking cells.
IEEE Transactions on Information Theory 42(4): 1303-1305 (1996) |
1992 |
2 | | Andrew B. Nobel,
Aaron D. Wyner:
A recurrence theorem for dependent processes with applications to data compression.
IEEE Transactions on Information Theory 38(5): 1561- (1992) |
1991 |
1 | EE | Andrew B. Nobel:
Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error.
COLT 1991: 267-274 |