Map-Reduce for Machine Learning on Multicore
by Cheng-Tao Chu. Sang Kyun Kim. Yi-An Lin. YuanYuan Yu. Gary Bradski. Andrew Y. Ng. Kunle Olukotun.
We are at the beginning of the multicore era. Computers will have increasingly many cores (processors), but there is still no good programming framework for these architectures, and thus no simple and unified way for machine learning to take advantage of the potential speed up. In this paper, we develop a broadly applicable parallel programming method, one that is easily applied to many different learning algorithms. Our work is in distinct contrast to the tradition in machine learning of designing (often ingenious) ways to speed up a single algorithm at a time. Specifically, we show that algorithms that fit the Statistical Query model [15] can be written in a certain “summation form,” which allows them to be easily parallelized on multicore computers. We adapt Google’s map-reduce [7] paradigm to demonstrate this parallel speed up technique on a variety of learning algorithms including locally weighted linear regression (LWLR), k-means, logistic regression (LR), naive Bayes (NB), SVM, ICA, PCA, gaussian discriminant analysis (GDA), EM, and backpropagation (NN). Our experimental results show basically linear speedup with an increasing number of processors. [via]
http://www.cs.stanford.edu/people/ang//papers...
Note: We do not store any files or documents in our server.
multicore
Related Files
- Characteristics of Long-term Learning in Soar and its Application to the Utility Problem
- MapReduce: Distributed Computing for Machine Learning
- Experiments in Transfer Across Multiple Learning Mechanisms
- Investigating Transfer Learning in the Urban Combat Testbed
- Personal Learning Environments - the Future of eLearning?
- Towards a Theory of Mobile Learning
Hot Spot
Fast Direction-Aware Proximity for Graph Mining
...In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in several graph mining tasks, including clustering, link prediction and connection subgraph discovery. Our proximity measure is based on the concept of escape pro..... detail »
Parallel Bifold: Large-Scale Parallel Pattern Mining with Constraints
...When computationally feasible, mining huge databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets due to their sheer size; not only the extent of the existing patterns, but mainly the magnitude of the search space. Many approaches have suggested the use of constrain..... detail »
Finding All Frequent Patterns Starting from the Closure
...Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of data mining. Although many efficient frequent-pattern mining techniques have been developed in the last decade, most of them assume relatively small databas..... detail »
Rate this Document
Popular eBooks
- The Solaris Operating System on x86 Platforms
- Alternative and Herbal Livestock Health Sourcebook
- Bug Patterns in Java - Chapter 2: Bugs, Specifications, and Implementations
- Trusted Platform Module (TPM) based Security on Notebook PCs - White Paper
- A Z Patterns Catalogue II: Definitions and Laws, v0.1
- A Quick, Painless Introduction to the Perl Scripting Language
- R for Programmers
- Professor Norm Matloff's Beginner's Guide to Installing and Using Linux
- Waves and Rays in Elastic Continua - Second Edition
- Elements for Physics: Quantities, Qualities, and Intrinsic Theories
ADS
Tag Clouds
3d algorithm analysis application architecture design ebook energy framework guide java javascript kernel linux manual network paper programming python reference security software system theory thesis tutorial typography web service white paper xml
Last Download
- Primary B Cell Lymphoma of the Thyroid and its Relationship to Hashimoto's Thyroiditis
- Handbook on Biomass Gasification
- The Java Virtual Machine
- PyGTK 2.0 Tutorial
- A Sample Of Thesis
BookShelf
- Comparison of SOLR and TRL Calibrations
- Tutorial: Building a Java applet
- Nios II Processor Reference Handbook
- Recording to the Roland KR-277 (Piano Lab)
- Extensible Markup Language (XML) 1.0
...The paper describes how Condor-pools could be joined together to form a large computational cluster-grid. In the architecture Jini provides the infrastructure for resource lookup, while Condor manages..
...Enterprises today need to extend their reach, reduce their costs, and lower the response times of their services to customers, employees, and suppliers. Typically, applications that provide these serv..