3 papers
cs.LG2026
Scalable Multi-view Clustering via Explicit Kernel Features Maps
Chakib Fettal, Lazhar Labiod, Mohamed Nadif
The proliferation of high-dimensional data from sources such as social media, sensor networks, and online platforms has created new challenges for clustering algorithms. Multi-view…
stat.ML2025
Classification EM-PCA for clustering and embedding
Zineddine Tighidet, Lazhar Labiod, Mohamed Nadif
The mixture model is undoubtedly one of the greatest contributions to clustering. For continuous data, Gaussian models are often used and the Expectation-Maximization (EM) algorith…
cs.LG2024
Graph Cuts with Arbitrary Size Constraints Through Optimal Transport
Chakib Fettal, Lazhar Labiod, Mohamed Nadif
A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced var…