Brazil

Classification is an essential task in the field of MachineLearning, where developing a classifier that minimizes errors on unknown data is one of its central problems. It is known that the analytic centeris a good approximation of the center of mass of the version space that is consistent with the Bayes-optimal decision surface. Therefore, in this work, we propose an evolutionary algorithm, relying on the convexity properties of the version space, that evolves a population of perceptron classifiers in order to find a solution that approximates its analytic cen-ter. Hyperspherical coordinates are used to guarantee feasibility when generating new individuals and enabling exploration to be uniformly distributed through the search space. To evaluate the individuals we consider using a potential function that employs a logarithmic barrier penalty. Experiments were performed on real datasets, and the obtained results indicate concrete possibilities for applying the proposed algorithm for solving practical problems.

BRACIS 2020

An Evolutionary Analytic Center Classifier

analytic center

evolutionary algorithm

machine learning

## Welcome to NAACL 2022!
The Annual Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL) is taking place July 10-15, 2022 as a hybrid event, in Seattle, WA and online. We are happy to welcome all of you to conference! 
 
The main conference program features oral presentations, in-person and virtual posters and demo sessions, a plenary session for our best paper presentations and awards, keynote presentations, a plenary panel on the place of linguistics and symbolic structures in NLP, and an Industrial Track panel on Careers in NLP.
 
Posters (including Findings of NAACL 2022) and demos are grouped by areas for both the in-person and the virtual sessions. For the virtual component, the talks will be on Zoom and the posters and the demos will be in GatherTown. The Student Research Workshop and will have an oral session and a poster session.
 
The program also features 6 Tutorials and 26 Workshops.
 
 We wish you a wonderful conference!
 
[The NAACL 2022 Organizing Committee](https://2022.naacl.org/committees/organization/)

NAACL 2022

2022 Annual Conference of the North American Chapter of the Association for Computational Linguistics

technical paper

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.

In the Multi-Agent Pickup and Delivery (MAPD) problem, agents must process a sequence of tasks that may appear in the system in different time-steps. Commonly, this problem has two parts: (i) task allocation, where the agent receives the appropriate task, and (ii) path planning, where the best path for the agent to perform its task, without colliding with other agents, is defined. In this work, we propose an integer-encoded genetic algorithm for solving the task allocation part of the MAPD problem combined with two-path planning algorithms already known in the literature: the Prioritized Planning and the Improved Conflict-Based Search (ICBS). Computational experiments were carried out with different numbers of agents and the frequency of tasks. The results show that the proposed approach achieves better results for large instances when compared to another technique from the literature.

Solving Multi-Agent Pickup and Delivery Problems Using a Genetic Algorithm

Basically, the presentation consists of contextualizing and motivating the work done, describing the objectives and contributions. Then, the methodology is approached together with some comparisons with the related works. Next, the experiments and results are commented with a brief discussion. By the end, the conclusion and future work are presented. Finally, a short video is presented showing the performance of the best agent of our work.

Improving FIFA Player Agents Decision-Making Architectures based on Convolutional Neural Networks through Evolutionary Techniques

Among the existing techniques to improve the performance of metaheuristics in optimization problems, adaptive parameter control consists in varying one or more parameters of a given metaheuristic according to some indicator of the search conditions. This approach allows metaheuristics to change algorithmic behaviour during the search, and is particularly relevant for the optimization of dynamic problems. In this research we theoretically analyse in which ways the parameters of the ant colony optimization for continuous domains metaheuristic can be adapted, regarding how each parameter influences exploration and exploitation characteristics of the algorithm. Our experimental contributions include validating the colony success rate as a search condition estimator and choosing suitable maps from this estimator to the parameters q and ksi of the algorithm. Beyond that, we compare the performances of three proposed adaptive versions of the base metaheuristic and show the benefits of simultaneously adapting multiple parameters.

On the Multiple Possible Adaptive Mechanisms of the Continuous Ant Colony Optimization

In this paper, we evaluated the Knowledge Base building of Fuzzy Rule-Based Classification Systems (FRBCS) with the purpose of find a balance between the accuracy and interpretability objectives. Regarding to build, we compared two well-known algorithms: Wang-Mendel, to generate the rule base, and NSGA-II, to learn the rules and tuning the membership functions. The Wang-Mendel algorithm was also used to introduce a seed in NSGA-II initial population, in order to increase its quality and improve convergence speed. Taking into account that the automatic building of the fuzzy systems knowledge base is challenger, because of the amount of data available in several real problems, we analysed the impact of data reduction on it. The experiments were carried out with 23 datasets divided into small and medium-large size, and the results showed that the use of genetic learning is suitable to large datasets as well as data reduction, improving the accuracy and interpretability of the FRBCS arising.

Genetic Learning Analysis of Fuzzy Rule-Based Classifications Systems considering Data Reduction

Forecasting photovoltaic (PV) power generation, as in many other time series scenarios, is a challenging task. Most current solutions for time series forecasting are grounded on Machine Learning (ML) algorithms, which usually outperform statistical-based methods. However, solutions based on ML and, more recently, Deep Learning (DL) have been found vulnerable to adversarial attacks throughout their execution. With this in mind, in this work we explore four time series analysis techniques, namely Naive, a baseline technique for time series, Autoregressive Integrated Moving Average (ARIMA), from the statistical field, and Long Short-term Memory (LSTM) and Temporal Convolutional Network (TCN), from the DL family. These techniques are used to forecast the power generation of a PV power plant 15 minutes and 24 hours ahead, having as input only power generation historical data. Two main aspects were analyzed: i) how training size influenced the performance of the forecasting models and ii) how univariate time series data could be modified by an adversarial attack to decrease models' performance through cross-technique transferability. For i), the mentioned methods were used and evaluated with monthly updates. For ii), Fast Gradient Sign Method (FGSM), along with a logistic regression substitute model and past data, were used to perform attacks against DL models at test time. LSTM and TCN decreased the error as the training sample size increased and outperformed Naive and ARIMA models. Adversarial samples were able to reduce the performance of LSTM and TCN, particularly for short-term forecasts.

Photovoltaic Generation Forecast: Model Training and Adversarial Attack Aspects

Word segmentation can contribute to improve the results of natural language processing tasks on several problem domains, including social media sentiment analysis, source code summarization and neural machine translation. Taking the English language as a case study, we fine-tune a Transformer architecture which has been trained through the Pre-trained Distillation (PD) algorithm, while comparing it to previous experiments with recurrent neural networks. We organize datasets and resources from multiple application domains under a unified format, and demonstrate that our proposed architecture has competitive performance and superior cross-domain generalization in comparison with previous approaches for word segmentation in Western languages.

Domain Adaptation of Transformers for English Word Segmentation

Restoring corrupted images represent a challenge to computer vision and image processing based on machine learning. In hazy, underwater and medical images the lack of paired images lead the authors to synthesize datasets and the Generative Adversarial Networks (GANs) are widely used. However, computational cost and training instability are current concerns. We present an unsupervised learning algorithm that does not requires paired dataset to train encoder-decoder-like neu-
ral network for image restoration. An encoder-decoder learn to represent
its input data in a latent representation and reconstruct then in the output. During the training stage, our algorithm applies the encoder-decoder output image to a degradation block that reinforces its degradation. The degraded and input images are matched using a loss function. After the training process, we obtain a restored image from the decoder. We used ill-exposed images to evaluate and validate our algorithm.

Unsupervised Learning Method for Encoder-Decoder-Based Image Restoration

Word embeddings is a text representation technique capable of capturing syntactic and semantic linguistic patterns and of representing each word as an n-dimensional dense vector. In the domain of legal texts, there are trained word embeddings in languages like English, Polish, and Chinese. However, to the best of our knowledge, there are no embeddings based on Portuguese (Brazilian and European) legal texts. Given that, our research question is: does the specificity and size of the text corpus used for a word embedding training contribute to a more successful classification? To answer the question, we train word embeddings models in the legal domain with different levels of specificity and size. Then we evaluate their impact on text classification. To deal with the different levels of specificity, we collect text documents from different courts of the Brazilian Judiciary, in hierarchical order. We used these text corpora to train a word embeddings model (GloVe) and then had then evaluated while classifying processes with a deep learning model (CNN). In a context perspective, the results show that in word embeddings trained on smaller corpora sizes, text specificity has a higher impact than for large sizes. Also, in a corpus size perspective, the results demonstrate that the greater the corpus size in embeddings training, the better are the results. However, this impact decreases as the corpus size increases until a point where more words in the corpus have little impact on the results.

Impact of Text Specificity and Size on Word Embeddings Performance: an Empirical Evaluation in Brazilian Legal Domain

An important challenge in the research field of Biometrics isreal-time identification, at a distance, in uncontrolled environments, us-ing low-resolution cameras. In such circumstances, soft biometrics can bethe only option. In this work, we propose two novel descriptor methodsfor biometric identification based on ensemble of anthropometric mea-surements and joints heat-map of the person skeleton, captured fromvideo frames through state-of-the-art 2D poses estimation methods. Theproposed methods were assessed on a popular benchmark dataset, CA-SIA Gait Dataset B, and obtained good results (85% and 89% of rank-1identification rates, respectively) with PifPaf 2D pose estimation method

People Identification Based on Soft BiometricsFeatures Obtained from 2D Poses

Colorectal cancer causes the deaths of thousands of people worldwide according to the World Health Organization. Automatic tissue recognition of histopathological images is essential for early disease diagnosis. Most research consists of employing texture descriptors to capture features that identify tumor samples. However, accurate multi-class classification is a challenge due to the complexity of colorectal tissue images. Recently, researchers have shown that the analysis of texture structural patterns degraded by image filtering provides valuable features for pre-diagnosis in several medical applications. Here we propose an approach to automatically classify eight types of colorectal tissues using Structural Co-occurrence Matrix. We carried on experiments on 5000 tissue patches from a public dataset to evaluate our algorithm, considering two scenarios: structural differences as a single descriptor, and combined with other characteristics. We found that our strategy improves the stateof-the-art, achieving, accuracy: 91.30%, precision: 91.41%, sensitivity: 91.31%, specificity: 98.76% e F1-score: 91.31%.

An Evolutionary Analytic Center Classifier

Downloads

Next from BRACIS 2020

Solving Multi-Agent Pickup and Delivery Problems Using a Genetic Algorithm

Similar lecture

LT3 at SemEval-2022 Task 6: Fuzzy-Rough Nearest Neighbor Classification for Sarcasm Detection

An Evolutionary Analytic Center Classifier

.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

Solving Multi-Agent Pickup and Delivery Problems Using a Genetic Algorithm

Similar lecture

LT3 at SemEval-2022 Task 6: Fuzzy-Rough Nearest Neighbor Classification for Sarcasm Detection

Downloads