Geometric min-hashing: Finding a (thick) needle in a haystack

O Chum, M Perd'och, J Matas - 2009 IEEE Conference on …, 2009 - ieeexplore.ieee.org
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 …

Adaptive in-memory representation of decision trees for GPU-accelerated evolutionary induction

K Jurczuk, M Czajkowski, M Kretowski - Future Generation Computer …, 2024 - Elsevier
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 …

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 …

Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs

T Hanaka, A Ikeyama, H Ono - International Conference on Combinatorial …, 2023 - Springer
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 …

Open Problems in (Hyper) Graph Decomposition

D Ajwani, RH Bisseling, K Casel, ÜV Çatalyürek… - arxiv preprint arxiv …, 2023 - arxiv.org
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 …

Fair Correlation Clustering in Forests

K Casel, T Friedrich, M Schirneck… - arxiv preprint arxiv …, 2023 - arxiv.org
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 …

Cliques in regular graphs and the core-periphery problem in social networks

U Brandes, E Holm, A Karrenbauer - International Conference on …, 2016 - Springer
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 …