Distributed tuning of machine learning algorithms using MapReduce Clusters

Proceedings of the 3rd Workshop on Large Scale Data Mining: Theory and Applications, LDMTA 2011 - Held in Conjunction with ACM SIGKDD 2011

Volumn , Issue , 2011, Pages

  Ganjisaffar, Yasser ^a   Debeauvais, Thomas ^a   Javanmardi, Sara ^a   Caruana, Rich ^b   Lopes, Cristina Videira ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

hyper parameter; machine learning; MapReduce; optimization; tuning

Indexed keywords

ALGORITHM PARAMETERS; HYPER-PARAMETER; HYPERPARAMETERS; LEARNING METHODS; LEARNING PARAMETERS; MACHINE-LEARNING; MAP-REDUCE; MODEL ACCURACY; OVERFITTING; PARAMETER OPTIMIZATION; PARAMETER SPACES; RANDOM FORESTS; RANKING PROBLEMS; REGULARIZATION PARAMETERS; WIKIPEDIA;

DATA MINING; DECISION TREES; LEARNING SYSTEMS; OPTIMIZATION;

LEARNING ALGORITHMS;

EID: 80052331622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2002945.2002947     Document Type: Conference Paper

References (20)

1. Microsoft learning to rank datasets. http://research.microsoft.com/en-us/ projects/mslr/.
2. L. Breiman. Random forests. Machine Learning, 45:5-32, 2001. 10.1023/A:1010933404324. (Pubitemid 32933532)
3. N. V. Chawla, K.W. Bowyer, L. O. Hall, and W. P. Kegelmeyer. Smote: synthetic minority over- Sampling technique. Journal of Artificial Intelligence Research, 16:321-357, June 2002. (Pubitemid 43057176)
4. B. Chen, Liaw. Using random forest to learn imbalanced data. Technical report, Stanford, 2004.
5. I. Czogiel, K. Luebke, and C. Weihs. Response surface methodology for optimizing hyper parameters. Technical report, Universitat Dortmund Fachbereich Statistik, 2005.
6. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. Communications of ACM, 51:107-113, January 2008.
7. T. Eitrich and B. Lang. Efficient optimization of support vector machine learning parameters for unbalanced datasets. Journal of Computational and Applied Mathematics, 196:425-436, November 2006. (Pubitemid 44093872)
8. J. H. Friedman. Stochastic gradient boosting. Technical report, Technical report, Dept. Statistics, Stanford Univ., 1999.
9. J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2000.
10. S. Hido and H. Kashima. Roughly balanced bagging for imbalanced data. In SIAM Data Mining, pages 143-152, 2008.
11. K. Järvelin and J. Kekäläinen. IR evaluation methods for retrieving highly relevant documents. In SIGIR '00: Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval, pages 41-48, New York, NY, USA, 2000. ACM.
12. H. Larochelle, D. Erhan, A. Courville, J. Bergstra, and Y. Bengio. An empirical evaluation of deep architectures on problems with many factors of variation. In Proceedings of the 24th international conference on Machine learning, ICML '07, pages 473-480, New York, NY, USA, 2007. ACM.
13. A. Nareyek. Choosing search heuristics by non-stationary reinforcement learning. Applied Optimization, 86:523-544, 2003.
14. M. Postema, T. Menzies, and X. Wu. A decision support tool for tuning parameters in a machine learning algorithm. In PACES/SPICIS'97 Proceedings, pages 227-235, 1997.
15. M. Potthast, A. Barrón-Cedeño, A. Eiselt, B. Stein, and P. Rosso. Overview of the 2nd international competition on plagiarism detection. In Proceedings of the CLEF'10 Workshop on Uncovering Plagiarism, Authorship and Social Software Misuse, 2010.
16. F. Poulet. Multi-way Distributed SVM algorithms. In Parallel and Distributed computing for Machine Learning. In conjunction with the 14th European Conference on Machine Learning (ECML'03) and 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'03), Cavtat-Dubrovnik, Croatia, September 2003.
17. T. Qin, T.-Y. Liu, J. Xu, and H. Li. LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13:346-374, 2010. 10.1007/s10791-009-9123-y.
18. C. C. Skiścim and B. L. Golden. Optimization by simulated annealing: A preliminary computational study for the tsp. In Proceedings of the 15th conference on Winter Simulation - Volume 2, WSC '83, pages 523-535, Piscataway, NJ, USA, 1983. IEEE Press.
19. G. M. Weiss. Mining with rarity: A unifying framework. SIGKDD Explor. Newsl., 6:7-19, June 2004.
20. Q. Wu, C. Burges, K. Svore, and J. Gao. Ranking, boosting and model adaptation. Technical report, Microsoft Technical Report MSR-TR-2008-109, 2008.