Assessing pattern recognition or labeling in streams of temporal data. Marteau, P. In 2nd ECML/PKDD Workshop on Advanced Analytics and Learning on Temporal Data, Riva del Garda, Italy, 2016. Paper bibtex @InProceedings{Marteau2016b,
author = {Marteau, Pierre-Fran{\c c}ois},
title = {{Assessing pattern recognition or labeling in streams of temporal data}},
booktitle = {{2nd ECML/PKDD Workshop on Advanced Analytics and Learning on Temporal Data}},
year = {2016},
address = {Riva del Garda, Italy},
month = Sep,
file = {streamLabellingAssessment-hal.pdf:https\://hal.archives-ouvertes.fr/hal-01403948/file/streamLabellingAssessment-hal.pdf:PDF},
keywords = { sequential data ; automatic labelling assessment ; assessment measure ; dynamic programming ; temporal data },
review = {This algorithm determines if two time-series data streams are similar by using adopting a word edit approach via dynamic programming. Assuming the data has already been segmented and labelled, the distance between the two data streams are calculated by assigning a penalty value if primitives match (ie segment i from stream 1 and segment j from stream 2 overlap), have been inserted, or deleted. A distance matrix can be constructed between the first i^th segment of stream 1, and the first j^th segment of stream 2, via dynamic programming and the shortest path is taken.},
timestamp = {2017-06-03},
url = {https://hal.archives-ouvertes.fr/hal-01403948},
}
Downloads: 0
{"_id":"wohwXDJyfkkbZqDjC","bibbaseid":"marteau-assessingpatternrecognitionorlabelinginstreamsoftemporaldata-2016","downloads":0,"creationDate":"2017-09-14T16:34:37.297Z","title":"Assessing pattern recognition or labeling in streams of temporal data","author_short":["Marteau, P."],"year":2016,"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/jfslin/jfslin.github.io/master/jf2lin.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Marteau"],"firstnames":["Pierre-Fran ̧cois"],"suffixes":[]}],"title":"Assessing pattern recognition or labeling in streams of temporal data","booktitle":"2nd ECML/PKDD Workshop on Advanced Analytics and Learning on Temporal Data","year":"2016","address":"Riva del Garda, Italy","month":null,"file":"streamLabellingAssessment-hal.pdf:https\\://hal.archives-ouvertes.fr/hal-01403948/file/streamLabellingAssessment-hal.pdf:PDF","keywords":"sequential data ; automatic labelling assessment ; assessment measure ; dynamic programming ; temporal data ","review":"This algorithm determines if two time-series data streams are similar by using adopting a word edit approach via dynamic programming. Assuming the data has already been segmented and labelled, the distance between the two data streams are calculated by assigning a penalty value if primitives match (ie segment i from stream 1 and segment j from stream 2 overlap), have been inserted, or deleted. A distance matrix can be constructed between the first i^th segment of stream 1, and the first j^th segment of stream 2, via dynamic programming and the shortest path is taken.","timestamp":"2017-06-03","url":"https://hal.archives-ouvertes.fr/hal-01403948","bibtex":"@InProceedings{Marteau2016b,\n author = {Marteau, Pierre-Fran{\\c c}ois},\n title = {{Assessing pattern recognition or labeling in streams of temporal data}},\n booktitle = {{2nd ECML/PKDD Workshop on Advanced Analytics and Learning on Temporal Data}},\n year = {2016},\n address = {Riva del Garda, Italy},\n month = Sep,\n file = {streamLabellingAssessment-hal.pdf:https\\://hal.archives-ouvertes.fr/hal-01403948/file/streamLabellingAssessment-hal.pdf:PDF},\n keywords = { sequential data ; automatic labelling assessment ; assessment measure ; dynamic programming ; temporal data },\n review = {This algorithm determines if two time-series data streams are similar by using adopting a word edit approach via dynamic programming. Assuming the data has already been segmented and labelled, the distance between the two data streams are calculated by assigning a penalty value if primitives match (ie segment i from stream 1 and segment j from stream 2 overlap), have been inserted, or deleted. A distance matrix can be constructed between the first i^th segment of stream 1, and the first j^th segment of stream 2, via dynamic programming and the shortest path is taken.},\n timestamp = {2017-06-03},\n url = {https://hal.archives-ouvertes.fr/hal-01403948},\n}\n\n","author_short":["Marteau, P."],"key":"Marteau2016b","id":"Marteau2016b","bibbaseid":"marteau-assessingpatternrecognitionorlabelinginstreamsoftemporaldata-2016","role":"author","urls":{"Paper":"https://hal.archives-ouvertes.fr/hal-01403948"},"keyword":["sequential data ; automatic labelling assessment ; assessment measure ; dynamic programming ; temporal data"],"downloads":0},"search_terms":["assessing","pattern","recognition","labeling","streams","temporal","data","marteau"],"keywords":["sequential data ; automatic labelling assessment ; assessment measure ; dynamic programming ; temporal data"],"authorIDs":[],"dataSources":["iCsmKnycRmHPxmhBd"]}