Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 59 matches
- 2024
- Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Boosting Subspace Co-Clustering via Bilateral Graph Convolution. IEEE Trans. Knowl. Data Eng. 36(3): 960-971 (2024) - Lazhar Labiod, Mohamed Nadif:
Power Attributed Graph Embedding and Clustering. IEEE Trans. Neural Networks Learn. Syst. 35(1): 1439-1444 (2024) - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
More Discriminative Sentence Embeddings via Semantic Graph Smoothing. EACL (2) 2024: 8-13 - Lazhar Labiod, Mohamed Nadif, Aghiles Salah:
WSDM 2024 Workshop on Representation Learning & Clustering. WSDM 2024: 1214-1215 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Graph Cuts with Arbitrary Size Constraints Through Optimal Transport. CoRR abs/2402.04732 (2024) - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Scalable Multi-view Clustering via Explicit Kernel Features Maps. CoRR abs/2402.04794 (2024) - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
More Discriminative Sentence Embeddings via Semantic Graph Smoothing. CoRR abs/2402.12890 (2024) - 2023
- Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Scalable Attributed-Graph Subspace Clustering. AAAI 2023: 7559-7567 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Subspace Co-clustering avec Convolution Bilatérale sur Graphe. EGC 2023: 475-482 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Biclustering Basé sur le Transport Optimal. EGC 2023: 539-546 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering. WSDM 2023: 303-311 - 2022
- Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
TensorClus: A python library for tensor (Co)-clustering. Neurocomputing 468: 464-468 (2022) - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
CAEclust: A Consensus of Autoencoders Representations for Clustering. Image Process. Line 12: 590-603 (2022) - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Subspace Co-clustering with Two-Way Graph Convolution. CIKM 2022: 3938-3942 - 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 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Efficient and Effective Optimal Transport-Based Biclustering. NeurIPS 2022 - Chakib Fettal, Lazhar Labiod, Mohamed Nadif:
Efficient Graph Convolution for Joint Node Representation Learning and Clustering. WSDM 2022: 289-297 - 2021
- Lazhar Labiod, Mohamed Nadif:
Efficient regularized spectral data embedding. Adv. Data Anal. Classif. 15(1): 99-119 (2021) - Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Implicit consensus clustering from multiple graphs. Data Min. Knowl. Discov. 35(6): 2313-2340 (2021) - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Regularized bi-directional co-clustering. Stat. Comput. 31(3): 32 (2021) - 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 - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Méthode ensemble de clustering profond. EGC 2021: 413-420 - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Regularized Dual-PPMI Co-clustering for Text Data. SIGIR 2021: 2263-2267 - 2020
- Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Tensor latent block model for co-clustering. Int. J. Data Sci. Anal. 10(2): 161-175 (2020) - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Spectral clustering via ensemble deep autoencoder learning (SC-EDAE). Pattern Recognit. 108: 107522 (2020) - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Ensemble Block Co-clustering: A Unified Framework for Text Data. CIKM 2020: 5-14 - 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
- Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Co-clustering from Tensor Data. PAKDD (1) 2019: 370-383 - Rafika Boutalbi, Lazhar Labiod, Mohamed Nadif:
Sparse Tensor Co-clustering as a Tool for Document Categorization. SIGIR 2019: 1157-1160 - Séverine Affeldt, Lazhar Labiod, Mohamed Nadif:
Spectral Clustering via Ensemble Deep Autoencoder Learning (SC-EDAE). CoRR abs/1901.02291 (2019)
skipping 29 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-10 13:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint