How to measaure the similarity between two series? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) 2019 Moderator Election Q&A - Questionnaire 2019 Community Moderator Election ResultsR: Comparing dissimilarity between metabolic models with discrete wavelet transformationDefinition - center of the cluster with non-Euclidean distanceEuclidean distance between time series in PythonRNN unable to classify time seriesclustering 2-dimensional euclidean vectors - appropriate dissimilarity measureSliding cross-correlationSimilarity measure before and after dimensionality reduction or clusteringQuantify similarity between 2 multivariate time series samplesClustering time series based on monotonic similarityMatch a two items from two different receipts

Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?

After Sam didn't return home in the end, were he and Al still friends?

Is CEO the "profession" with the most psychopaths?

What is the "studentd" process?

What does Turing mean by this statement?

How would you say "es muy psicólogo"?

What is the difference between CTSS and ITS?

What does 丫 mean? 丫是什么意思?

Why complex landing gears are used instead of simple,reliability and light weight muscle wire or shape memory alloys?

License to disallow distribution in closed source software, but allow exceptions made by owner?

Show current row "win streak"

How does the math work when buying airline miles?

Why is a lens darker than other ones when applying the same settings?

What adaptations would allow standard fantasy dwarves to survive in the desert?

Why are vacuum tubes still used in amateur radios?

What is the origin of 落第?

How to force a browser when connecting to a specific domain to be https only using only the client machine?

What does it mean that physics no longer uses mechanical models to describe phenomena?

Tips to organize LaTeX presentations for a semester

two integers one line calculator

NERDTreeMenu Remapping

Does the Black Tentacles spell do damage twice at the start of turn to an already restrained creature?

Would color changing eyes affect vision?

Understanding p-Values using an example



How to measaure the similarity between two series?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
2019 Moderator Election Q&A - Questionnaire
2019 Community Moderator Election ResultsR: Comparing dissimilarity between metabolic models with discrete wavelet transformationDefinition - center of the cluster with non-Euclidean distanceEuclidean distance between time series in PythonRNN unable to classify time seriesclustering 2-dimensional euclidean vectors - appropriate dissimilarity measureSliding cross-correlationSimilarity measure before and after dimensionality reduction or clusteringQuantify similarity between 2 multivariate time series samplesClustering time series based on monotonic similarityMatch a two items from two different receipts










1












$begingroup$


I'm confused about how to measure the similarity between two time series with the same length. For example, both time series are 2 hours in length and every 5 minutes a point. I really want to know which Distance Algorithm should I use. I have tried the Euclidean Distance but it didn't work well on this type of data. Should I find some point-to-point distance algorithms?










share|improve this question









$endgroup$











  • $begingroup$
    You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
    $endgroup$
    – Allerleirauh
    Apr 4 at 9:02










  • $begingroup$
    It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
    $endgroup$
    – Eamonn Keogh
    Apr 4 at 17:33















1












$begingroup$


I'm confused about how to measure the similarity between two time series with the same length. For example, both time series are 2 hours in length and every 5 minutes a point. I really want to know which Distance Algorithm should I use. I have tried the Euclidean Distance but it didn't work well on this type of data. Should I find some point-to-point distance algorithms?










share|improve this question









$endgroup$











  • $begingroup$
    You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
    $endgroup$
    – Allerleirauh
    Apr 4 at 9:02










  • $begingroup$
    It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
    $endgroup$
    – Eamonn Keogh
    Apr 4 at 17:33













1












1








1





$begingroup$


I'm confused about how to measure the similarity between two time series with the same length. For example, both time series are 2 hours in length and every 5 minutes a point. I really want to know which Distance Algorithm should I use. I have tried the Euclidean Distance but it didn't work well on this type of data. Should I find some point-to-point distance algorithms?










share|improve this question









$endgroup$




I'm confused about how to measure the similarity between two time series with the same length. For example, both time series are 2 hours in length and every 5 minutes a point. I really want to know which Distance Algorithm should I use. I have tried the Euclidean Distance but it didn't work well on this type of data. Should I find some point-to-point distance algorithms?







time-series similarity distance






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Apr 4 at 8:42









mister leemister lee

61




61











  • $begingroup$
    You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
    $endgroup$
    – Allerleirauh
    Apr 4 at 9:02










  • $begingroup$
    It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
    $endgroup$
    – Eamonn Keogh
    Apr 4 at 17:33
















  • $begingroup$
    You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
    $endgroup$
    – Allerleirauh
    Apr 4 at 9:02










  • $begingroup$
    It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
    $endgroup$
    – Eamonn Keogh
    Apr 4 at 17:33















$begingroup$
You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
$endgroup$
– Allerleirauh
Apr 4 at 9:02




$begingroup$
You can search the asked and now answered questions with the search bar up on this site. For example "distance time series" gives a variety of ideas, how to measure. Maybe this question on stackoverflow gives you more ideas how to define your distance. And if you are there now, you can find a lot of answered questions related, if you use the search too. I hope you find something that fits to your problem. If you have questions, that are not to find in this searches, you are welcome to ask again :)
$endgroup$
– Allerleirauh
Apr 4 at 9:02












$begingroup$
It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
$endgroup$
– Eamonn Keogh
Apr 4 at 17:33




$begingroup$
It is not possible to answer your question, unless you show examples of the time series. To answer the question, we need to know the invarances needed, for example...warping, uniform scaling, offset, amplitude scaling, phase, occlusions, uncertainty and wandering baseline [a]. [a] cs.ucr.edu/~eamonn/… [b] cs.unm.edu/~mueen/DTW.pdf
$endgroup$
– Eamonn Keogh
Apr 4 at 17:33










1 Answer
1






active

oldest

votes


















2












$begingroup$

A classical approach for time series similarity computation is Dynamic Time Warping (DTW).



From your description, it may suit your use case:




In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules:



  • Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa

  • The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match)

  • The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match)

  • The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if $j>i$ are indices from the first sequence, then there must not be two indices $l>k$ in the other sequence, such that index $i$ is matched with index $l$ and index $j$ is matched with index $k$, and vice versa



Some alternatives to DTW can be found in this literature review on time series dissimilarity measures.






share|improve this answer









$endgroup$












  • $begingroup$
    Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
    $endgroup$
    – mister lee
    Apr 5 at 8:14











Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "557"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f48585%2fhow-to-measaure-the-similarity-between-two-series%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

A classical approach for time series similarity computation is Dynamic Time Warping (DTW).



From your description, it may suit your use case:




In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules:



  • Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa

  • The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match)

  • The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match)

  • The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if $j>i$ are indices from the first sequence, then there must not be two indices $l>k$ in the other sequence, such that index $i$ is matched with index $l$ and index $j$ is matched with index $k$, and vice versa



Some alternatives to DTW can be found in this literature review on time series dissimilarity measures.






share|improve this answer









$endgroup$












  • $begingroup$
    Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
    $endgroup$
    – mister lee
    Apr 5 at 8:14















2












$begingroup$

A classical approach for time series similarity computation is Dynamic Time Warping (DTW).



From your description, it may suit your use case:




In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules:



  • Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa

  • The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match)

  • The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match)

  • The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if $j>i$ are indices from the first sequence, then there must not be two indices $l>k$ in the other sequence, such that index $i$ is matched with index $l$ and index $j$ is matched with index $k$, and vice versa



Some alternatives to DTW can be found in this literature review on time series dissimilarity measures.






share|improve this answer









$endgroup$












  • $begingroup$
    Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
    $endgroup$
    – mister lee
    Apr 5 at 8:14













2












2








2





$begingroup$

A classical approach for time series similarity computation is Dynamic Time Warping (DTW).



From your description, it may suit your use case:




In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules:



  • Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa

  • The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match)

  • The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match)

  • The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if $j>i$ are indices from the first sequence, then there must not be two indices $l>k$ in the other sequence, such that index $i$ is matched with index $l$ and index $j$ is matched with index $k$, and vice versa



Some alternatives to DTW can be found in this literature review on time series dissimilarity measures.






share|improve this answer









$endgroup$



A classical approach for time series similarity computation is Dynamic Time Warping (DTW).



From your description, it may suit your use case:




In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules:



  • Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa

  • The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match)

  • The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match)

  • The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if $j>i$ are indices from the first sequence, then there must not be two indices $l>k$ in the other sequence, such that index $i$ is matched with index $l$ and index $j$ is matched with index $k$, and vice versa



Some alternatives to DTW can be found in this literature review on time series dissimilarity measures.







share|improve this answer












share|improve this answer



share|improve this answer










answered Apr 4 at 9:41









ncasasncasas

3,7831132




3,7831132











  • $begingroup$
    Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
    $endgroup$
    – mister lee
    Apr 5 at 8:14
















  • $begingroup$
    Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
    $endgroup$
    – mister lee
    Apr 5 at 8:14















$begingroup$
Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
$endgroup$
– mister lee
Apr 5 at 8:14




$begingroup$
Thanks for answering sincerely. But to be the best of my knowledge, DTW belongs to Elastic Measure. It's suitable for similarity measurement of sequence changes rather than morphology, e.g. it's often used in speech recognition. I only want to compare the vertical distance between two sequences without considering stretch or transformation of the sequences. It could be a point-to-point way of calculating or something. In addition, the time complexity of DTW is very high. Could you know some Lock-step Measures? Thank you.
$endgroup$
– mister lee
Apr 5 at 8:14

















draft saved

draft discarded
















































Thanks for contributing an answer to Data Science Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f48585%2fhow-to-measaure-the-similarity-between-two-series%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Adding axes to figuresAdding axes labels to LaTeX figuresLaTeX equivalent of ConTeXt buffersRotate a node but not its content: the case of the ellipse decorationHow to define the default vertical distance between nodes?TikZ scaling graphic and adjust node position and keep font sizeNumerical conditional within tikz keys?adding axes to shapesAlign axes across subfiguresAdding figures with a certain orderLine up nested tikz enviroments or how to get rid of themAdding axes labels to LaTeX figures

Luettelo Yhdysvaltain laivaston lentotukialuksista Lähteet | Navigointivalikko

Gary (muusikko) Sisällysluettelo Historia | Rockin' High | Lähteet | Aiheesta muualla | NavigointivalikkoInfobox OKTuomas "Gary" Keskinen Ancaran kitaristiksiProjekti Rockin' High