1 citations · 1 across the 4 of their papers we have counts for
6 papers
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…
More Discriminative Sentence Embeddings via Semantic Graph Smoothing
Chakib Fettal, Lazhar Labiod, Mohamed Nadif
This paper explores an empirical approach to learn more discriminantive sentence representations in an unsupervised fashion. Leveraging semantic graph smoothing, we enhance sentenc…
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…
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…
Spectral Clustering via Ensemble Deep Autoencoder Learning (SC-EDAE)
Severine Affeldt, Lazhar Labiod, Mohamed Nadif
Recently, a number of works have studied clustering strategies that combine classical clustering algorithms and deep learning methods. These approaches follow either a sequential w…
Data Leak Aware Crowdsourcing in Social Network
Iheb Ben Amor, Athman Bougetteya, Mourad Ouziri +2
Harnessing human computation for solving complex problems call spawns the issue of finding the unknown competitive group of solvers. In this paper, we propose an approach called Fr…