Concept

Clustering high-dimensional data

Publications associées (27)

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

Tanja Christina Käser Jacober, Paola Mejia Domenzain, Vinitra Swamy, Julian Thomas Blackwell

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

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Fabio Nobile, Tommaso Vanzan

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

2024

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

Nature Portfolio2024

Interactive-time Exploration, Querying, and Analysis of Large High-dimensional Datasets

Sachin Basil John

In the current era of big data, aggregation queries on high-dimensional datasets are frequently utilized to uncover hidden patterns, trends, and correlations critical for effective business decision-making. Data cubes facilitate such queries by employing p ...

EPFL2023

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

Yichen Xu, Qiang Liu

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

Sparse Autoencoders for Speech Modeling and Recognition

Selen Hande Kabil

Speech recognition-based applications upon the advancements in artificial intelligence play an essential role to transform most aspects of modern life. However, speech recognition in real-life conditions (e.g., in the presence of overlapping speech, varyin ...

EPFL2023

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

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

Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine

Christoph Koch, Sachin Basil John, Peter Lindner, Zhekai Jiang

We present Sudokube, a novel system that supports interactive speed querying on high-dimensional data using partially materialized data cubes. Given a storage budget, it judiciously chooses what projections to precompute and materialize during cube constru ...

Association for Computing Machinery2023

STREAMING TENSOR TRAIN APPROXIMATION

Daniel Kressner

Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...

Siam Publications2023

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

A parcellation scheme of mouse isocortex based on reversals in connectivity gradients

Michael Reimann

The brain is composed of several anatomically clearly separated structures. This parcellation is often extended into the isocortex, based on anatomical, physiological or functional differences. Here, we derive a parcellation scheme based purely on the spat ...

2023

Get the Best of Both Worlds: Improving Accuracy and Transferability by Grassmann Class Representation

Haoqi Wang

We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...

Ieee Computer Soc2023

Abundance matching analysis of the emission-line galaxy sample in the extended Baryon Oscillation Spectroscopic Survey

Anand Stéphane Raichoor

We present the measurements of the small-scale clustering for the emission-line galaxy (ELG) sample from the extended Baryon Oscillation Spectroscopic Surv e y (eBOSS) in the Sloan Digital Sk y Surv e y IV (SDSS-IV). We use conditional abundance matching m ...

OXFORD UNIV PRESS2023

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Lenka Zdeborová, Florent Gérard Krzakala, Bruno Loureiro, Luca Pesce

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022

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

Corinne Louise Jones

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

A machine learning approach to portfolio pricing and risk management for high-dimensional problems

Damir Filipovic

We present a general framework for portfolio risk management in discrete time, based on a replicating martingale. This martingale is learned from a finite sample in a supervised setting. Our method learns the features necessary for an effective low-dimensi ...

WILEY2022

Manifold Learning-Based Polynomial Chaos Expansions For High-Dimensional Surrogate Models

Ketson Roberto Maximiano Dos Santos

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantitie ...

2022

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Matthieu Wyart, Antonio Sclocchi, Umberto Maria Tomasini

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022