By Topic

Parallel Simultaneous Co-clustering and Learning with Map-Reduce

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Deodhar, M. ; Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA ; Jones, C. ; Ghosh, J.

Many data mining applications involve predictive modeling of very large, complex datasets. Such applications present a need for innovative algorithms and associated implementations that are not only effective in terms of prediction accuracy, but can also be efficiently run on distributed computational systems to yield results in reasonable time. This paper focuses on predictive modeling of multirelational data such as dyadic data with associated covariates or “side-information”. We first give illustrative examples of applications that involve such data and then describe a general framework based on Simultaneous CO-clustering And Learning (SCOAL), which applies a divide-and-conquer approach to data analysis. We show that the main elements of the SCOAL algorithm can be effectively parallelized using the Map-Reduce framework. Experiments on Amazon's EC2 demonstrate that the proposed parallelizations result in considerable improvements in run time when using a cluster of machines.

Published in:

Granular Computing (GrC), 2010 IEEE International Conference on

Date of Conference:

14-16 Aug. 2010