loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Daniel Y. T. Chino 1 ; Renata R. V. Gonçalves 2 ; Luciana A. S. Romani 3 ; Caetano Traina Jr. 1 and Agma J. M. Traina 1

Affiliations: 1 University of São Paulo, Brazil ; 2 Cepagri-Unicamp, Brazil ; 3 Embrapa Agriculture Informatics, Brazil

Keyword(s): Time Series, Frequent K-Motif, AVHRR-NOAA Images.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Data Mining ; Databases and Information Systems Integration ; Enterprise Information Systems ; Sensor Networks ; Signal Processing ; Soft Computing

Abstract: Finding previously unknown patterns that frequently occur on time series is a core task of mining time series. These patterns are known as time series motifs and are essential to associate events and meaningful occurrences within the time series. In this work we propose a method based on a trie data structure, that allows a fast and accurate time series motif discovery. From the experiments performed on synthetic and real data we can see that our TrieMotif approach is able to efficiently find motifs even when the size of the time series goes longer, being in average 3 times faster and requiring 10 times less memory than the state of the art approach. As a case study on real data, we also evaluated our method using time series extracted from remote sensing images regarding sugarcane crops. Our proposed method was able to find relevant patterns, as sugarcane cycles and other land covers inside the same area.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.117.94.77

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Chino, D.; Gonçalves, R.; Romani, L.; Traina Jr., C. and Traina, A. (2014). TrieMotif - A New and Efficient Method to Mine Frequent K-Motifs from Large Time Series. In Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS; ISBN 978-989-758-027-7; ISSN 2184-4992, SciTePress, pages 60-69. DOI: 10.5220/0004891900600069

@conference{iceis14,
author={Daniel Y. T. Chino. and Renata R. V. Gon\c{C}alves. and Luciana A. S. Romani. and Caetano {Traina Jr.}. and Agma J. M. Traina.},
title={TrieMotif - A New and Efficient Method to Mine Frequent K-Motifs from Large Time Series},
booktitle={Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS},
year={2014},
pages={60-69},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004891900600069},
isbn={978-989-758-027-7},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS
TI - TrieMotif - A New and Efficient Method to Mine Frequent K-Motifs from Large Time Series
SN - 978-989-758-027-7
IS - 2184-4992
AU - Chino, D.
AU - Gonçalves, R.
AU - Romani, L.
AU - Traina Jr., C.
AU - Traina, A.
PY - 2014
SP - 60
EP - 69
DO - 10.5220/0004891900600069
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic