default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChiheb-Eddine Ben N'cir
Person information
- affiliation: University of Manouba, Tunisia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Chiheb-Eddine Ben N'cir, Mohamed Aymen Ben HajKacem, Mohammed Alatas:
Explainable Spark-based PSO Clustering for Intrusion Detection. Comput. Sci. 25(2) (2024)- [j14]Chiheb-Eddine Ben N'cir
, Mohamed Aymen Ben HajKacem, Mohammed Alattas:
Enhancing intrusion detection performance using explainable ensemble deep learning. PeerJ Comput. Sci. 10: e2289 (2024) - 2023
- [j13]Alaa A. Qaffas, Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben Ncir, Olfa Nasraoui:
Interpretable Multi-Criteria ABC Analysis Based on Semi-Supervised Clustering and Explainable Artificial Intelligence. IEEE Access 11: 43778-43792 (2023) - [j12]Chiheb-Eddine Ben Ncir, Mohamed Ben Mzoughia, Alaa A. Qaffas, Waad Bouaguel:
Evolutionary multi-objective customer segmentation approach based on descriptive and predictive behaviour of customers: application to the banking sector. J. Exp. Theor. Artif. Intell. 35(8): 1201-1223 (2023) - [j11]Alaa A. Qaffas, Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben Ncir, Olfa Nasraoui:
An Explainable Artificial Intelligence Approach for Multi-Criteria ABC Item Classification. J. Theor. Appl. Electron. Commer. Res. 18(2): 848-866 (2023) - 2022
- [j10]Waad Bouaguel, Chiheb-Eddine Ben N'cir:
Distributed Evolutionary Feature Selection for Big Data Processing. Vietnam. J. Comput. Sci. 9(3): 313-332 (2022) - [p1]Chiheb-Eddine Ben Ncir, Bader A. Alyoubi, Roaa Alrazyeg:
Data-Driven Analysis of Microfinance and Social Loans Before and During the COVID-19 Pandemic Using Exploratory Analysis and Decision Tree Classifiers. Machine Learning and Data Analytics for Solving Business Problems 2022: 23-40 - [e1]Bader A. Alyoubi, Chiheb-Eddine Ben Ncir, Ibraheem Mubarak Alharbi, Anis Jarboui:
Machine Learning and Data Analytics for Solving Business Problems: Methods, Applications, and Case Studies. Unsupervised and Semi-Supervised Learning, Springer 2022, ISBN 978-3-031-18483-3 [contents] - 2021
- [j9]Chiheb-Eddine Ben Ncir:
A Density-Based Method for the Identification of Non-Disjoint Clusters With Arbitrary and Non-Spherical Shapes. Comput. Sci. 22(2) (2021) - [j8]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
A parallel text clustering method using Spark and hashing. Computing 103(9): 2007-2031 (2021) - [j7]Chiheb-Eddine Ben Ncir, Abdallah Hamza, Waad Bouaguel:
Parallel and scalable Dunn Index for the validation of big data clusters. Parallel Comput. 102: 102751 (2021) - [j6]Chiheb-Eddine Ben N'cir, Mohamed Ismail Maiza, Waad Bouaguel, Nadia Essoussi:
Disjoint and Non-Disjoint Community Detection with Control of Overlaps Between Communities. SN Comput. Sci. 2(1): 15 (2021) - [c18]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Spark Based Text Clustering Method Using Hashing. DaWaK 2021: 137-142 - [c17]Malek Chebil, Rim Jallouli, Mohamed Anis Bach Tobji, Chiheb-Eddine Ben Ncir:
Topic Modeling of Marketing Scientific Papers: An Experimental Survey. ICDEc 2021: 147-171
2010 – 2019
- 2019
- [j5]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
STiMR k-Means: An Efficient Clustering Method for Big Data. Int. J. Pattern Recognit. Artif. Intell. 33(8): 1950013:1-1950013:23 (2019) - [j4]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
One-pass MapReduce-based clustering method for mixed large scale data. J. Intell. Inf. Syst. 52(3): 619-636 (2019) - 2018
- [c16]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Scalable Random Sampling K-Prototypes Using Spark. DaWaK 2018: 317-326 - 2017
- [c15]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
KP-S: A Spark-Based Design of the K-Prototypes Clustering for Big Data. AICCSA 2017: 557-563 - [c14]Mohamed Ismail Maiza, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Overlapping Community Detection Method for Social Networks. ICDEc 2017: 143-151 - [c13]Chiheb-Eddine Ben N'cir, Nadia Essoussi:
New Overlap Measure for the Validation of Non-disjoint Partitioning. ICDEc 2017: 152-161 - 2016
- [c12]Abir Zayani, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Parallel clustering method for non-disjoint partitioning of large-scale data based on spark framework. IEEE BigData 2016: 1064-1069 - [c11]Mohamed Ismail Maiza, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Overlap regulation for additive overlapping clustering methods. RCIS 2016: 1-6 - [c10]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
An Accelerated MapReduce-Based K-prototypes for Big Data. STAF Workshops 2016: 13-25 - 2015
- [j3]Chiheb-Eddine Ben N'cir, Nadia Essoussi, Mohamed Limam:
Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries. J. Classif. 32(2): 176-211 (2015) - [j2]Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Using Sequences of Words for Non-Disjoint Grouping of Documents. Int. J. Pattern Recognit. Artif. Intell. 29(3): 1550013:1-1550013:20 (2015) - [c9]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
MapReduce-based k-prototypes clustering method for big data. DSAA 2015: 1-7 - [c8]Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Parallel K-prototypes for Clustering Big Data. ICCCI (2) 2015: 628-637 - 2014
- [j1]Chiheb-Eddine Ben N'cir, Guillaume Cleuziou, Nadia Essoussi:
Generalization of c-means for identifying non-disjoint clusters with overlap regulation. Pattern Recognit. Lett. 45: 92-98 (2014) - [c7]Chiheb-Eddine Ben N'cir, Guillaume Cleuziou, Nadia Essoussi:
Généralisation des k-moyennes pour produire des recouvrements ajustables. EGC 2014: 221-232 - [c6]Hela Masmoudi, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Identification de classes non-disjointes ayants des densités différentes. EGC 2014: 257-268 - [c5]Amira Rezgui, Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Overlapping Clustering with Outliers Detection. ICPRAM 2014: 279-286 - 2013
- [c4]Chiheb-Eddine Ben N'cir, Afef Zenned, Nadia Essoussi:
Non-disjoint grouping of text documents based Word Sequence Kernel. EGC 2013: 253-262 - [c3]Chiheb-Eddine Ben N'cir, Nadia Essoussi:
On the Extension of k-Means for Overlapping Clustering - Average or Sum of Clusters' Representatives?. KDIR/KMIS 2013: 208-213 - [c2]Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Non-disjoint Cluster Analysis with Non-uniform Density. MIKE 2013: 100-111 - 2012
- [i2]Chiheb-Eddine Ben N'cir, Nadia Essoussi:
Classification Recouvrante Basée sur les Méthodes à Noyau. CoRR abs/1211.6851 (2012) - [i1]Chiheb-Eddine Ben N'cir, Nadia Essoussi, Patrice Bertrand:
Overlapping clustering based on kernel similarity metric. CoRR abs/1211.6859 (2012) - 2010
- [c1]Chiheb-Eddine Ben N'cir, Nadia Essoussi, Patrice Bertrand:
Kernel Overlapping K-Means for Clustering in Feature Space. KDIR 2010: 250-255
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-19 20:47 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:
