book

Time Series Indexing

Name: Time Series Indexing
Author: Mihalis Tsoukalos
ISBN: 9781838821951

by Mihalis Tsoukalos

June 2023

Intermediate to advanced

248 pages

5h 41m

English

Packt Publishing

Read now

Unlock full access

Time Series Indexing
ContributorsAbout the authorAbout the reviewer
Preface
Who this book is forWhat this book coversTo get the most out of this bookDownload the example code filesDownload the color images Conventions usedGet in touchShare your thoughtsDownload a free PDF copy of this book
Chapter 1: An Introduction to Time Series and the Required Python Knowledge
Technical requirementsUnderstanding time seriesTime series are everywhereEssential definitionsTime series data miningComparing time seriesThe Euclidean distanceThe Chebyshev distanceWhat is an index and why do we need indexing?The Python knowledge that we are going to needTiming Python codeAn introduction to AnacondaThe required Python packagesSetting up our environmentPrinting package versionsCreating sample dataPublicly available time series dataHow time series are processedReading time series from diskIs all data numeric?Do all lines have the same amount of data?Creating subsequencesVisualizing time seriesWorking with the Matrix ProfileExploring the MPdist distanceSummaryResources and useful linksExercises
Chapter 2: Implementing SAX
Technical requirementsThe required theoryWhy do we need SAX?NormalizationVisualizing normalized time seriesAn introduction to SAXThe cardinality parameterThe segments parameterHow to manually find the SAX representation of a subsequenceΗow can we divide 10 data points into 3 segments?Reducing the cardinality of a SAX representationDeveloping a Python packageThe basics of Python packagesThe SAX Python packageWorking with the SAX packageComputing the SAX representations of the subsequences of a time seriesCounting the SAX representations of a time seriesThe tsfresh Python packageCreating a histogram of a time seriesCalculating the percentiles of a time seriesSummaryUseful linksExercises
Chapter 3: iSAX – The Required Theory
Technical requirementsBackground informationTrees and binary treesUnderstanding how iSAX worksThe cardinality parameterThe segments parameterThe threshold parameterComputing the normalized mean valuesHow big can an iSAX index get?What happens when there is no space left for adding more subsequences to an iSAX index?How iSAX is constructedHow iSAX is searchedPromotion strategySplitting nodesManually constructing an iSAX indexUpdating the counting.py utilitySummaryUseful linksExercises
Chapter 4: iSAX – The Implementation
Technical requirementsA quick look at the iSAX Python packageThe class for storing subsequencesThe class for iSAX nodesThe class for entire iSAX indexesExplaining the missing partsExploring the remaining filesThe tools.py fileThe variables.py fileThe sax.py fileUsing the iSAX Python packageReading the iSAX parametersHow to process subsequences to create an iSAX indexCreating our first iSAX indexCounting the subsequences of an iSAX indexHow long does it take to create an iSAX index?Dealing with iSAX overflowsSummaryUseful linksExercises
Chapter 5: Joining and Comparing iSAX Indexes
Technical requirementsHow the sliding window size affects the iSAX construction speedChecking the search speed of iSAX indexesJoining iSAX indexesImplementing the joining of iSAX indexesExplaining the Python codeUsing the Python codeWe have a long list of Euclidean distances, so what?Saving the outputFinding iSAX nodes without a matchWriting Python testsWhat are we going to test?Comparing the number of subsequencesChecking the number of node splitsAll Euclidean distances are 0Running the testsSummaryUseful linksExercises
Chapter 6: Visualizing iSAX Indexes
Technical requirementsStoring an iSAX index in JSON formatDownloading the JavaScript code locallyRunning the code locallyVisualizing an iSAX indexVisualizing iSAX as a treeTrying something radicalMore iSAX index visualizationsUsing icicle plotsVisualizing iSAX as a Collapsible TreeSummaryUseful linksExercises
Chapter 7: Using iSAX to Approximate MPdist
Technical requirementsUnderstanding the Matrix ProfileWhat does the Matrix Profile compute?Manually computing the exact Matrix ProfileComputing the Matrix Profile using iSAXWhat happens if there is not a valid match?Calculating the errorApproximate Matrix Profile implementationComparing the accuracy of two different parameter setsUnderstanding MPdistHow to compute MPdistManually computing MPdistCalculating MPdist using iSAXImplementing the MPdist calculation in PythonUsing the approximate Matrix Profile wayUsing the join of two iSAX indexesUsing the Python codeComparing the accuracy and the speed of the methodsSummaryUseful linksExercises
Chapter 8: Conclusions and Next Steps
Concluding all that we have learned so farOther variations of iSAXInteresting research papers on time seriesInteresting research papers on databasesUseful booksUseful books on databasesBuilding a strong computer science backgroundBooks on UNIX and LinuxBooks on the Python programming languageSummaryUseful linksExercises

Index
Why subscribe?
Other Books You May EnjoyPackt is searching for authors like youShare your thoughtsDownload a free PDF copy of this book

Content preview from Time Series Indexing

BIRMINGHAM—MUMBAI

Time Series Indexing

All rights reserved. No part of this book may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, without the prior written permission of the publisher, except in the case of brief quotations embedded in critical articles or reviews.

Every effort has been made in the preparation of this book to ensure the accuracy of the information presented. However, the information contained in this book is sold without warranty, either express or implied. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Time Series Algorithms Recipes: Implement Machine Learning and Deep Learning Techniques with Python

Publisher Resources

ISBN: 9781838821951

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Time Series Indexing

by Mihalis Tsoukalos

Time Series Indexing

Time Series Indexing

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.