Geometric min-hashing: Finding a (thick) needle in a haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object
discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image …
discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image …
Adaptive in-memory representation of decision trees for GPU-accelerated evolutionary induction
Decision trees (DTs) are a type of machine learning technique used for classification and
regression problems. They are considered to be a part of explainable artificial intelligence …
regression problems. They are considered to be a part of explainable artificial intelligence …
A generalized and adaptive method for community detection
R Campigotto, PC Céspedes, JL Guillaume - ar**
subgraphs of maximum density. The density of a partition is the sum of the densities of the …
subgraphs of maximum density. The density of a partition is the sum of the densities of the …
Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs
Fractional hedonic games are coalition formation games where the utility of a player is
determined by the average value they assign to the members of their coalition. These games …
determined by the average value they assign to the members of their coalition. These games …
Open Problems in (Hyper) Graph Decomposition
Large networks are useful in a wide range of applications. Sometimes problem instances
are composed of billions of entities. Decomposing and analyzing these structures helps us …
are composed of billions of entities. Decomposing and analyzing these structures helps us …
Fair Correlation Clustering in Forests
The study of algorithmic fairness received growing attention recently. This stems from the
awareness that bias in the input data for machine learning systems may result in …
awareness that bias in the input data for machine learning systems may result in …
Cliques in regular graphs and the core-periphery problem in social networks
The existence of a densely knit core surrounded by a loosely connected periphery is a
common macro-structural feature of social networks. Formally, the CorePeriphery problem is …
common macro-structural feature of social networks. Formally, the CorePeriphery problem is …