Representative subsets for big data learning using k-NN graphs

Proceedings - 2014 IEEE International Conference on Big Data, IEEE Big Data 2014

Volumn , Issue , 2014, Pages 37-42

  Mall, Raghvendra ^a   Jumutc, Vilen ^a   Langone, Rocco ^a   Suykens, Johan A K ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; NEAREST NEIGHBOR SEARCH; SET THEORY; UNDIRECTED GRAPHS;

DATA NETWORK; DENSE REGION; DETERMINISTIC METHODS; DISTRIBUTED NETWORKS; K-NN GRAPHS; LARGE-SCALE DATASETS; NETWORK GENERATION; SELECTION METHODS; SELECTION TECHNIQUES; SUBSET SELECTION;

BIG DATA;

EID: 84921727996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.2014.7004210     Document Type: Conference Paper

References (28)

1. R. Mall, R. Langone and J.A.K. Suykens; FURS: Fast and Unique Representative Subset selection retaining large scale community structure. Social Network Analysis and Mining, 3(4): 1-21, 2013.
2. R. Mall, R. Langone and J.A.K. Suykens; Kernel Spectral Clustering for Big Data Networks. Entropy (SI: Big Data), 15(5): 1567-1586, 2013.
3. S. Owen, R. Anil, T. Dunning and E. Friedman; Mahout in Action Manning Publications Co., 1st Edition, 2011.
4. A. Agarwal, O. Chapelle and J. Langford; A Reliable Effective Terascale Linear Learning System. JMLR, 15(1): 1111-1133, 2014.
5. T. White; Hadoop: The Definitive Guide. 1st Edition, O'Reilly Media Inc., (ISBN: 0596521979, 9780596521974), 2009.
6. D.S. Yates, D.S. Moore and D.S. Starnes; The Practice of Statistics. 3rd Edition, Freeman, (ISBN 978-0-7167-7309-2), 2008.
7. C.E. Särdnal, B.Swenson and J. Wretman; Model assisted survey sampling. Springer-Verlag, (ISBN 0-387-40620-4), 1992.
8. K. De Brabanter, J. De Brabanter, J.A.K. Suykens and B.De Moor; Optimized Fixed-Size Kernel Models for Large Data Sets. Computational Statistics &Data Analysis, 54(6): 1484-1504, 2010.
9. R. Mall and J.A.K. Suykens; Sparse Variations to Fixed-Size Least Squares Support Vector Machines for Large Scale Data. In Proc. of PAKDD 2013, pp. 161-173, GoldCoast, Australia, 2013.
10. R. Mall and J.A.K. Suykens; Very Sparse LSSVM Reductions for Large Scale Data. IEEE Trans. on Neural Net. and Learning Sys, in press.
11. C. Alzate and J.A.K. Suykens; Multiway spectral clustering with outof-sample extensions through weighted kernel PCA. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(2): 335-347, 2010.
12. R. Mall, S. Mehrkanoon, R. Langone and J.A.K. Suykens; Optimal Reduced Sets for Sparse Kernel Spectral Clustering. IJCNN, 2014.
13. R. Mall, R. Langone and J.A.K. Suykens; Self-Tuned Kernel Spectral Clustering for Large Scale Networks, In Proc. of the IEEE BigData 2013), Santa Clara, USA, Oct. 2013.
14. D.S. Moore and G.P. McCabe; Introduction to the practice of statistics. W.H. Freeman &Co., 5th Edition, (ISBN 0-7167-6282-X), 2005.
15. D. Eppstein, M.S. Paterson and F. Yao; On-nearest neighbor graphs. Discrete and Computational Geometry, 17(3): 263-282, 1997.
16. G.L. Miller, S. Teng, W. Thurston and S.A. Vavasis; Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44(1): 1-29, 1997.
17. C.K.I. Williams and M. Seeger; Using the Nyström method to speed up kernel machines. Advances in NIPS, 13: 682-688, 2001.
18. J. Liu, A. Kimbell and A.C. Myers; Interruptible Iterators. SIGPLAN Not., 41(1): 283-294, 2006.
19. M. Rudemo; Empirical choice of histograms and kernel density estimators. Scandinavian Journal of Statistics, 9: 65-78, 1982.
20. A.W. Bowman; An alternative method of cross-validation for smoothing of density estimators. Biometrika, 71: 353-360, 1984.
21. A. Kleiner, A. Talwalker, P. Sarkar and M.I. Jordan; The Big Data Bootstrap. ICML, 2012.
22. B.W. Silverman; Density Estimation for Statistics and Data Analysis. London: Chapman &Hall/CRC, (ISBN 0-412-24620-1) 1998.
23. M. Zaharia, M.Chowdhury, M.J. Franklin, S.Shenker and I. Stoica; Spark: Cluster computing with Working Sets. In Proc. of the 2nd USENIX Conference on Hot Topics in Cloud Computing, Boston, 2010.
24. T.H. Cormen, C. Stein, R.L. Rivest and C.E. Leiserson; Introduction to Algorithms. McGraw-Hill Higher Education, 2nd Edition, (ISBN: 0070131511), 2001.
25. S. Xavier de Souza, J.A.K. Suykens, J.Vandewalle and D.Bolle; Coupled Simulated Annealing for Continuous Global Optimization. IEEE Tran. Systems, Man, and Cybertics-Part B, 40(2): 320-335, 2010.
26. J.A. Nelder and R. Mead; A simplex method for function minimization. Computer Journal, 7: 308-313, 1965.
27. C.L. Blake and C.J. Merz; UCI repository of machine learning databases. http: //archive.ics.uci.edu/ml/datasets.html, Irvine, CA, 2007.
28. R. Rabbany, M. Takaffoli, J. Fagnan, O.R. Zaiane, and R.J.G.B. Campello; Relative Validity Criteria for Community Mining Algorithms. In Proc. of ASONAM, pp. 258-265, 2012