-
1
-
-
0034598746
-
Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling
-
A. Alizadeh, M. Eisen, R. Davis, C. Ma, I. Lossos, and A. Rosenwald. Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. Nature, 403:503-511, 2000.
-
(2000)
Nature
, vol.403
, pp. 503-511
-
-
Alizadeh, A.1
Eisen, M.2
Davis, R.3
Ma, C.4
Lossos, I.5
Rosenwald, A.6
-
2
-
-
0033536012
-
Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays
-
A. Alon, N. Barkai, D. A. Notterman, K. Gish, S. Ybarra, D. Mack, and A. J. Levine. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Cell Biology, 96:6745-6750, 1999.
-
(1999)
Cell Biology
, vol.96
, pp. 6745-6750
-
-
Alon, A.1
Barkai, N.2
Notterman, D.A.3
Gish, K.4
Ybarra, S.5
MacK, D.6
Levine, A.J.7
-
3
-
-
69049101180
-
High-dimensional analysis of semidefinite relaxiation for sparse principal components
-
A. A. Amini and M. J. Wainwright. High-dimensional analysis of semidefinite relaxiation for sparse principal components. Annals of Statistics, 37:2877-2921, 2009.
-
(2009)
Annals of Statistics
, vol.37
, pp. 2877-2921
-
-
Amin, A.A.1
Wainwright, M.J.2
-
4
-
-
84867954454
-
Complexity of finidng dense subgraphs
-
Y. Asahiro, R. Hassin, and K. Iwama. Complexity of finidng dense subgraphs. Discrete Applied Mathematics, 211(1-3):15-26, 2002.
-
(2002)
Discrete Applied Mathematics
, vol.211
, Issue.1-3
, pp. 15-26
-
-
Asahiro, Y.1
Hassin, R.2
Iwama, K.3
-
5
-
-
34848848916
-
A deterministic algorithm for the densest k-subgraph problem using linear programming
-
CEDRIC, CNAM-IIE, Paris
-
A. Billionnet and F. Roupin. A deterministic algorithm for the densest k-subgraph problem using linear programming. Technical report, Technical Report, No. 486, CEDRIC, CNAM-IIE, Paris, 2004.
-
(2004)
Technical Report, Technical Report, No. 486
-
-
Billionne, A.1
Roupin, F.2
-
8
-
-
0021483662
-
Clustering and domination in perfect graphs
-
D. G. Corneil and Y. Perl. Clustering and domination in perfect graphs. Discrete Applied Mathematics, 9:27-39, 1984.
-
(1984)
Discrete Applied Mathematics
, vol.9
, pp. 27-39
-
-
Cornei, D.G.1
Perl, Y.2
-
9
-
-
34548514458
-
A direct formulation for sparse pca using semidefinite programming
-
A. d'Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet. A direct formulation for sparse pca using semidefinite programming. SIAM Review, 49:434-448, 2007.
-
(2007)
SIAM Review
, vol.49
, pp. 434-448
-
-
D'Aspremont, A.1
El Ghaoui, L.2
Jordan, M.I.3
Lanckriet, G.R.G.4
-
11
-
-
0005259971
-
The dense k-subgraph problem
-
U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
-
(2001)
Algorithmica
, vol.29
, Issue.3
, pp. 410-421
-
-
Feige, U.1
Kortsarz, G.2
Peleg, D.3
-
14
-
-
0004236492
-
-
Johns Hopkins University Press, Baltimore, MD, third edition
-
G. H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, third edition, 1996.
-
(1996)
Matrix Computations
-
-
Golu, G.H.1
Van Loan, C.F.2
-
15
-
-
0000118166
-
Two case studies in the application of principal components
-
J. Jeffers. Two case studies in the application of principal components. Applied Statistics, 16(3): 225-236, 1967.
-
(1967)
Applied Statistics
, vol.16
, Issue.3
, pp. 225-236
-
-
Jeffers, J.1
-
16
-
-
84877591068
-
Finding densest k-subgraph via 1-mean clustering and low-dimension approximation
-
P. Jiang, J. Peng, M. Heath, and R. Yang. Finding densest k-subgraph via 1-mean clustering and low-dimension approximation. Technical report, 2010.
-
(2010)
Technical Report
-
-
Jiang, P.1
Peng, J.2
Heath, M.3
Yang, R.4
-
17
-
-
0035641726
-
On the distribution of the largest eigenvalue in principal components analysis
-
I. M. Johnstone. On the distribution of the largest eigenvalue in principal components analysis. Annals of Statistics, 29:295-327, 2001.
-
(2001)
Annals of Statistics
, vol.29
, pp. 295-327
-
-
Johnstone, I.M.1
-
18
-
-
0141941674
-
A modified principal component technique based on the lasso
-
I. T. Jolliffe, N. T. Trendafilov, and M. Uddin. A modified principal component technique based on the lasso. Journal of Computational and Graphical Statistics, 12(3):531-547, 2003.
-
(2003)
Journal of Computational and Graphical Statistics
, vol.12
, Issue.3
, pp. 531-547
-
-
Jolliffe, I.T.1
Trendafilov, N.T.2
Uddin, M.3
-
19
-
-
77949527718
-
Generalized power method for sparse principal component analysis
-
M. Journée, Y. Nesterov, P. Richtárik, and Rodolphe Sepulchre. Generalized power method for sparse principal component analysis. Journal of Machine Learning Research, 11:517-553, 2010.
-
(2010)
Journal of Machine Learning Research
, vol.11
, pp. 517-553
-
-
Journée, M.1
Nesterov, Y.2
Richtárik, P.3
Sepulchre, R.4
-
20
-
-
34547839125
-
Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique
-
S. Khot. Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM Journal on Computing, 36(4):1025-1071, 2006.
-
(2006)
SIAM Journal on Computing
, vol.36
, Issue.4
, pp. 1025-1071
-
-
Khot, S.1
-
22
-
-
0003259559
-
Trawling the web for emerging cybercommunities
-
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cybercommunities. In Proceedings of the 8th World Wide Web Conference (WWW'99), pages 403-410, 1999.
-
(1999)
Proceedings of the 8th World Wide Web Conference (WWW'99)
, pp. 403-410
-
-
Kumar, R.1
Raghavan, P.2
Rajagopalan, S.3
Tomkins, A.4
-
23
-
-
48749089882
-
A constant approximation algorithm for the densest ksubgraph problem on chordal graphs
-
M. Liazi, I. Milis, and V. Zissimopoulos. A constant approximation algorithm for the densest ksubgraph problem on chordal graphs. Information Processing Letters, 108(1):29-32, 2008.
-
(2008)
Information Processing Letters
, vol.108
, Issue.1
, pp. 29-32
-
-
Liazi, M.1
Milis, I.2
Zissimopoulos, V.3
-
24
-
-
84877623616
-
Sparse principal component analysis and iterative thresholding
-
Z. Ma. Sparse principal component analysis and iterative thresholding. Annals of Statistics, to appear, 2013.
-
(2013)
Annals of Statistics
-
-
Ma, Z.1
-
26
-
-
76749107542
-
Online learning for matrix factorization and sparse coding
-
J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11:10-60, 2010.
-
(2010)
Journal of Machine Learning Research
, vol.11
, pp. 10-60
-
-
Mairal, J.1
Bach, F.2
Ponce, J.3
Sapiro, G.4
-
29
-
-
0028383620
-
Heuristic and special case algorithms for dispersion problems
-
S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Operations Research, 42:299-310, 1994.
-
(1994)
Operations Research
, vol.42
, pp. 299-310
-
-
Ravi, S.S.1
Rosenkrantz, D.J.2
Tayi, G.K.3
-
30
-
-
84869784137
-
Consistency of sparse pca in high dimension, low sample size contexts
-
D. Shen, H. Shen, and J.S. Marron. Consistency of sparse pca in high dimension, low sample size contexts. Journal of Multivariate Analysis, 115:317-333, 2013.
-
(2013)
Journal of Multivariate Analysis
, vol.115
, pp. 317-333
-
-
Shen, D.1
Shen, H.2
Marron, J.S.3
-
31
-
-
43049086717
-
Sparse principal component analysis via regularized low rank matrix approximation
-
H. Shen and J. Z. Huang. Sparse principal component analysis via regularized low rank matrix approximation. Journal of Multivariate Analysis, 99(6):1015-1034, 2008.
-
(2008)
Journal of Multivariate Analysis
, vol.99
, Issue.6
, pp. 1015-1034
-
-
She, H.1
Huang, J.Z.2
-
34
-
-
70149096300
-
A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
-
D. M. Witten, R. Tibshirani, and T. Hastie. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics, 10(3):515-534, 2009.
-
(2009)
Biostatistics
, vol.10
, Issue.3
, pp. 515-534
-
-
Witten, D.M.1
Tibshirani, R.2
Hastie, T.3
-
35
-
-
84877589747
-
New approximation methods for solving binary quadratic programming problem
-
Master Thesis, Department of Industrial and Enterprise Systems Engineering, University of Illnois at Urbana-Champaign
-
R. Yang. New approximation methods for solving binary quadratic programming problem. Technical report, Master Thesis, Department of Industrial and Enterprise Systems Engineering, University of Illnois at Urbana-Champaign, 2010.
-
(2010)
Technical Report
-
-
Yang, R.1
-
36
-
-
84867958372
-
Approximation of dense-n/2-subgraph and the complement of minbisection
-
Y. Y. Ye and J. W. Zhang. Approximation of dense-n/2-subgraph and the complement of minbisection. Journal of Global Optimization, 25:55-73, 2003.
-
(2003)
Journal of Global Optimization
, vol.25
, pp. 55-73
-
-
Ye, Y.Y.1
Zhang, J.W.2
-
37
-
-
33745309913
-
Sparse principal component analysis
-
H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. Journal of Computational and Graphical Statistics, 15(2):265-286, 2006.
-
(2006)
Journal of Computational and Graphical Statistics
, vol.15
, Issue.2
, pp. 265-286
-
-
Zou, H.1
Hastie, T.2
Tibshirani, R.3
|