default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLazhar Labiod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Chakib Fettal
, Lazhar Labiod, Mohamed Nadif:
Boosting Subspace Co-Clustering via Bilateral Graph Convolution. IEEE Trans. Knowl. Data Eng. 36(3): 960-971 (2024)- [j16]Lazhar Labiod, Mohamed Nadif:
Power Attributed Graph Embedding and Clustering. IEEE Trans. Neural Networks Learn. Syst. 35(1): 1439-1444 (2024) - 2022
- [j15]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
TensorClus: A python library for tensor (Co)-clustering. Neurocomputing 468: 464-468 (2022) - [j14]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
CAEclust: A Consensus of Autoencoders Representations for Clustering. Image Process. Line 12: 590-603 (2022) - 2021
- [j13]Lazhar Labiod, Mohamed Nadif:
Efficient regularized spectral data embedding. Adv. Data Anal. Classif. 15(1): 99-119 (2021) - [j12]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Implicit consensus clustering from multiple graphs. Data Min. Knowl. Discov. 35(6): 2313-2340 (2021) - [j11]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Regularized bi-directional co-clustering. Stat. Comput. 31(3): 32 (2021) - 2020
- [j10]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Tensor latent block model for co-clustering. Int. J. Data Sci. Anal. 10(2): 161-175 (2020) - [j9]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Spectral clustering via ensemble deep autoencoder learning (SC-EDAE). Pattern Recognit. 108: 107522 (2020) - 2018
- [j8]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Simultaneous Spectral Data Embedding and Clustering. IEEE Trans. Neural Networks Learn. Syst. 29(12): 6396-6401 (2018) - 2017
- [j7]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Multi-manifold matrix decomposition for data co-clustering. Pattern Recognit. 64: 386-398 (2017) - [j6]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Erratum to 'Multi-Manifold Matrix Decomposition for Data Co-clustering' Pattern Recognition 64 (2017) 386-398. Pattern Recognit. 69: 352-353 (2017) - [j5]Kais Allab, Lazhar Labiod, Mohamed Nadif:
A Semi-NMF-PCA Unified Framework for Data Clustering. IEEE Trans. Knowl. Data Eng. 29(1): 2-16 (2017) - 2015
- [j4]Lazhar Labiod, Mohamed Nadif:
A Unified Framework for Data Visualization and Coclustering. IEEE Trans. Neural Networks Learn. Syst. 26(9): 2194-2199 (2015) - 2011
- [j3]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Simultaneous Topological Categorical Data Clustering and Cluster characterization. Int. J. Comput. 10(1): 9-23 (2011) - [j2]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Classification relationnelle topographique. Rev. d'Intelligence Artif. 25(3): 393-410 (2011) - 2010
- [j1]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Relational Topological Map. Int. J. Comput. Intell. Appl. 9(4): 353-370 (2010)
Conference and Workshop Papers
- 2024
- [c39]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
More Discriminative Sentence Embeddings via Semantic Graph Smoothing. EACL (2) 2024: 8-13 - [c38]Lazhar Labiod, Mohamed Nadif, Aghiles Salah:
WSDM 2024 Workshop on Representation Learning & Clustering. WSDM 2024: 1214-1215 - 2023
- [c37]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Scalable Attributed-Graph Subspace Clustering. AAAI 2023: 7559-7567 - [c36]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Subspace Co-clustering avec Convolution Bilatérale sur Graphe. EGC 2023: 475-482 - [c35]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Biclustering Basé sur le Transport Optimal. EGC 2023: 539-546 - [c34]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering. WSDM 2023: 303-311 - 2022
- [c33]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Subspace Co-clustering with Two-Way Graph Convolution. CIKM 2022: 3938-3942 - [c32]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Apprentissage Joint de la Représentation et du Clustering avec un Réseau Convolutif sur Graphe. EGC 2022: 363-370 - [c31]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Efficient and Effective Optimal Transport-Based Biclustering. NeurIPS 2022 - [c30]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Efficient Graph Convolution for Joint Node Representation Learning and Clustering. WSDM 2022: 289-297 - 2021
- [c29]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Approche ensemble pour le co-clustering par blocs sur des données textuelles: Application au biomédical. EGC 2021: 381-388 - [c28]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Méthode ensemble de clustering profond. EGC 2021: 413-420 - [c27]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Regularized Dual-PPMI Co-clustering for Text Data. SIGIR 2021: 2263-2267 - 2020
- [c26]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Ensemble Block Co-clustering: A Unified Framework for Text Data. CIKM 2020: 5-14 - [c25]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Défi EGC 2020 : Analyse tensorielle de données issues de la conférence EGC. EGC 2020: 217-228 - 2019
- [c24]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Co-clustering from Tensor Data. PAKDD (1) 2019: 370-383 - [c23]Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Sparse Tensor Co-clustering as a Tool for Document Categorization. SIGIR 2019: 1157-1160 - 2017
- [c22]Milad Leyli-Abadi, Lazhar Labiod, Mohamed Nadif:
Denoising Autoencoder as an Effective Dimensionality Reduction and Clustering of Text Data. PAKDD (2) 2017: 801-813 - 2016
- [c21]Kais Allab, Lazhar Labiod, Mohamed Nadif:
SemiNMF-PCA framework for Sparse Data Co-clustering. CIKM 2016: 347-356 - [c20]Lazhar Labiod, Mohamed Nadif:
Bi-stochastic Matrix Approximation Framework for Data Co-clustering. IDA 2016: 273-283 - [c19]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Power Simultaneous Spectral Data Embedding and Clustering. SDM 2016: 270-278 - 2015
- [c18]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Simultaneous Semi-NMF and PCA for Clustering. ICDM 2015: 679-684 - [c17]Nicoleta Rogovschi, Nistor Grozavu, Lazhar Labiod:
Spectral Clustering Trough Topological Learning for Large Datasets. ICONIP (2) 2015: 216-223 - [c16]Kais Allab, Lazhar Labiod, Mohamed Nadif:
Multi-Manifold Matrix Tri-Factorization for Text Data Clustering. ICONIP (1) 2015: 705-715 - 2013
- [c15]Nicoleta Rogovschi, Lazhar Labiod, Mohamed Nadif:
A topographical nonnegative matrix factorization algorithm. IJCNN 2013: 1-6 - 2012
- [c14]Nistor Grozavu, Younès Bennani, Lazhar Labiod:
Transformation de l'espace de description pour l'apprentissage par transfert. EGC 2012: 35-40 - [c13]Lazhar Labiod, Younès Bennani:
Classification des données catégorielles via la maximisation spectrale de la modularité. EGC 2012: 149-154 - [c12]Nicoleta Rogovschi, Lazhar Labiod, Mohamed Nadif:
Un Algorithme Spectral pour le Co-clustering Topographique. EGC 2012: 579-580 - [c11]Nistor Grozavu, Younès Bennani, Lazhar Labiod:
Feature space transformation for transfer learning. IJCNN 2012: 1-6 - [c10]Nicoleta Rogovschi, Lazhar Labiod, Mohamed Nadif:
A spectral algorithm for topographical Co-clustering. IJCNN 2012: 1-6 - 2011
- [c9]Lazhar Labiod, Younès Bennani:
A Spectral Based Clustering Algorithm for Categorical Data with Maximum Modularity. ESANN 2011 - [c8]Lazhar Labiod, Younès Bennani:
Interprétation spectrale de la classification relationnelle. EGC 2011: 431-436 - [c7]Lazhar Labiod, Mohamed Nadif:
Co-clustering for Binary and Categorical Data with Maximum Modularity. ICDM 2011: 1140-1145 - [c6]Lazhar Labiod, Mohamed Nadif:
Co-clustering for Binary Data with Maximum Modularity. ICONIP (2) 2011: 700-708 - [c5]Lazhar Labiod, Mohamed Nadif:
Co-clustering under Nonnegative Matrix Tri-Factorization. ICONIP (2) 2011: 709-717 - 2010
- [c4]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Formulation Condorcéenne du critère de la modularité. AAFD 2010: 171-187 - [c3]Nistor Grozavu, Lazhar Labiod, Younès Bennani:
Autonomous Clustering Characterization for Categorical Data. ICMLA 2010: 607-613 - [c2]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Clustering Categorical Data Using an Extended Modularity Measure. ICONIP (2) 2010: 310-320 - [c1]Lazhar Labiod, Nistor Grozavu, Younès Bennani:
Relational topological clustering. IJCNN 2010: 1-8
Informal and Other Publications
- 2024
- [i4]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Graph Cuts with Arbitrary Size Constraints Through Optimal Transport. CoRR abs/2402.04732 (2024) - [i3]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Scalable Multi-view Clustering via Explicit Kernel Features Maps. CoRR abs/2402.04794 (2024) - [i2]Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
More Discriminative Sentence Embeddings via Semantic Graph Smoothing. CoRR abs/2402.12890 (2024) - 2019
- [i1]Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Spectral Clustering via Ensemble Deep Autoencoder Learning (SC-EDAE). CoRR abs/1901.02291 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
