Brazil

Aggregation functions are employed to combine inputs that are typically interpreted as degrees of membership in fuzzy sets, degrees of preference, strength of evidence or support of a hypothesis. The behavior of each aggregation function can be associated to the area of distributive justice, which refers to fairness in the way data are distributed. Two important theories of distributive justice commonly considered are the utilitarianism and egalitarianism, but some alternative theories, as the sufficientarianism, has gained attention recently. This paper presents three different versions of sufficientarianism as aggregation functions: the weak, axiological and strong sufficientarianism. Additionally, we introduce new logical properties related to the sufficientarianism and show which of these new aggregation functions satisfy them. In particular, we prove the axiological aggregation functions introduced here satisfy an important logical property whereas the weak sufficientarian functions do
not. On the other hand, we also show the strong sufficientarian aggregation
functions may lead to the loss of logical properties.

BRACIS 2020

Aggregation with Weak, Axiological and Strong Sufficientarian Functions

utility theory.

sufficientarianism

aggregation functions

decision making

### Welcome to CogSci Conference 2025!

The 47th Annual Meeting of the Cognitive Science Society was a hybrid meeting held in San Francisco. 

<div style="position:relative;padding-top:0;width:900px;height:500px;"><iframe style="position:absolute;border:none;width:100%;height:100%;left:0;top:0;" src="https://online.fliphtml5.com/ebtyf/amvr/"  seamless="seamless" scrolling="no" frameborder="0" allowtransparency="true" allowfullscreen="true" ></iframe></div>

#### About

The Cognitive Science Society brings together researchers from around the world who hold a common goal: understanding the nature of the human mind. The mission of the Society is to promote Cognitive Science as a discipline, and to foster scientific interchange among researchers in various areas of study, including Artificial Intelligence, Linguistics, Anthropology, Psychology, Neuroscience, Philosophy, and Education.

The Society is a non-profit professional organization and its activities include sponsoring an annual conference and publishing the journals Cognitive Science and TopiCS.

#### Our History 

* **Society Creation**<br>
The Society was incorporated as a 501(c)(3) non-profit professional organization in Massachusetts in 1979. The organizing committee included Roger Schank, Allan Collins, Donald Norman, and a number of other scholars from psychology, linguistics, computer science, and philosophy. 
<br><br>
* **Conference Creation**<br>
The first conference on cognitive science was held at La Jolla, California in August, 1979, and has occurred annually since then. The proceedings of each conference are published, and those from most years are available through Lawrence Erlbaum Associates, Inc. The annual proceedings of the Cognitive Science Conference represent a major source of information on new work and new ideas in the scientific study of thinking. In 1990, the Society, with help from an anonymous donor, established the David Marr Prize for the best student paper at each annual meeting.
<br><br>
* **Journal Creation**<br>
The Journal, Cognitive Science, began publication in 1976, and is now published by Wiley-Blackwell. The Executive Editor is currently Richard P. Cooper of Birkbeck, University of London, and there are 18 Associate Editors and a 30-member editorial board. It serves as the premier outlet for research reports that intersect two or more disciplines. Copyrights for articles published in the journal are held by the Society. The Governing Board of the Cognitive Science Society voted in late 2006 to found a new journal, Topics in Cognitive Science (topiCS). The Editor in Chief is Wayne Gray, Cognitive Science Department, Rensselaer Polytechnic Institute. The journal seeks to fill a niche not occupied by Cognitive Science Journal or other cognitive science journals. Membership in the Society includes a subscription to Cognitive Science and TopiCS. Copyrights for articles published in the journal are held by the Society.
<br><br>

#### Code of Conduct

By attending the CogSci 2025 Conference, you are required to adhere to the society’s **[Code of Conduct](https://drive.google.com/file/d/1ChPuihLy6jE_BWqfO7J2KKgX35JW2zsM/view?usp=sharing)**.
<br><br>


You need to log in with the email address you registered with. 

Login credentials were sent to you from Underline -  subject line "Welcome to the CogSci 2025 Conference". Please be sure to check your spam/promotional inbox  if you do not see an email confirmation right away.





Please log in to join this event.

To access the site, please register [**here**](https://cognitivesciencesociety.org/registration/).

If you are registered and feel like you are seeing this message by mistake, please make sure you are logged in with the same email that you registered with. 

Please register!

CogSci 2025

The 47th Annual Meeting of the Cognitive Science Society presents the latest research across cognitive science and highlights the theme of Cognition in Context.

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.

An ensemble method should cleverly combine a group of base classifiers to yield an improved classifier. The majority vote is an example of a methodology used to combine classifiers in an ensemble method. In this paper, we propose to combine classifiers using an associative memory model. Precisely, we introduce ensemble methods based on recurrent correlation associative memories (RCAMs) for binary classification problems. We show that an RCAM-based ensemble classifier can be viewed as a majority vote classifier whose weights depend on the similarity between the base classifiers and the resulting ensemble method. More precisely, the RCAM-based ensemble combines the classifiers using a recurrent consult and vote scheme. Furthermore, computational experiments confirm the potential application of the RCAM-based ensemble method for binary classification problems.


Ensemble of Binary Classifiers Combined Using Recurrent Correlation Associative Memories

Link prediction is an online social network (OSN) analysis task whose objective is to identify pairs of non-connected nodes that have a high probability of getting connected in the near future. Recently proposed link prediction methods consider topological data from OSN past states (i.e., snapshots that depict the structure of the network at certain moments in the past). Although those past states-based methods retrieve information that describes how the network's topology was at the events of link emergence (i.e., moments when the existing edges were created), they do not take into account contextual data concerning those events. Hence, they take the chance to disregard information about the circumstances that may have influenced the appearance of old edges, and that could be useful to predict the creation of new ones. To remedy this issue, this work extends a past states-based method so that it retrieves both topological and contextual data from the events of edge emergence and combines them to predict links. The extended method presented promising results on experimental data. Overall, it overcame the original method in five different scenarios from five co-authorship OSN frequently used for link prediction method evaluation.

Link prediction in social networks: an edge creation history retrieval-based method that combines topological and contextual data

Unbalanced community structures is a common phenomenon when representing real-world systems using Complex Networks; however, not all community detection model can correctly identify communities of different sizes. In this paper, we propose a community detection technique focusing on the detection of unbalanced communities. The method augments the Particle Competition model: a bio-inspired technique that employs a set of particles (random walkers) into the network to compete for its nodes. However, the detection of unbalanced communities in the original Particle Competition is impossible because every particle shares the same ability to defend and attack nodes. The proposed model introduces a second stage into the system, named Regularization, which explicitly handles the detection of unbalanced communities. This mechanism uses the neighborhood of the nodes to create a custom preference guide for each particle, specifically tailored to the community of the particle. As a result, the model can precisely detect unbalanced community structures. Furthermore, the model achieves higher accuracy and faster computational speed compared to the original Particle Competition model.

Particle Competition for Unbalanced Community Detection in Complex Networks

One of the main challenges in Machine Learning and Data Mining fields is the treatment of large Data Streams in the presence of Concept Drifts. This paper presents two families of ensemble algorithms designed to adapt to abrupt and gradual concept drifts. The families Fast Stacking of Ensembles boosting the Old (FASEO) and Fast Stacking of Ensembles boosting the Best (FASEB) are adaptations of the Fast Adaptive Stacking of Ensembles (FASE) algorithm to improve run-time, without presenting a significant decrease in terms of accuracy when compared to the original FASE. In order to achieve a more efficient model, adjustments were made in the update strategy and voting procedure of the ensemble. To evaluate the methods, Naive Bayes (NB) and Hoeffding Tree (HT) are used, as learners, to compare the performance of the algorithms on artificial and real-world data-sets. An experimental investigation with a total of 32 experiments and the application of Friedman and Bonferroni-Dunn statistical tests showed the families FASEO and FASEB are more efficient than FASE with respect to execution time in many experiments, also some methods achieving better accuracy results.


Comparative study of Fast Stacking Ensembles families algorithms

Incremental machine learning algorithms have been effective alternatives to deal with stream data.
The Hoeffding Tree framework is one of the most successful solutions for supervised online prediction tasks.
Although online regression tasks are present in several forms, and in many real-life problems, most of the research efforts have been devoted to classification.
Existing regression tree solutions have strong limitations, mainly regarding their memory usage and running time.
Hence, a new algorithm able to address these aspects in Hoeffding Tree Regressors is a relevant research issue.
We propose 2CS, a correlation-guided strategy to speed up Hoeffding Tree Regressor training.
2CS is conceptually simple and works by avoiding the exhaustive evaluation of all possible features as split candidates, as occurs in the existing solutions.
Moreover, 2CS can be easily merged into existing incremental tree solutions and online tree ensembles algorithms, such as bagging and boosting.
Throughout an extensive experimental evaluation, we show that the induction of 2CS-based models can be significantly faster than the traditional Hoeffding Tree Regressor algorithms, whereas retaining similar predictive power and memory use.

2CS: Correlation-guided Split Candidate\\Selection in Hoeffding Tree Regressors

Ontologies are used in Information Systems to manage and share knowledge pertaining to different domains, considering it is common that one particular piece of knowledge is modeled individually into different ontologies. Alignment processes are carried out towards interoperability; however, the results are not effective in most cases, requiring manual repair and review by domain experts. Thus, this work introduces a repair and review tool for the alignment of ontologies with the goal
of assisting experts in the alignment repair tasks. Using the technology acceptance model, a proof of concept was made to analyze the perception by domain experts regarding the tool’s usefulness, ease, and intention of use. From statistical analyses in terms of reliability, default path, inference, and correlation, it has been found that study participants had a positive perception of the tool’s usefulness and ease in the tasks of ontology alignment repair. Therefore, the tool and its functionalities
proved to be useful towards assisting domain experts in their tasks of reducing the semantic heterogeneity among ontologies pertaining to the same domain through alignment repair.

A Useful Tool to Support the Ontology Alignment Repair

Most ensemble methods for classification and regression tasks are based on a simple naive technique such as bagging, where all models' outputs are combined in a single last label. But in this paper, we evaluate a meta-learning approach that for each instance a different subset of classifiers is chosen.

Towards an Instance Level Meta-Learning Based Ensemble for Time Series Classification

A short-term electricity demand forecasting in the Southern Region of Brazil using the ARIMA Model and the Holt Exponential Smoothing Model (SEH)

I will present the Doclass, a free and open-source software for the Web that aims to assist in labeling and classifying large sets of documents. As a result, the first version of a system with an architecture composed of a mobile frontend that communicates with a backend through a REST API was published, with satisfactory performance evaluation by the applicant. Other results involve the use of active learning techniques to reduce human effort when performing the classification of documents, as well as the Uncertainty strategy to choose the document to be labeled.

Doclass: open-source software to support document labelingand classification

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.

Downloads

Next from BRACIS 2020

Ensemble of Binary Classifiers Combined Using Recurrent Correlation Associative Memories

Similar lecture

Preschool Children's Learning and Generalization of Continuous Causal Functions

.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 Binary Classifiers Combined Using Recurrent Correlation Associative Memories

Similar lecture

Preschool Children's Learning and Generalization of Continuous Causal Functions

Downloads