markdregan / k-nearest-neighbors-with-dynamic-time-warping Goto Github PK

Python implementation of KNN and DTW classification algorithm

CSS 0.25% Jupyter Notebook 99.75%

machine-learning timeseries classification-algorithm human-activity-recognition nearest-neighbors dynamic-programming dynamic-time-warping

k-nearest-neighbors-with-dynamic-time-warping's Introduction

K Nearest Neighbors & Dynamic Time Warping

View IPython notebook

When it comes to building a classification algorithm, analysts have a broad range of open source options to choose from. However, for time series classification, there are less out-of-the box solutions.

I began researching the domain of time series classification and was intrigued by a recommended technique called K Nearest Neighbors and Dynamic Time Warping. A meta analysis completed by Mitsa (2010) suggests that when it comes to timeseries classification, 1 Nearest Neighbor (K=1) and Dynamic Timewarping is very difficult to beat [1].

This repo contains a python implementation (and IPython notebook) of KNN & DTW classification algorithm.

The following IPython notebook evaluates the KNN and DTW classifer by using it to classify human activities (sitting, walking, lying) when given timeseries data from a smart phones gyroscope and accelerometer (HAR dataset).

Human Activity Recognition Dataset

The Human Activity Recognition Dataset (HAR) dataset is chosen to test the classification performance of DTW & KNN [3].

The experiments were carried out with a group of 30 volunteers within an age bracket of 19-48 years. Each person performed six activities (walking, walking upstairs, walking downstairs, sitting, standing and laying) wearing a smartphone (Samsung Galaxy S II) on the waist. Using its embedded accelerometer and gyroscope, we captured 3-axial linear acceleration and 3-axial angular velocity at a constant rate of 50Hz. The experiments have been video-recorded to label the data manually.

References

Mitsa (2010). Temporal Data Mining (Chapter on Temporal Classification).
Xi (2006). Fast Time Series Classification Using Numerosity Reduction.
Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra and Jorge L. Reyes-Ortiz. Human Activity Recognition on Smartphones using a Multiclass Hardware-Friendly Support Vector Machine. International Workshop of Ambient Assisted Living (IWAAL 2012). Vitoria-Gasteiz, Spain. Dec 2012. Read Paper

Credit

The progressbar used in the DtwKnn() class was taken from PYMC
The matplotlib style and IPython notebook was taken from Cameron Davidson-Pilon's excelent "Bayesian Methods for Hackers"

k-nearest-neighbors-with-dynamic-time-warping's People

Contributors

Stargazers

Watchers

Forkers

aaronjoel nipunbatra cmiller8 carollimaxp wy36101299 fmailhot zengqiang2006 chadburdyshaw eraldop purnawirman udemirezen madjelan luffly1123 tanghao1987 davenw16hd akansal1 ouxiaogu ricky1203 balajikalluri skywayoo brahmaslee wonyonyon allianzcortex mfcardenas testmana2 dashayushman agangzz ptee lsbdata cuissai02 dylan-fan cattleman bingdian2001 anuragreddygv323 jxlin diegslva iipo6jiema vishalbelsare yccai shiweihappy vsskanand wenchieh lamichhanekamal hiredd kaveenherath rpatil524 jkhlot astroman5516 willsonn gissemari j0k rob-med jamesoneill12 markhyphen jgraving billwiliams haoglehaogle minuteswithmetrics tomfisher cwellszhang jinsolha rickymos denismeia jnfarooq alfredh4869 kapiya jacobwjs jjlwharrison jayjinseokkim dilshanfardil olivergrimes manuelschmidt chenlinholl shidaiwei626 wuzeen yakzan eggpan95 wen-min malibustacy hongminwu direbutterfly shaoniwang tylerwmarrs zxlwrz kormilitzin afcarl franzbischoff tumango thgngu mukami12 fredthedead teppoeva huiw01 firefenta ashwinkumarm luhongkai mathematicator sanqiaiziji iasonastopsis isaacngym

k-nearest-neighbors-with-dynamic-time-warping's Issues

DTW uses feature data instead of raw data

Hi,

Perhaps I'm not understanding your code properly, but I was hoping you could clear some things up. When performing DTW on the dataset you read in data/UCI-HAR-Dataset/train/X_train.txt - This is the feature-engineered dataset, I believe. It contains 561 columns instead of 128, which the README of the data indicates is the number of observations per window.

The part I don't understand is that the features are all dependent on the same observation window. (I checked this by adding an assertion in KnnDtw._dtw_distance()) In that case how can you perform DTW on them when there isn't a time-scale to warp? Or - more likely - am I misunderstanding DTW?

Error in executing KNN+DTW using HAR dataset - Pls help !!!

Hi Mark,

Glad to know you...am NOT a proficient python user however I'm quite familiar in writing and running few scripts in Ipython Notebook. I came across your k-NN+DTW classifier source code which is quite self-explanatory and well written on your Github page - appreciate that.

However, I seek your help in getting started running your demo script with HAR dataset first to gain understanding about implementation of some of your routines.

I encounter an error when reading the datasets at the following lines...

Loop through datasets

for x in x_train_file:
x_train.append([float(ts) for ts in x.split()])

Attached is the snapshot of my error in IPython terminal

Could you pls help me rectify & rerun this without error?

Thanks,
Bala

will it work for  multivariate  time series classification for example mixture of categorical and continues data? 
for example at time t1 we have observation: red, 2.4 , 5, 12.456 and time t2: green, 3.5, 2, 45.78; time t3: black, 5.6, 7, 23.56; t4: red, 2.1, 5, 12.6 ?

import numpy & scipy in knn_dtw_class.py

np.shape & scipy.spatial.distance are being used w/o previous import of those modules.