2010 IEEE International Conference on Granular Computing (2010)
San Jose, California
Aug. 14, 2010 to Aug. 16, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GrC.2010.54
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.
predictive modeling, distributed data mining, dyadic data, Map-Reduce
M. Deodhar, C. Jones and J. Ghosh, "Parallel Simultaneous Co-clustering and Learning with Map-Reduce," 2010 IEEE International Conference on Granular Computing(GRC), San Jose, California, 2010, pp. 149-154.