-
1
-
-
84856161441
-
Prototype selection for nearest neighbor classification: Taxonomy and empirical study
-
S. Garcia, J. Derrac, J. R. Cano, and F. Herrera, "Prototype selection for nearest neighbor classification: Taxonomy and empirical study," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 3, pp. 417-435, 2012.
-
(2012)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.34
, Issue.3
, pp. 417-435
-
-
Garcia, S.1
Derrac, J.2
Cano, J.R.3
Herrera, F.4
-
2
-
-
0001217510
-
Clustering by means of medoids
-
Y. Dodge (Ed.)
-
L. Kaufman and P. Rousseeuw, "Clustering by means of medoids," In Y. Dodge (Ed.), Statistical Data Analysis based on the L1 Norm (North-Holland, Amsterdam), pp. 405-416, 1987.
-
(1987)
Statistical Data Analysis Based on the L1 Norm (North-Holland, Amsterdam)
, pp. 405-416
-
-
Kaufman, L.1
Rousseeuw, P.2
-
3
-
-
0003216822
-
Efficient algorithms for computing a strong rank-revealing qr factorization
-
M. Gu and S. C. Eisenstat, "Efficient algorithms for computing a strong rank-revealing qr factorization," SIAM Journal on Scientific Computing, vol. 17, pp. 848-869, 1996.
-
(1996)
SIAM Journal on Scientific Computing
, vol.17
, pp. 848-869
-
-
Gu, M.1
Eisenstat, S.C.2
-
4
-
-
33847172327
-
Clustering by passing messages between data points
-
B. J. Frey and D. Dueck, "Clustering by passing messages between data points," Science, vol. 315, pp. 972-976, 2007.
-
(2007)
Science
, vol.315
, pp. 972-976
-
-
Frey, B.J.1
Dueck, D.2
-
5
-
-
70349135853
-
Column subset selection, matrix factorization, and eigenvalue optimization
-
J. A. Tropp, "Column subset selection, matrix factorization, and eigenvalue optimization," ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 978-986, 2009.
-
(2009)
ACM-SIAM Symp. Discrete Algorithms (SODA)
, pp. 978-986
-
-
Tropp, J.A.1
-
6
-
-
70349152160
-
An improved approximation algorithm for the column subset selection problem
-
C. Boutsidis, M. W. Mahoney, and P. Drineas, "An improved approximation algorithm for the column subset selection problem," in Proceedings of SODA, 2009, pp. 968-977.
-
(2009)
Proceedings of SODA
, pp. 968-977
-
-
Boutsidis, C.1
Mahoney, M.W.2
Drineas, P.3
-
8
-
-
85162015690
-
CUR from a sparse optimization viewpoint
-
J. Bien, Y. Xu, and M. W. Mahoney, "CUR from a sparse optimization viewpoint," NIPS, 2010.
-
(2010)
NIPS
-
-
Bien, J.1
Xu, Y.2
Mahoney, M.W.3
-
9
-
-
0002170151
-
Rank revealing QR factorizations
-
T. Chan, "Rank revealing QR factorizations," Lin. Alg. and its Appl., vol. 88-89, pp. 67-82, 1987.
-
(1987)
Lin. Alg. And its Appl.
, vol.88-89
, pp. 67-82
-
-
Chan, T.1
-
11
-
-
84862519707
-
A convex model for non-negative matrix factorization and dimensionality reduction on physical space
-
E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin, "A convex model for non-negative matrix factorization and dimensionality reduction on physical space," IEEE Transactions on Image Processing, vol. 21, no. 7, pp. 3239-3252, 2012.
-
(2012)
IEEE Transactions on Image Processing
, vol.21
, Issue.7
, pp. 3239-3252
-
-
Esser, E.1
Moller, M.2
Osher, S.3
Sapiro, G.4
Xin, J.5
-
12
-
-
23844463259
-
A constant-factor approximation algorithm for the k-median problem
-
M. Charikar, S. Guha, A. Tardos, and D. B. Shmoys, "A constant-factor approximation algorithm for the k-median problem," Journal of Computer System Sciences, vol. 65, no. 1, pp. 129-149, 2002.
-
(2002)
Journal of Computer System Sciences
, vol.65
, Issue.1
, pp. 129-149
-
-
Charikar, M.1
Guha, S.2
Tardos, A.3
Shmoys, D.B.4
-
18
-
-
80555129673
-
Structured variable selection with sparsity-inducing norms
-
R. Jenatton, J. Y. Audibert, and F. Bach, "Structured variable selection with sparsity-inducing norms," Journal of Machine Learning Research, vol. 12, pp. 2777-2824, 2011.
-
(2011)
Journal of Machine Learning Research
, vol.12
, pp. 2777-2824
-
-
Jenatton, R.1
Audibert, J.Y.2
Bach, F.3
-
19
-
-
30844461481
-
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
-
J. A. Tropp., "Algorithms for simultaneous sparse approximation. part ii: Convex relaxation," Signal Processing, special issue "Sparse approximations in signal and image processing", vol. 86, pp. 589-602, 2006.
-
(2006)
Signal Processing, Special issue "Sparse Approximations in Signal and Image Processing"
, vol.86
, pp. 589-602
-
-
Tropp, J.A.1
-
20
-
-
33750383209
-
K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
-
M. Aharon, M. Elad, and A. M. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. on Signal Processing, vol. 54, no. 11, pp. 4311-4322, 2006.
-
(2006)
IEEE Trans. on Signal Processing
, vol.54
, Issue.11
, pp. 4311-4322
-
-
Aharon, M.1
Elad, M.2
Bruckstein, A.M.3
-
21
-
-
0028428774
-
A database for handwritten text recognition research
-
J. J. Hull, "A database for handwritten text recognition research," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 5, pp. 550-554, 1994.
-
(1994)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.16
, Issue.5
, pp. 550-554
-
-
Hull, J.J.1
|