Publications associées à Classification double

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Vinitra Swamy, Paola Mejia Domenzain, 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

Unsupervised Electrofacies Clustering Based on Parameterization of Petrophysical Properties: A Dynamic Programming Approach

François Fleuret, Karthigan Sinnathamby

Electrofacies using well logs play a vital role in reservoir characterization. Often, they are sorted into clusters according to the self-similarity of input logs and do not capture the known underlying physical process. In this paper, we propose an unsupe ...

SOC PETROPHYSICISTS & WELL LOG ANALYSTS-SPWLA2023

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 ...

New York2023

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

Volkan Cevher, Alp Yurtsever, Maria-Luiza Vladarean

We propose a stochastic conditional gradient method (CGM) for minimizing convex finitesum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or require carefully inc ...

2022

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

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

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

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

Deep MinCut: Learning Node Embeddings by Detecting Communities

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Chi Thang Duong, Trung-Dung Hoang

We present Deep MinCut (DMC), an unsupervised approach to learn node embeddings for graph -structured data. It derives node representations based on their membership in communities. As such, the embeddings directly provide insights into the graph structure ...

ELSEVIER SCI LTD2022

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Aude Billard, Bernardo Fichera

Dynamical Systems (DS) are fundamental to the modeling and understanding time evolving phenomena, and have application in physics, biology and control. As determining an analytical description of the dynamics is often difficult, data-driven approaches are ...

MICROTOME PUBL2022

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Classification double

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Unsupervised Electrofacies Clustering Based on Parameterization of Petrophysical Properties: A Dynamic Programming Approach

Beyond worst-case analysis, with or without predictions

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

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

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

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

Deep MinCut: Learning Node Embeddings by Detecting Communities

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

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

Graph Chatbot

Chattez avec Graph Search

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Beyond worst-case analysis, with or without predictions

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

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

Unsupervised Electrofacies Clustering Based on Parameterization of Petrophysical Properties: A Dynamic Programming Approach

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

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

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

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Deep MinCut: Learning Node Embeddings by Detecting Communities