Fawaz Alsolami

Fawaz Alsolami

Auto-generated profile, based on publicly available information

Fawaz Alsolami

King Abdullah University of Science and Technology

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 January 2020
Verified
Book
Closed access
FAFawaz Alsolami
Fawaz Alsolami
MAMohammad Azad
Mohammad Azad
ICIgor Chikalov
Igor Chikalov
MMMikhail Moshkov
Mikhail Moshkov

14 March 2019 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
FAFawaz Alsolami
Fawaz Alsolami
TATalha Amin
Talha Amin
MMMikhail Moshkov
Mikhail Moshkov
Beata ZieloskoBeata Zielosko
Beata Zielosko
KŻKrzysztof Żabiński
Krzysztof Żabiński
In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.

1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
FAFawaz Alsolami
Fawaz Alsolami
ICIgor Chikalov
Igor Chikalov
MMMikhail Moshkov
Mikhail Moshkov
Beata ZieloskoBeata Zielosko
Beata Zielosko

1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
FAFawaz Alsolami
Fawaz Alsolami
ICIgor Chikalov
Igor Chikalov
MMMikhail Moshkov
Mikhail Moshkov
Beata ZieloskoBeata Zielosko
Beata Zielosko

1 January 2013 in Procedia Computer Science
Verified
Journal Article
Open access
FAFawaz Alsolami
Fawaz Alsolami
ICIgor Chikalov
Igor Chikalov
MMMikhail Moshkov
Mikhail Moshkov
Beata ZieloskoBeata Zielosko
Beata Zielosko

1 January 2014 in Procedia Computer Science
Verified
Journal Article
Open access
FAFawaz Alsolami
Fawaz Alsolami
ICIgor Chikalov
Igor Chikalov
MMMikhail Moshkov
Mikhail Moshkov
Knowledge representation and extraction are very important tasks in data mining. In this work, we proposed a variety of rule-based greedy algorithms that able to obtain knowledge contained in a given dataset as a series of inhibitory rules containing an expression “attribute ≠ value” on the right-hand side. The main goal of this paper is to determine based on rule characteristics, rule length and coverage, whether the proposed rule heuristics are statistically significantly different or not; if so, we aim to identify the best performing rule heuristics for minimization of rule length and maximization of rule coverage.Friedman test with Nemenyi post-hoc are used to compare the greedy algorithms statistically against each other for length and coverage. The experiments are carried out on real datasets from UCI Machine Learning Repository. For leading heuristics, the constructed rules are compared with optimal ones obtained based on dynamic programming approach. The results seem to be promising for the best heuristics: the average relative difference between length (coverage) of constructed and optimal rules is at most 2.27% (7%, respectively). Furthermore, the quality of classifiers based on sets of inhibitory rules constructed by the considered heuristics are compared against each other, and the results show that the three best heuristics from the point of view classification accuracy coincides with the three well-performed heuristics from the point of view of rule length minimization