Noureddine Aribi

Dr. Noureddine Aribi

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
NBNassim Belmecheri
Nassim Belmecheri
NANoureddine Aribi
Noureddine Aribi
NLNadjib Lazaar
Nadjib Lazaar
YLYahia Lebbah
Yahia Lebbah
SLSamir LOUDNI
Samir LOUDNI
Pattern mining is a valuable tool for exploratory data analysis, but identifying relevant patterns for a specific user is challenging. Various interestingness measures have been developed to evaluate patterns, but they may not efficiently estimate user-specific functions. Learning user-specific functions by ranking patterns has been proposed, but this requires significant time and training samples. In this paper, we present a solution that formulates the problem of learning pattern ranking functions as a multi-criteria decision-making problem. Our approach uses an analytic hierarchy process (AHP) to elicit weights for different interestingness measures based on user preference. We also propose an active learning mode with a sensitivity-based heuristic to minimize user ranking queries while still providing high-quality results. Experiments show that our approach significantly reduces running time and returns precise pattern ranking while being robust to user mistakes, compared to state-of-the-art approaches.

1 June 2024 in Constraints
Verified
Journal Article
Closed access
PDF file
AHArnold Hien
Arnold Hien
NANoureddine Aribi
Noureddine Aribi
SLSamir LOUDNI
Samir LOUDNI
YLYahia Lebbah
Yahia Lebbah
AOAbdelkader Ouali
Abdelkader Ouali
AZAlbrecht Zimmermann
Albrecht Zimmermann

27 May 2023
Verified
Book Chapter
Closed access
PDF file
AHArnold Hien
Arnold Hien
SLSamir LOUDNI
Samir LOUDNI
NANoureddine Aribi
Noureddine Aribi
AOAbdelkader Ouali
Abdelkader Ouali
AZAlbrecht Zimmermann
Albrecht Zimmermann

2 November 2025 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ACAli Cherid
Ali Cherid
NANoureddine Aribi
Noureddine Aribi
MBMohammed Said Belaid
Mohammed Said Belaid
YLYahia Lebbah
Yahia Lebbah


21 November 2022 in Research Square
Verified
Preprint
Open access
PDF file
NBNassim Belmecheri
Nassim Belmecheri
NANoureddine Aribi
Noureddine Aribi
NLNadjib Lazaar
Nadjib Lazaar
YLYahia Lebbah
Yahia Lebbah
SLSamir LOUDNI
Samir LOUDNI
Discovering relevant patterns for a particular user remains a challenging tasks in data mining. Several approaches have been proposed to learn user-specific pattern ranking functions. These approaches generalize well, but at the expense of the running time. On the other hand, several measures are often used to evaluate the interestingness of patterns, with the hope to reveal a ranking that is as close as possible to the user-specific ranking. In this paper, we formulate the problem of learning pattern ranking functions as a multicriteria decision making problem. Our approach aggregates different interestingness measures into a single weighted linear ranking function, using an interactive learning procedure that operates in either passive or active modes. A fast learning step is used for eliciting the weights of all the measures by mean of pairwise comparisons. This approach is based on Analytic Hierarchy Process (AHP), and a set of user-ranked patterns to build a preference matrix, which compares the importance of measures according to the user-specific interestingness. A sensitivity based heuristic is proposed for the active learning mode, in order to insure high quality results with few user ranking queries. Experiments conducted on well-known datasets show that our approach significantly reduces the running time and returns precise pattern ranking, while being robust to user-error compared with state-of-the-art approaches.