Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Phishing detection based Associative Classification data mining
2014244 citationsNeda Abdelhamid, Aladdin Ayesh et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Aladdin Ayesh's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aladdin Ayesh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aladdin Ayesh more than expected).
This network shows the impact of papers produced by Aladdin Ayesh. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aladdin Ayesh. The network helps show where Aladdin Ayesh may publish in the future.
Co-authorship network of co-authors of Aladdin Ayesh
This figure shows the co-authorship network connecting the top 25 collaborators of Aladdin Ayesh.
A scholar is included among the top collaborators of Aladdin Ayesh based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Aladdin Ayesh. Aladdin Ayesh is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Arevalillo‐Herráez, Miguel, David Arnau, José Antonio González‐Calero, et al.. (2014). Providing Personalized Guidance in Arithmetic Problem Solving. DMU Open Research Archive (De Montfort University).7 indexed citations
Abdelhamid, Neda, Aladdin Ayesh, & Fadi Thabtah. (2012). An experimental study of three different rule ranking formulas in associative classification. DMU Open Research Archive (De Montfort University). 795–800.6 indexed citations
Braik, Malik, Alaa Sheta, & Aladdin Ayesh. (2007). Image enhancement using particle swarm optimization. DMU Open Research Archive (De Montfort University). 696–701.61 indexed citations
14.
Ayesh, Aladdin, et al.. (2006). Developing a tagset for automated POS tagging in Arabic. DMU Open Research Archive (De Montfort University). 1009–1014.3 indexed citations
15.
Ayesh, Aladdin, et al.. (2006). An application of neural network for extracting Arabic word roots. Annual Conference on Computers. 646–650.3 indexed citations
Ayesh, Aladdin, et al.. (2004). Speech act and blackboard negotiation based communication protocol for real time multiagent systems. DMU Open Research Archive (De Montfort University). 112–120.1 indexed citations
18.
Ayesh, Aladdin. (2003). Perception and emotion based reasoning: a connectionist approach. DMU Open Research Archive (De Montfort University). 27. 119–126.10 indexed citations
19.
Ayesh, Aladdin. (2001). Towards memorizing by adjectives. DMU Open Research Archive (De Montfort University). 123(1323). 24–33.2 indexed citations
20.
Ayesh, Aladdin. (2001). Architectural framework for standardizing internet security using re-usable agents. DMU Open Research Archive (De Montfort University).1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.