Cut-and-stitch: Efficient parallel learning of linear dynamical systems on smps

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 471-479

  Li, Lei ^a   Fu, Wenjie ^a   Guo, Fan ^a   Mowry, Todd C ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Expectation Maximization (EM); Kalman Filters; Linear dynamical systems; Multi core; OpenMP; Optimization

Indexed keywords

CHAIN STRUCTURES; DATA DEPENDENCIES; DATA MINING ALGORITHMS; EXPECTATION MAXIMIZATION (EM); HIDDEN VARIABLES; LINEAR DYNAMICAL SYSTEMS; LINEAR SPEED-UP; LINEAR STRUCTURES; MOTION CAPTURES; MULTI PROCESSORS; MULTI-CORE; MULTI-CORE PROCESSORS; NOVEL METHODS; OPENMP; PARALLEL COMPUTING; PARALLEL LEARNING; SPEED-UP; VISUAL TRACKING;

COMPUTER ARCHITECTURE; CONTROL THEORY; DATA MINING; EDUCATION; HIDDEN MARKOV MODELS; KALMAN FILTERS; KNOWLEDGE MANAGEMENT; LADDER NETWORKS; LEARNING ALGORITHMS; LEARNING SYSTEMS; LINEAR CONTROL SYSTEMS; MAXIMUM PRINCIPLE; MINING; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; SHAPE MEMORY EFFECT; SUPERCOMPUTERS; TIME SERIES ANALYSIS;

DYNAMICAL SYSTEMS;

EID: 65449154410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401949     Document Type: Conference Paper

References (13)

1. C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
2. G. Buehrer, S. Parthasarathy, S. Tatikonda, T. Kurc, and J. Saltz. Toward terabyte pattern mining: an architecture-conscious solution. In Proc. of the 12th ACM SIGPLAN, pages 2-12. ACM, 2007.
3. E. Chang, K. Zhu, H. Wang, H. Bai, J. Li, Z. Qiu, and H. Cui. Parallelizing support vector machines on distributed computers. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, NIPS 20, pages 257-264. MIT Press, 2007.
4. C.-T. Chu, S. K. Kim, Y-A. Lin, Y. Yu, G. R. Bradski, A. Y. Ng, and K. Olukotun. Map-reduce for machine learning on. multicore. In B. Schölkopf, J. C Platt, and T. Hoffman, editors, NIPS 19, pages 281-288. MIT Press, 2006.
5. R. Collobert, S. Bengio, and Y. Bengio. A Parallel Mixture of SVMs for Very Large Scale Problems. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, NIPS. MIT Press, 2002.
6. C B. Colohan, A. Ailamaki, J. G. Steffan, and T. C. Mowry. Tolerating dependences between large speculative threads via sub-threads. In ISCA '06, pages 216-226. IEEE Computer Society, 2006.
7. S. Cong, J. Han, and D. Padua. Parallel mining of closed sequential patterns. In Proc. of the 11th ACM SIGKDD, pages 562-567. ACM, 2005.
8. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI'04: Sixth Symposium on Operating System Design and Implementation, 2004.
9. H. P. Graf, E. Cosatto, L. Bottou, I. Dourdanovic, and V. Vapnik. Parallel support vector machines: The cascade SVM. In NIPS 17, 2004.
10. Intel. Intel research, advances 'era of tera': www.intel.com/pressroom/ archive/releases/20070204comp.htm.
11. L. Li, J. McCann, C. Faloutsos, and N. Pollard. Laziness is a virtue: Motion stitching using effort minimization. In Short Papers Proceedings of EUROGRAPHICS, 2008.
12. C Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C Kozyrakis. Evaluating mapreduce for multi-core and multiprocessor systems. In HPCA '07, pages 13-24. IEEE Computer Society, 2007.
13. S. Reinhardt and G. Karypis. A multi-level parallel implementation of a program for finding frequent patterns in a large sparse graph. In IPDPS, pages 1-8. IEEE, 2007.