Abir Smiti
Research Subjects
Abir Smiti has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Zied Elouedi
LARODEC, University of Tunis, Tunisia, Higher Institute of Management of Tunis, 41 Street of liberty, Bouchoucha, 2000 Bardo
3 shared publications- Zied Elouedi
Institut Supérieur de Gestion de Tunis, Université de Tunis
3 shared publications - Ghaith Manita
Department of Software Engineering LARODEC Higher Institute of Computer Science Tunis Tunisia
1 shared publication Maha Nssibi
1 shared publicationMarwa Ben Gara Ali
1 shared publication- Mohamed Khaldi
Higher Institute of Management, Tunis, Tunisia
1 shared publication
Latest Publications
- 25 February 2026
- Published by IGI Global Scientific Publishing
- p. 1-36
Federated Learning for Arabic Sentiment Analysis
Our paper evaluates lightweight Federated Learning (FL) models for privacy-preserving Arabic sentiment analysis. We propose a CPU-efficient FL framework using classical models (SVM, Random Forest, Logistic Regression, etc.) as a practical alternative to resource-intensive transformers. tested on Arabic tweet datasets (ArSAS, ASTC, SS2030), Federated SVM achieved top accuracy (e.g., ~90% on ArSAS), while Logistic Regression offered an optimal balance of high performance and minimal execution time. Results confirm FL provides comparable accuracy to centralized training with no significant performance trade-off, while ensuring data privacy, low communication costs, and scalability, making it ideal for edge devices.
- 25 February 2026
- Published by IGI Global Scientific Publishing
- p. 1-36
Federated Learning for Arabic Sentiment Analysis
Our paper evaluates lightweight Federated Learning (FL) models for privacy-preserving Arabic sentiment analysis. We propose a CPU-efficient FL framework using classical models (SVM, Random Forest, Logistic Regression, etc.) as a practical alternative to resource-intensive transformers. tested on Arabic tweet datasets (ArSAS, ASTC, SS2030), Federated SVM achieved top accuracy (e.g., ~90% on ArSAS), while Logistic Regression offered an optimal balance of high performance and minimal execution time. Results confirm FL provides comparable accuracy to centralized training with no significant performance trade-off, while ensuring data privacy, low communication costs, and scalability, making it ideal for edge devices.
- 20 September 2020
- Published by International Information and Engineering Technology Association in Ingénierie des Systèmes d'information
- Vol. 25 (4) , 469-474
Case Based Reasoning Framework for COVID-19 Diagnosis
- 20 September 2020
- Published by International Information and Engineering Technology Association in Ingénierie des Systèmes d'information
- Vol. 25 (4) , 469-474
Case Based Reasoning Framework for COVID-19 Diagnosis
- Open Access
Robust speech recognition using consensus function based on multi-layer networks
The clustering ensembles mingle numerous partitions of a specified data into a single clustering solution. Clustering ensemble has emerged as a potent approach for ameliorating both the forcefulness and the stability of unsupervised classification results. One of the major problems in clustering ensembles is to find the best consensus function. Finding final partition from different clustering results requires skillfulness and robustness of the classification algorithm. In addition, the major problem with the consensus function is its sensitivity to the used data sets quality. This limitation is due to the existence of noisy, silence or redundant data. This paper proposes a novel consensus function of cluster ensembles based on Multilayer networks technique and a maintenance database method. This maintenance database approach is used in order to handle any given noisy speech and, thus, to guarantee the quality of databases. This can generates good results and efficient data partitions. To show its effectiveness, we support our strategy with empirical evaluation using distorted speech from Aurora speech databases.
Open AccessRobust speech recognition using consensus function based on multi-layer networks
The clustering ensembles mingle numerous partitions of a specified data into a single clustering solution. Clustering ensemble has emerged as a potent approach for ameliorating both the forcefulness and the stability of unsupervised classification results. One of the major problems in clustering ensembles is to find the best consensus function. Finding final partition from different clustering results requires skillfulness and robustness of the classification algorithm. In addition, the major problem with the consensus function is its sensitivity to the used data sets quality. This limitation is due to the existence of noisy, silence or redundant data. This paper proposes a novel consensus function of cluster ensembles based on Multilayer networks technique and a maintenance database method. This maintenance database approach is used in order to handle any given noisy speech and, thus, to guarantee the quality of databases. This can generates good results and efficient data partitions. To show its effectiveness, we support our strategy with empirical evaluation using distorted speech from Aurora speech databases.
- 1 January 2014
- Published by Springer Nature
- p. 666-677
Maintaining Case Based Reasoning Systems Based on Soft Competence Model
- 1 January 2014
- Published by Springer Nature
- p. 666-677
Maintaining Case Based Reasoning Systems Based on Soft Competence Model
- 1 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15439259,p. 573-578
DBSCAN-GM: An improved clustering method based on Gaussian Means and DBSCAN techniques
Clustering is one of the most useful methods of intelligent engineering domain, in which a set of similar objects are categorized into clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, the majority is not robust enough towards noisy data. This paper presents an efficient and effective clustering technique, named DBSCAN-GM that combines Gaussian-Means and DBSCAN algorithms. The idea of DBSCAN-GM is to cover the limitations of DBSCAN, by exploring the benefits of Gaussian-Means: it runs Gaussian-Means to generate small clusters with determined cluster centers, in purpose to estimate the values of DBSAN's parameters. The results of our method show that it is efficient even for large data sets especially data with large dimension and capable to handle noises, contrary to partitioning algorithms such as K-Means or Gaussian-Means. Additionally, DBSCAN-GM does not necessitate any priori information, in contrast to the density clustering DBSCAN obliging two input parameters which are hard to guess, namely Eps (the radius that bounds the neighborhood region of an object) and MinPts (the minimum number of objects that must exist in the objects neighborhood region). Simulative experiments are carried out on a variety of datasets, which highlight the DBSCAN-GM's effectiveness and cluster validity to check the good quality of clustering results.
- 1 June 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15439259,p. 573-578
DBSCAN-GM: An improved clustering method based on Gaussian Means and DBSCAN techniques
Clustering is one of the most useful methods of intelligent engineering domain, in which a set of similar objects are categorized into clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, the majority is not robust enough towards noisy data. This paper presents an efficient and effective clustering technique, named DBSCAN-GM that combines Gaussian-Means and DBSCAN algorithms. The idea of DBSCAN-GM is to cover the limitations of DBSCAN, by exploring the benefits of Gaussian-Means: it runs Gaussian-Means to generate small clusters with determined cluster centers, in purpose to estimate the values of DBSAN's parameters. The results of our method show that it is efficient even for large data sets especially data with large dimension and capable to handle noises, contrary to partitioning algorithms such as K-Means or Gaussian-Means. Additionally, DBSCAN-GM does not necessitate any priori information, in contrast to the density clustering DBSCAN obliging two input parameters which are hard to guess, namely Eps (the radius that bounds the neighborhood region of an object) and MinPts (the minimum number of objects that must exist in the objects neighborhood region). Simulative experiments are carried out on a variety of datasets, which highlight the DBSCAN-GM's effectiveness and cluster validity to check the good quality of clustering results.
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 233-241
COID-FDCM: The Fuzzy Maintained Dendritic Cell Classification Method
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 233-241
COID-FDCM: The Fuzzy Maintained Dendritic Cell Classification Method
- 1 November 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 356-361
WCOID: Maintaining case-based reasoning systems using Weighting, Clustering, Outliers and Internal cases Detection
The success of a Case Based Reasoning (CBR) system depends on the quality of case data and the speed of the retrieval process that can be expensive in time especially when the number of cases gets large. To guarantee this quality, maintenance the contents of a case base becomes necessarily. In this paper, we propose a novel case base maintenance (CBM) policy named WCOID - Weighting, Clustering, Outliers and Internal cases Detection, using, in addition to clustering and outliers detection methods, feature weights in the process of improving the competence of our reduced case base. The purpose of our WCOID case base maintenance policy is to reduce both the storage requirements and search time and to focus on balancing case retrieval efficiency and competence for a large size case base. WCOID is mainly based on the idea that a large case base with weighted features is transformed to a small case base.
- 1 November 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 356-361
WCOID: Maintaining case-based reasoning systems using Weighting, Clustering, Outliers and Internal cases Detection
The success of a Case Based Reasoning (CBR) system depends on the quality of case data and the speed of the retrieval process that can be expensive in time especially when the number of cases gets large. To guarantee this quality, maintenance the contents of a case base becomes necessarily. In this paper, we propose a novel case base maintenance (CBM) policy named WCOID - Weighting, Clustering, Outliers and Internal cases Detection, using, in addition to clustering and outliers detection methods, feature weights in the process of improving the competence of our reduced case base. The purpose of our WCOID case base maintenance policy is to reduce both the storage requirements and search time and to focus on balancing case retrieval efficiency and competence for a large size case base. WCOID is mainly based on the idea that a large case base with weighted features is transformed to a small case base.