7 citations · 10 across the 10 of their papers we have counts for
4 papers · 1 filter
Efficient Geometric-based Computation of the String Subsequence Kernel
Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi
Kernel methods are powerful tools in machine learning. They have to be computationally efficient. In this paper, we present a novel Geometric-based approach to compute efficiently…
Rational Kernels for Arabic Stemming and Text Classification
Attia Nehar, Djelloul Ziadi, Hadda Cherroun
In this paper, we address the problems of Arabic Text Classification and stemming using Transducers and Rational Kernels. We introduce a new stemming technique based on the use of…
Mining Frequent Itemsets: a Formal Unification
Slimane Oulad-Naoui, Hadda Cherroun, Djelloul Ziadi
It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been de…
Construction of rational expression from tree automata using a generalization of Arden's Lemma
Younes Guellouma, Ludovic Mignot, Hadda Cherroun +1
Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this pape…