default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdith Belise Kenmogne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Ariel Basso Madjoukeng
, Edith Belise Kenmogne, Benoît Frénay:
Robust sparse k-means clustering against STOF observations. Int. J. Data Sci. Anal. 20(8): 6973-6983 (2025)- [j7]Clémentin Tayou Djamégni, William Kery Branston Ndemaze, Edith Belise Kenmogne, Hervé Maradona Nana Kouassi, Arnauld Nzegha Fountsop, Idriss Tetakouchom, Laurent Cabrel Tabueu Fotso:
Support estimation in frequent itemsets mining on Enriched Two Level Tree. Inf. Syst. 133: 102559 (2025) - [c2]Ariel Basso Madjoukeng, Edith Belise Kenmogne, Pierre Poitier, Benoît Frénay, Jérôme Fink:
Local-Global Data Augmentation for Contrastive Learning in Static Sign Language Recognition. IDA 2025: 54-66 - [i1]Ariel Basso Madjoukeng, Jérôme Fink, Pierre Poitier, Edith Belise Kenmogne, Benoît Frénay:
SL-SLR: Self-Supervised Representation Learning for Sign Language Recognition. CoRR abs/2509.05188 (2025) - 2024
- [j6]Edith Belise Kenmogne, Idriss Tetakouchom, Clémentin Tayou Djamégni, Roger Nkambou, Laurent Cabrel Tabueu Fotso:
An Improved Algorithm for Extracting Frequent Gradual Patterns. Informatica 35(3): 577-600 (2024) - [c1]Ariel Basso Madjoukeng, Edith Belise Kenmogne, Benoît Frénay:
Fast k-means with Stable Instance Sets. IJCNN 2024: 1-8 - 2023
- [j5]Edith Belise Kenmogne, Laurent Cabrel Tabueu Fotso, Clémentin Tayou Djamégni:
A novel algorithm for mining maximal frequent gradual patterns. Eng. Appl. Artif. Intell. 120: 105939 (2023) - 2022
- [j4]Edith Belise Kenmogne, Clémentin Tayou Djamégni, Roger Nkambou, Laurent Cabrel Tabueu Fotso, Tadmon Calvin:
Efficient mining of intra-periodic frequent sequences. Array 16: 100263 (2022)
2010 – 2019
- 2017
- [j3]Edith Belise Kenmogne:
The Impact of the Pattern-Growth Ordering on the Performances of Pattern Growth-Based Sequential Pattern Mining Algorithms. Comput. Inf. Sci. 10(1): 23-33 (2017) - [j2]Edith Belise Kenmogne, Tadmon Calvin, Roger Nkambou:
A pattern growth-based sequential pattern mining algorithm called prefixSuffixSpan. EAI Endorsed Trans. Scalable Inf. Syst. 4(12): e4 (2017) - 2016
- [j1]Edith Belise Kenmogne:
A traditional-learning time predictive approach for e-learning systems in challenging environments. EAI Endorsed Trans. e Learn. 3(12): e7 (2016)
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 2025-12-28 01:36 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:
