Defesa de Disserta\u00e7\u00e3o de Mestrado do Riccardo Campisano. O trabalho \u00e9 intitulado “Sequence Mining in Spatial-Time Series” e \u00e9 orientado pelo professores Eduardo Ogasawara (CEFET\/RJ) e coorientado pelo Prof. Florent Masseglia (INRIA \/ LIRMM). A defesa ocorrer\u00e1 no audit\u00f3rio V no dia 7 de julho de 2017 \u00e0s 9h e ser\u00e1 toda em Ingl\u00eas.<\/p>\n
Al\u00e9m dos orientadores, a banca \u00e9 formada pelos seguintes professores:
\nEsther Pacitti (INRIA \/ LIRMM)
\nFabio Porto (LNCC)
\nDiego Carvalho (CEFET\/RJ)<\/p>\n
Abstract<\/strong> Defesa de Disserta\u00e7\u00e3o de Mestrado do Riccardo Campisano. O trabalho \u00e9 intitulado “Sequence Mining in Spatial-Time Series” e \u00e9 orientado pelo professores Eduardo Ogasawara (CEFET\/RJ) e coorientado pelo Prof. Florent Masseglia (INRIA \/ LIRMM). A defesa ocorrer\u00e1 no audit\u00f3rio V no dia 7 de julho de 2017 \u00e0s 9h e ser\u00e1 toda em Ingl\u00eas. Al\u00e9m […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[],"class_list":["post-2475","post","type-post","status-publish","format-standard","hentry","category-noticias","entry"],"_links":{"self":[{"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/posts\/2475","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/comments?post=2475"}],"version-history":[{"count":1,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/posts\/2475\/revisions"}],"predecessor-version":[{"id":2476,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/posts\/2475\/revisions\/2476"}],"wp:attachment":[{"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/media?parent=2475"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/categories?post=2475"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/portal\/wp-json\/wp\/v2\/tags?post=2475"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nThe problem of discovering sequential patterns in large datasets affects a wide range of scientific and industrial applications. In a growing number of applications, data are collected as spatio-temporal sequences that associate to each item in the sequence a time and a spatial position. This leads to an appealing new challenge for this domain: find, with the same process: i) frequent sequences constrained in space and time that may not be frequent in the entire dataset and ii) the time interval and space range where these sequences are frequent. The discovery of such patterns along with their constraints may lead to extract important knowledge that can remain hidden using traditional methods since their support is extremely low over the entire dataset. We introduce a new Spatio-Temporal Sequence Miner<\/em> (STSM) algorithm for such purpose. STSM is based on our novel sequential pattern mining principle in order to detect spatial ranges where sequences are frequent. Next, it composes all detected sequences inside each range to discover the ones constrained in space and time where these sequences are frequent. Even though our solution is generic, we evaluate STSM on a seismic use case and illustrate its ability to detect frequent sequences constrained in space and time. We managed to identify 1,500 constrained sequences under high support threshold, which would not have been found using current techniques. Moreover, the identified sequences from STSM correspond to candidate areas for seismic horizons and bright spots that are of high value for domain experts. To the best of our knowledge, this is the first solution to tackle the problem of identifying frequent sequences constrained in space and time.<\/p>\n","protected":false},"excerpt":{"rendered":"