Cover Image

Soft-ECM: An extension of Evidential C-Means for complex data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Soubeiga, Armel, Guyet, Thomas, Antoine, Violaine
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

evclust: Python library for evidential clustering
by: Soubeiga, Armel, et al.
Published: (2025)

Gödel Test: Can Large Language Models Solve Easy Conjectures?
by: Feldman, Moran, et al.
Published: (2025)

Learning with the $p$-adics
by: Martins, André F. T.
Published: (2025)

Accumulator-Aware Post-Training Quantization for Large Language Models
by: Colbert, Ian, et al.
Published: (2024)

A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
by: Sanokowski, Sebastian, et al.
Published: (2024)

ReLU Networks for Exact Generation of Similar Graphs
by: Ghafoor, Mamoona, et al.
Published: (2026)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
by: Mehrabian, Abbas, et al.
Published: (2023)

Transition Graph Properties of Target Class Classification
by: Aslanyan, Levon, et al.
Published: (2024)

Neural Lattice Reduction: A Self-Supervised Geometric Deep Learning Approach
by: Marchetti, Giovanni Luca, et al.
Published: (2023)

Plum: Prompt Learning using Metaheuristic
by: Pan, Rui, et al.
Published: (2023)

Structural perspective on constraint-based learning of Markov networks
by: Korhonen, Tuukka, et al.
Published: (2024)

On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis
by: Bu, Fanchen, et al.
Published: (2025)

Aspects of Artificial Intelligence: Transforming Machine Learning Systems Naturally
by: Guo, Xiuzhan
Published: (2025)

An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
by: Du, Alina, et al.
Published: (2026)

Multi-Path Long-Term Vessel Trajectories Forecasting with Probabilistic Feature Fusion for Problem Shifting
by: Spadon, Gabriel, et al.
Published: (2023)

Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond
by: Fujita, Takaaki, et al.
Published: (2024)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
by: Wu, Yikai, et al.
Published: (2025)

Federated Combinatorial Multi-Agent Multi-Armed Bandits
by: Fourati, Fares, et al.
Published: (2024)

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
by: Gadekar, Ameet, et al.
Published: (2024)

Analysis of Corrected Graph Convolutions
by: Wang, Robert, et al.
Published: (2024)

Multi-Excitation Projective Simulation with a Many-Body Physics Inspired Inductive Bias
by: LeMaitre, Philip A., et al.
Published: (2024)

Reward Generalization in RLHF: A Topological Perspective
by: Qiu, Tianyi, et al.
Published: (2024)

A Fair Post-Processing Method based on the MADD Metric for Predictive Student Models
by: Verger, Mélina, et al.
Published: (2024)

Mean-based incomplete pairwise comparisons method with the reference values
by: Kułakowski, Konrad, et al.
Published: (2022)

The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)

Critical attention scaling in long-context transformers
by: Chen, Shi, et al.
Published: (2025)

Approximately Optimal Search on a Higher-dimensional Sliding Puzzle
by: Merleau, Nono SC, et al.
Published: (2024)

Future Directions in the Theory of Graph Machine Learning
by: Morris, Christopher, et al.
Published: (2024)

Items or Relations -- what do Artificial Neural Networks learn?
by: Krause, Renate, et al.
Published: (2024)

Learning to Prune Instances of Steiner Tree Problem in Graphs
by: Zhang, Jiwei, et al.
Published: (2022)

Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS
by: Guigues, Laurent
Published: (2026)

Are Graph Neural Networks Optimal Approximation Algorithms?
by: Yau, Morris, et al.
Published: (2023)

Automatic Operator-level Parallelism Planning for Distributed Deep Learning -- A Mixed-Integer Programming Approach
by: She, Ruifeng, et al.
Published: (2025)

Optimizing LoRa for Edge Computing with TinyML Pipeline for Channel Hopping
by: Grunewald, Marla, et al.
Published: (2024)

A Primer on Temporal Graph Learning
by: Rahman, Aniq Ur, et al.
Published: (2024)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
by: Zhu, Enqiang, et al.
Published: (2025)

A Multi-Objective Genetic Algorithm for Healthcare Workforce Scheduling
by: Patel, Vipul, et al.
Published: (2025)

Revisiting FastMap: New Applications
by: Li, Ang
Published: (2025)

Degree-Based Logical Adjacency Checking (DBLAC): A Novel Heuristic for Vertex Coloring
by: Verma, Prashant
Published: (2025)