Brazil

My presentation is about my solution to this year&#39;s KDD competition. There I cover the models, the methods of feature selection, validation, parameters optimization and also my final ensemble.

BRACIS 2020

Solution KDD BR Competition 2020

solution

competition

The 9th Brazilian Conference on Intelligent Systems (BRACIS), the 16h Encontro Nacional de Inteligência Artificial e Computacional (ENIAC), and the 12th Concurso de Teses e Dissertações em Inteligência Artificial e Computacional (CTDIAC) was held from 20 to 23 October, 2020.

BRACIS originated from the combination of the two most important scientific events in Brazil in Artificial Intelligence (AI) and Computational Intelligence (CI): the Brazilian Symposium on Artificial Intelligence - SBIA (22 editions), and the Brazilian Symposium on Neural Networks - SBRN (13 editions). ENIAC is a national forum for researchers, practitioners, educators and students to present and discuss innovations, trends, experiences, developments and work in progress in the fields of Artificial and Computational Intelligence. CTDIAC is a satellite event whose goals are to disseminate and award the best dissertations and theses (MSc and PhDs concluded in Brazilian universities from June 2018 to May 2020) in Artificial and Computational Intelligence areas.

In this year, the Symposium on Knowledge Discovery, Mining and Learning (KDMiLe) will be held in conjunction with BRACIS 2020. This sysposium aims at integrating researchers, practitioners, developers, students and users to present their research results, to discuss ideas, and to exchange techniques, tools, and practical experiences – related to the Data Mining and Machine Learning areas.

My presentation is about my solution to this year's KDD competition. There I cover the models, the methods of feature selection, validation, parameters optimization and also my final ensemble.

technical paper

One of the main challenges for cell segmentation is to separate overlapping cells, which is also a challenging task for cytologists. Here we propose a method that combines different algorithms for cervical cell segmentation of Pap smear images and searches for the best result underlying the maximization of a similarity coefficient. We carried out experiments with three state-of-the-art segmentation algorithms on images with clumps of cervical cells. We extracted features such as coefficient of variation and overlapping ratios for each cell grouping and selected the most appropriate algorithm to segment each cell clump. For decision criterion, we identified the cell clumps of the training dataset and calculated the mentioned features. We segmented each clump by the algorithms and reckoned the Dice measure from each segmentation. Finally, we used the kNN classifier to predict the best algorithm among neighboring k-clumps by choosing the one with the largest number of wins. We validated our proposal on multifocal cervical cell images and obtained an average Dice around 76.6% without using a threshold value. These results demonstrated that the proposed ensemble of segmentation algorithms is promising and suitable for cervical cell image segmentation.

Ensemble of algorithms for multifocal cervical cell image segmentation

Data augmentation is a widely adopted method for improving model performance in image classification tasks. Although it still not as ubiquitous in Natural Language Processing (NLP) community, some methods have already been proposed to increase the amount of training data using simple text transformations or text generation through language models. However, recent text classification tasks need to deal with domains characterized by a small amount of text and informal writing, e.g., Online Social Networks content, reducing the capabilities of current methods. Facing these challenges by taking advantage of the pre-trained language models, low computational resource consumption, and model compression, we proposed the PRE-trained Data AugmenTOR (PREDATOR) method. Our data augmentation method is composed of two modules: the Generator, which synthesizes new samples grounded on a lightweight model, and the Filter, that selects only the high-quality ones. The experiments comparing Bidirectional Encoder Representations from Transformer (BERT), Convolutional Neural Networks (CNN), Long Short-Term Memory (LSTM) and Multinomial Naive Bayes (NB) in three datasets exposed the effective improvement of accuracy. It was obtained 28.5% of accuracy improvement with LSTM on the best scenario and an average improvement of 8% across all scenarios. PREDATOR was able to augment real-world social media datasets and other domains, overcoming the recent text augmentation techniques.

Pre-trained Data Augmentation for Text Classification

In Natural Language Processing, stance detection is the computational task of deciding whether a piece of text expresses a favourable or unfavourable attitude (or stance) towards a given topic. Stance detection may be divided into two subtasks: deciding whether a piece of text conveys any stance towards the target topic and, once we have established that the text does convey a stance, determining its polarity (e.g., favourable or unfavourable) towards the target. Both tasks - hereby called stance recognition and (stance) polarity classification - are the focus of the present work. Taking as a basis a corpus of 13.7k tweets in the Brazilian Portuguese language, and which conveys stances towards five moral issues (abortion legislation, death penalty, drug legalisation, lowering of criminal age, and racial quotas at universities), we compare a number of long short-term memory (LSTM) and bidirectional LSTM (BiLSTM) models for stance recognition and polarity classification. In doing so, the two tasks are addressed both independently and as a joint model. Results suggest that the use of BiLSTM models with attention mechanism outperform the alternatives under consideration, and pave the way for more comprehensive studies in this domain.

Twitter Moral Stance Classification using Long Short-Term Memory Networks

O vídeo descreve o desafio da competição KDD-BR 2020, que trata da predição de períodos de indisponibilidade de aluguel de carros. Ele foi elaborado pela equipe de Ciência de Dados da empresa Localiza, que foi a proponente do problema.

KDD-BR: apresentação do problema pela empresa Localiza

KDD-BR 2020 solution using 1-dimensional convolutions.

Car availability prediction in rental angencies [KDD-BR 2020]

As commodities milho e soja são produtos consumidos em grande escala no mundo. As flutuações nos preços de mercado têm efeitos de longo alcance sobre os consumidores, agricultores e processadores de grãos. Assim, a previsão dos preços desses grãos tem atraído significativa atenção dos pesquisadores. Os modelos de previsão geralmente usam dados quantitativos de série temporal. No entanto, fatores qualitativos externos podem influenciar os dados em séries temporais, como eventos políticos, crises econômicas e o mercado de câmbio estrangeiro. Essas informações não são explícitas nos dados da série temporal e esses fatores podem influenciar a previsão dos valores das variáveis. Os dados textuais extraídos de notícias, fóruns e redes sociais podem ser uma fonte de conhecimento sobre fatores externos e potencialmente úteis para modelos de previsão de séries temporais. Alguns estudos apresentam técnicas de mineração de texto para combinar dados textuais com séries temporais. Porém, as representações existentes apresentam algumas limitações, como a maldição da dimensionalidade e atributos ineficazes. Este trabalho aplica métodos de pré-processamento em séries temporais e usa representações combinadas com dados textuais para prever o preço futuro do milho e da soja. Os resultados indicam que os métodos utilizados podem ser uma alternativa para melhorar o desempenho de previsão em tarefas de regressão.

Solution KDD BR Competition 2020

Downloads

Next from BRACIS 2020

Ensemble of algorithms for multifocal cervical cell image segmentation

Similar lecture

Car availability prediction in rental angencies [KDD-BR 2020]

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Solution KDD BR Competition 2020

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from BRACIS 2020

Ensemble of algorithms for multifocal cervical cell image segmentation

Similar lecture

Car availability prediction in rental angencies [KDD-BR 2020]

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads