PPT-Matrix Profile II: Exploiting a Novel Algorithm and GPUs to break the one Hundred Million

Matrix Profile II Exploiting a Novel Algorithm and GPUs to break the one Hundred Million Barrier for Time Series Motifs and Joins Yan Zhu Zachary Zimmerman Nader Shakibay Senobari ChinChia Michael Yeh Gareth Funning Abdullah Mueen. Near-Duplicate Figures. Thanawin (Art) Rakthanmanon, . Qiang. Zhu,. Eamonn. J. Keogh. What is a near-duplicate pattern (motif)?. [20] A synopsis of the British . Diatomaceae. , 1853. [15] A history of .  . Eamonn Keogh . With. Yan Zhu, Chin-. Chia. Michael . Yeh. , Abdullah Mueen. . with contributions from Zachary Zimmerman, Nader . Shakibay. . Senobari. ,, Gareth Funning, Philip Brisk, Liudmila Ulanova, Nurjahan Begum, . . Chin-Chia Michael Yeh, Helga Van Herle, Eamonn Keogh . http://www.cs.ucr.edu/~eamonn/MatrixProfile.html. Outline. Motivation. Proposed method. Experiment result. Conclusion. 2. Outline. Motivation. Yan Zhu, Zachary Zimmerman, Nader . Shakibay. . Senobari. . Chin-Chia Michael Yeh, Gareth Funning, Abdullah Mueen,. Philip Brisk, Eamonn Keogh . http://www.cs.ucr.edu/~eamonn/MatrixProfile.html. without. explaining how to compute it!. In this half, we will describe algorithms to compute matrix profile, optimization techniques for scalability, portability to modern hardware, approximation to gain speed, and extension to special cases.. without. explaining how to compute it!. In this half, we will describe algorithms to compute matrix profile, optimization techniques for scalability, portability to modern hardware, approximation to gain speed, and extension to special cases.. In this document we present some more or less random examples of the Matrix Profile for diverse datasets, in order to sharpen your intuitions. . If you look in the notes box, you can find enough details to reproduce the demonstrations. .  . Eamonn Keogh . With. Yan Zhu, Chin-. Chia. Michael . Yeh. , Abdullah Mueen. . with contributions from Zachary Zimmerman, Nader . Shakibay. . Senobari. ,, Gareth Funning, Philip Brisk, Liudmila Ulanova, Nurjahan Begum, . Powers. . with Applications . to Preconditioning. Erin C. Carson. Nicholas Knight, James . Demmel. , Ming . Gu. U.C. Berkeley. Motivation: The Cost of an Algorithm. Algorithms have 2 costs: Arithmetic (flops). without. explaining how to compute it!. In this half, we will describe algorithms to compute matrix profile, optimization techniques for scalability, portability to modern hardware, approximation to gain speed, and extension to special cases.. Graph Algorithms. Uri Zwick. Tel Aviv University. November 2016. 1. Algebraic matrix multiplication. Strassen. ’s algorithm. Rectangular matrix multiplication. Boolean matrix multiplication. Simple reduction to integer matrix multiplication. Yan Zhu, Zachary Zimmerman, Nader . Shakibay. . Senobari. . Chin-Chia Michael Yeh, Gareth Funning, Abdullah Mueen,. Philip Brisk, Eamonn Keogh . http://www.cs.ucr.edu/~eamonn/MatrixProfile.html. . Chin-Chia Michael Yeh, Helga Van Herle, Eamonn Keogh . http://www.cs.ucr.edu/~eamonn/MatrixProfile.html. Outline. Motivation. Proposed method. Experiment result. Conclusion. 2. Outline. Motivation. A Unifying View of Motif Discovery, Anomaly Detection, Segmentation, Classification, Clustering and Similarity Joins . Eamonn Keogh. Abdullah Mueen. We will start at 8:25am to allow stragglers to find the room .