Sami Naouali
Research Subjects
Sami Naouali has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Mohamed Charfeddine Mzoughi
Laboratory of Science and Technology for Defense (STD), Military Research Center, Tunis, Tunisia
1 shared publication - Najib Ben Aoun
Al-Baha University
1 shared publication - Semeh Ben Salem
Military Research Center
1 shared publication - Semeh Ben Salem
Virtual Reality and Information Technologies LAB Military Academy of Fondouk Jedid TUNISA
1 shared publication - Zied Chtourou
Sch Aeronaut Specialties, Sfax, Tunisia
1 shared publication
Latest Publications
- 14 June 2024
- Published by Springer Nature in The Visual Computer
- Vol. 41 (3) , 1789-1809
A review on kinship verification from facial information
- 14 June 2024
- Published by Springer Nature in The Visual Computer
- Vol. 41 (3) , 1789-1809
A review on kinship verification from facial information
- 27 March 2021
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 12 (7) , 2069-2090
A rough set based algorithm for updating the modes in categorical clustering
The categorical clustering problem has attracted much attention especially in the last decades since many real world applications produce categorical data. The k-mode algorithm, proposed since 1998, and its multiple variants were widely used in this context. However, they suffer from a great limitation related to the update of the modes in each iteration. The mode in the last step of these algorithms is randomly selected although it is possible to identify many candidate ones. In this paper, a rough density mode selection method is proposed to identify the adequate modes among a list of candidate ones in each iteration of the k-modes. The proposed method, called Density Rough k-Modes (DRk-M) was experimented using real world datasets extracted from the UCI Machine Learning Repository, the Global Terrorism Database (GTD) and a set of collected Tweets. The DRk-M was also compared to many states of the art clustering methods and has shown great efficiency.
- 27 March 2021
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 12 (7) , 2069-2090
A rough set based algorithm for updating the modes in categorical clustering
The categorical clustering problem has attracted much attention especially in the last decades since many real world applications produce categorical data. The k-mode algorithm, proposed since 1998, and its multiple variants were widely used in this context. However, they suffer from a great limitation related to the update of the modes in each iteration. The mode in the last step of these algorithms is randomly selected although it is possible to identify many candidate ones. In this paper, a rough density mode selection method is proposed to identify the adequate modes among a list of candidate ones in each iteration of the k-modes. The proposed method, called Density Rough k-Modes (DRk-M) was experimented using real world datasets extracted from the UCI Machine Learning Repository, the Global Terrorism Database (GTD) and a set of collected Tweets. The DRk-M was also compared to many states of the art clustering methods and has shown great efficiency.
- Open Access
Towards reducing the multidimensionality of OLAP cubes using the Evolutionary Algorithms and Factor Analysis Methods
Data Warehouses are structures with large amount of data collected from heterogeneous sources to be used in a decision support system. Data Warehouses analysis identifies hidden patterns initially unexpected which analysis requires great memory and computation cost. Data reduction methods were proposed to make this analysis easier. In this paper, we present a hybrid approach based on Genetic Algorithms (GA) as Evolutionary Algorithms and the Multiple Correspondence Analysis (MCA) as Analysis Factor Methods to conduct this reduction. Our approach identifies reduced subset of dimensions from the initial subset p where p'<p where it is proposed to find the profile fact that is the closest to reference. GAs identify the possible subsets and the Khi formula of the ACM evaluates the quality of each subset. The study is based on a distance measurement between the reference and n facts profile extracted from the Warehouses.
Open AccessTowards reducing the multidimensionality of OLAP cubes using the Evolutionary Algorithms and Factor Analysis Methods
Data Warehouses are structures with large amount of data collected from heterogeneous sources to be used in a decision support system. Data Warehouses analysis identifies hidden patterns initially unexpected which analysis requires great memory and computation cost. Data reduction methods were proposed to make this analysis easier. In this paper, we present a hybrid approach based on Genetic Algorithms (GA) as Evolutionary Algorithms and the Multiple Correspondence Analysis (MCA) as Analysis Factor Methods to conduct this reduction. Our approach identifies reduced subset of dimensions from the initial subset p where p'<p where it is proposed to find the profile fact that is the closest to reference. GAs identify the possible subsets and the Khi formula of the ACM evaluates the quality of each subset. The study is based on a distance measurement between the reference and n facts profile extracted from the Warehouses.