Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Guilherme Gomes

dblp:144/3149 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian hypothesis testing
0.312018
Multi-level Hypothesis Testing for Populations of Heterogeneous Networks · ICDM 2018
Data mining
anomaly detection
0.312018
Multi-level Hypothesis Testing for Populations of Heterogeneous Networks · ICDM 2018
Data mining › anomaly detection
graph anomaly detection
0.312018
Multi-level Hypothesis Testing for Populations of Heterogeneous Networks · ICDM 2018

Methods — techniques the papers use, named apart from their topics

latent space model · 0.7hierarchical bayesian modeling · 0.7
YearPublicationVenuePosition
2018 Multi-level Hypothesis Testing for Populations of Heterogeneous Networks
abstract
We consider hypothesis testing and anomaly detection on datasets where each observation is a weighted network. Current approaches to hypothesis testing for weighted networks typically require thresholding the edge-weights, to transform the data to binary networks. This results in a loss of information, and outcomes are sensitive to choice of threshold levels. Our work avoids this, and we consider weighted-graph observations in two situations, 1) where each graph belongs to one of two populations, and 2) where entities belong to one of two populations, with each entity possessing multiple graphs (indexed e.g. by time). We propose a hierarchical Bayesian hypothesis testing framework that models each population with a mixture of latent space models for weighted networks, and then tests populations of networks for differences in distribution over components.Our framework is capable of population-level, entity-specific, as well as edge-specific hypothesis testing. We apply it to synthetic data and two real-world datasets: a social media dataset involving word co-occurrences from discussions on Twitter of the political unrest in Brazil, and a medical dataset involving fMRI brain-scans of human subjects. The results show that our proposed method has lower Type-I error and higher statistical power compared to previous alternatives that need to threshold the edge weights.
Guilherme Gomes, Vinayak A. Rao, Jennifer Neville
ICDM1
2006 Evolutionary Modeling of Larval Dispersal in Blowflies Using Non-Uniform Cellular Automata
abstract
When the food supply finishes, or when the larvae of blowflies complete their development and migrate prior to the total removal of the larval substrate, they disperse to find adequate places for pupation, a process known as post-feeding larval dispersal. Based on experimental data of the initial and final configuration of the dispersion, the reproduction of such spatio-temporal behavior is achieved here by means of the evolutionary search for cellular automata with a distinct transition rule associated with each cell, also known as a nonuniform cellular automata, and with two states per cell in the lattice. Two-dimensional regular lattices and multivalued states will be considered and a practical question is the necessity of discovering a proper set of transition rules. Given that the number of rules is related to the number of cells in the lattice, the search space is very large and an evolution strategy is then considered to optimize the parameters of the transition rules, with two transition rules per cell. As the parameters to be optimized admit a physical interpretation, the obtained computational model can be analyzed to raise some hypothetical explanation of the observed spatio-temporal behavior.
Ana L. T. Romano, Leonardo Gomes, Guilherme Gomes, Wilfredo Jaime Puma Villanueva, Marcelo Serrano Zanetti
IEEE Congress on Evolutionary Computation3