Vinicius Mourão Alves Souza

Vinicius Mourão Alves Souza

Auto-generated profile, based on publicly available information

Vinicius Mourão Alves Souza

Pontíficia Universidade Católica do Paraná (PUCPR)

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2013 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
GBGustavo E. A. P. A. Batista
Gustavo E. A. P. A. Batista
EKEamonn J. Keogh
Eamonn J. Keogh
OTOben Moses Tataw
Oben Moses Tataw
VSVinícius M. A. de Souza
Vinícius M. A. de Souza

1 May 2019 in Information Sciences
Verified
Journal Article
Closed access
APAntonio Rafael Sabino Parmezan
Antonio Rafael Sabino Parmezan
VSVinicius M.A. Souza
Vinicius M.A. Souza
GBGustavo E.A.P.A. Batista
Gustavo E.A.P.A. Batista

7 July 2020 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
VSVinicius M. A. Souza
Vinicius M. A. Souza
DRDenis M. dos Reis
Denis M. dos Reis
AMAndré G. Maletzke
André G. Maletzke
GBGustavo E. A. P. A. Batista
Gustavo E. A. P. A. Batista

22 August 2023 in Big Data Research
Verified
Journal Article
Closed access
FLFelipe Tomazelli Lima
Felipe Tomazelli Lima
VSVinicius M.A. Souza
Vinicius M.A. Souza

30 June 2015
Verified
Conference Paper
Closed access
VSVinícius M. A. Souza
Vinícius M. A. Souza
DSDiego F. Silva
Diego F. Silva
João GamaJoão Gama
João Gama
GBGustavo E. A. P. A. Batista
Gustavo E. A. P. A. Batista
Data stream classification algorithms for nonstationary environments frequently assume the availability of class labels, instantly or with some lag after the classification. However, certain applications, mainly those related to sensors and robotics, involve high costs to obtain new labels during the classification phase. Such a scenario in which the actual labels of processed data are never available is called extreme verification latency. Extreme verification latency requires new classification methods capable of adapting to possible changes over time without external supervision. This paper presents a fast, simple, intuitive and accurate algorithm to classify nonstationary data streams in an extreme verification latency scenario, namely Stream Classification Algorithm Guided by Clustering – SCARGC. Our method consists of a clustering followed by a classification step applied repeatedly in a closed loop fashion. We show in several classification tasks evaluated in synthetic and real data that our method is faster and more accurate than the state-of-the-art.

1 December 2013
Verified
Conference Paper
Closed access
DSDiego F. Silva
Diego F. Silva
VSVinicius M.A. De Souza
Vinicius M.A. De Souza
GBGustavo E.A.P.A. Batista
Gustavo E.A.P.A. Batista
There is a huge increase of interest for time series methods and techniques. Virtually every piece of information collected from human, natural, and biological processes is susceptible to changes over time, and the study of how these changes occur is a central issue in fully understanding such processes. Among all time series mining tasks, classification is likely to be the most prominent one. In time series classification there is a significant body of empirical research that indicates that k-nearest neighbor rule in the time domain is very effective. However, certain time series features are not easily identified in this domain and a change in representation may reveal some significant and unknown features. In this work, we propose the use of recurrence plots as representation domain for time series classification. Our approach measures the similarity between recurrence plots using Campana-Keogh (CK-1) distance, a Kolmogorov complexity-based distance that uses video compression algorithms to estimate image similarity. We show that recurrence plots allied to CK-1 distance lead to significant improvements in accuracy rates compared to Euclidean distance and Dynamic Time Warping in several data sets. Although recurrence plots cannot provide the best accuracy rates for all data sets, we demonstrate that we can predict ahead of time that our method will outperform the time representation with Euclidean and Dynamic Time Warping distances.