Publications associées à Correlation clustering

Planning urban proximities: An empirical analysis of how residential preferences conflict with the urban morphologies and residential practices

Vincent Kaufmann, Luca Giovanni Pattaroni, Marc-Edouard Baptiste Grégoire Schultheiss

Urban proximity planning is foreseen as a solution to foster a “sustainable” city, including economic viability, environmental soundness and social inclusivity. This paper focuses on the inclusivity aspects by questioning the adoption of urban proximities: ...

2024

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Vinitra Swamy, Paola Mejia Domenzain, Tanja Christina Käser Jacober, Julian Thomas Blackwell, Isadora Alves de Salles

Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. However, the effectiveness of clustering depends on its interpretability, which becomes challenging w ...

2024

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Visual Capital: Evaluating building-level visual landscape quality at scale

Adam Robert Swietek

Evaluating visual landscape quality provides valuable information for urban development and spatial planning. In practice however, obtaining high resolution view-metrics and outcome data with sufficient geographic coverage has remained challenging. To over ...

2023

Beyond worst-case analysis, with or without predictions

Andreas Maggiori

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings. In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competiti ...

EPFL2023

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Yichen Xu, Qiang Liu, Feng Yu

Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous Graph Neural Networks (GNN) require a large number of labeled ...

Assoc Computing Machinery2023

Tractography passes the test: Results from the diffusion-simulated connectivity (disco) challenge

Jean-Philippe Thiran, Gabriel Girard, Erick Jorge Canales Rodriguez, Juan Luis Villarreal Haro, Alessandro Daducci, Alonso Ramirez Manzanares, Marco Pizzolato, Ying-Chia Lin, Sara Sedlar, Caio Seguin, Kenji Marshall, Yang Ji

Estimating structural connectivity from diffusion-weighted magnetic resonance imaging is a challenging task, partly due to the presence of false-positive connections and the misestimation of connection weights. Building on previous efforts, the MICCAI-CDMR ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Karl Aberer, Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

ELSEVIER SCIENCE INC2023

Landscapes of DNA Mechanics and Genomes

Thomas Antonin Zwahlen

The local physical properties - such as shape and flexibility - of the DNA double-helix is today widely believed to be influenced by nucleic acid sequence in a non-trivial way. Furthermore, there is strong evidence that these properties play a role in many ...

EPFL2023

AIFORE: Smart Fuzzing Based on Automatic Input Format Reverse Engineering

Mathias Josef Payer, Zhiyao Feng, Chunmin Zhang, Ji Shi

Knowledge of a program's input format is essential for effective input generation in fuzzing. Automated input format reverse engineering represents an attractive but challenging approach to learning the format. In this paper, we address several challenges ...

Usenix Assoc2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Preserved Corticospinal Tract Revealed by Acute Perfusion Imaging Relates to Better Outcome After Thrombectomy in Stroke

Friedhelm Christoph Hummel, Philipp Johannes Koch

BACKGROUND:The indication for mechanical thrombectomy (MT) in stroke patients with large vessel occlusion has been constantly expanded over the past years. Despite remarkable treatment effects at the group level in clinical trials, many patients remain sev ...

Lippincott Williams & Wilkins2023

Single-Trace Clustering Power Analysis of the Point-Swapping Procedure in the Three Point Ladder of Cortex-M4 SIKE

Aymeric Genet, Novak Kaluderovic

In this paper, the recommended implementation of the post-quantum key exchange SIKE for Cortex-M4 is attacked through power analysis with a single trace by clustering with the k-means algorithm the power samples of all the invocations of the elliptic curve ...

Springer, Cham2022

Discriminative clustering with representation learning with any ratio of labeled to unlabeled data

We present a discriminative clustering approach in which the feature representation can be learned from data and moreover leverage labeled data. Representation learning can give a similarity-based clustering method the ability to automatically adapt to an ...

2022

Motif Cut Sparsifiers

Mikhail Kapralov, Mikhail Makarov, Jakab Tardos

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

IEEE COMPUTER SOC2022

Model-Based Clustering of Trends and Cycles of Nitrate Concentrations in Rivers Across France

Camille Roland Marie Minaudo

Elevated nitrate from human activity causes ecosystem and economic harm globally. The factors that control the spatiotemporal dynamics of riverine nitrate concentration remain difficult to describe and predict. We analyzed nitrate concentration from 4450 s ...

SPRINGER2023

Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster

Emmanuel Abbé

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in fin ...

ASSOC COMPUTING MACHINERY2022

Linguistic traits as heritable units? Spatial Bayesian clustering reveals Swiss German dialect regions

Stéphane Joost, Noemi Romano

In the early 2000s, the SADS, an extensive linguistic atlas project, surveyed more than three thousand individuals across German-speaking Switzerland on over two hundred linguistic variants, capturing the morphosyntactic variation in Swiss German. In this ...

2022

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: cosmological implications from multitracer BAO analysis with galaxies and voids

Jean-Paul Richard Kneib, Andrei Variu, Jiaxi Yu, Daniel Felipe Forero Sanchez, Cheng Zhao, Huanyuan Shan, Amélie Tamone

We construct cosmic void catalogues with the DIVE void finder upon SDSS BOSS DR12 and eBOSS DR16 galaxy samples with BAO reconstruction, and perform a joint BAO analysis using different types of galaxies and the corresponding voids. The BAO peak is evident ...

OXFORD UNIV PRESS2022

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021