default search action
Ashraf M. Abdelbar
Person information
- affiliation: American University in Cairo, Cairo, Egypt
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c45]Ashraf M. Abdelbar
, Thomas Humphries
An Extension of the iMOACO$\mathbb {_R}$ Algorithm Based on Layer-Set Selection. ANTS Conference 2022: 266-274
2010 – 2019
- 2019
- [j25]Ashraf M. Abdelbar
Parameter Self-Adaptation in an Ant Colony Algorithm for Continuous Optimization. IEEE Access 7: 18464-18479 (2019) - 2018
- [c44]Ashraf M. Abdelbar
Does the ACO \mathbb _R Algorithm Benefit from the Use of Crossover? ANTS Conference 2018: 342-350 - [c43]Ashraf M. Abdelbar, Islam El-Nabarawy, Khalid M. Salama, Donald C. Wunsch:
Matrix Factorization Based Collaborative Filtering With Resilient Stochastic Gradient Descent. IJCNN 2018: 1-7 - [c42]Ashraf M. Abdelbar, Khalid M. Salama, Jesús Guillermo Falcón-Cardona
An Adaptive Recombination-Based Extension of the iMOACOR Algorithm. SSCI 2018: 735-742 - 2017
- [j24]Khalid M. Salama, Ashraf M. Abdelbar, Ayah M. Helal
Instance-based classification with Ant Colony Optimization. Intell. Data Anal. 21(4): 913-944 (2017) - [j23]Khalid M. Salama, Ashraf M. Abdelbar:
Learning cluster-based classification systems with ant colony optimization algorithms. Swarm Intell. 11(3-4): 211-242 (2017) - [c41]Ashraf M. Abdelbar, Khalid M. Salama:
The effect of the number of ants parameter in the ACOR algorithm: A run-time profiling study. SSCI 2017: 1-8 - [c40]Ashraf M. Abdelbar, Khalid M. Salama:
A sugeno-based search width decay schedule in the ACOR algorithm. SSCI 2017: 1-8 - [c39]Ashraf M. Abdelbar, Khalid M. Salama:
Solution recombination in an indicator-based many-objective ant colony optimizer for continuous search spaces. SSCI 2017: 1-8 - [c38]Ayah M. Helal
Integrated particle swarm and evolutionary algorithm approaches to the quadratic assignment problem. SSCI 2017: 1-5 - 2016
- [j22]Khalid M. Salama, Ashraf M. Abdelbar, Ismail M. Anwar
Data reduction for classification with ant colony algorithms. Intell. Data Anal. 20(5): 1021-1059 (2016) - [c37]Khalid M. Salama, Ashraf M. Abdelbar:
Using Ant Colony Optimization to Build Cluster-Based Classification Systems. ANTS Conference 2016: 210-222 - [c36]Ashraf M. Abdelbar, Khalid M. Salama:
An extension of the ACOR algorithm with time-decaying search width, with application to neural network training. CEC 2016: 2360-2366 - [c35]Islam El-Nabarawy
Biclustering ARTMAP collaborative filtering recommender system. IJCNN 2016: 2986-2991 - [c34]Ashraf M. Abdelbar, Khalid M. Salama:
Ant Colony Optimization applied to the regularization process of a High Order neural Network. SSCI 2016: 1-8 - 2015
- [j21]Khalid M. Salama, Ashraf M. Abdelbar:
Learning neural network structures with ant colony algorithms. Swarm Intell. 9(4): 229-265 (2015) - [c33]Ayah M. Helal
An improved Particle Swarm Optimization/Tabu search approach to the Quadratic Assignment Problem. CEC 2015: 220-226 - [c32]Ismail M. Anwar
ADR-Miner: An ant-based data reduction algorithm for classification. CEC 2015: 515-521 - [c31]Ismail M. Anwar
Instance Selection with Ant Colony Optimization. INNS Conference on Big Data 2015: 248-256 - [c30]Ashraf M. Abdelbar, Khalid M. Salama:
A Gradient-Guided ACO Algorithm for Neural Network Learning. SSCI 2015: 1133-1140 - [c29]Khalid M. Salama, Ashraf M. Abdelbar, Fernando E. B. Otero:
Investigating Evaluation Measures in Ant Colony Algorithms for Learning Decision Tree Classifiers. SSCI 2015: 1146-1153 - 2014
- [j20]Ahmed Ezzat, Ashraf M. Abdelbar, Donald C. Wunsch II:
A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem. Memetic Comput. 6(1): 19-29 (2014) - [j19]Ayah M. Helal
Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem. Memetic Comput. 6(4): 241-254 (2014) - [j18]Islam El-Nabarawy
Advanced learning methods and exponent regularization applied to a high order neural network. Neural Comput. Appl. 25(3-4): 897-910 (2014) - [c28]Khalid M. Salama, Ashraf M. Abdelbar:
A Novel Ant Colony Algorithm for Building Neural Network Topologies. ANTS Conference 2014: 1-12 - [c27]Khalid M. Salama, Ashraf M. Abdelbar:
Exploring the Impact of Different Classification Quality Functions in an ACO Algorithm for Learning Neural Network Structures. IJCCI (ECTA) 2014: 137-144 - [c26]Ahmed Ezzat, Ashraf M. Abdelbar, Donald C. Wunsch II:
An extended EigenAnt colony system applied to the sequential ordering problem. SIS 2014: 276-282 - 2013
- [j17]Khalid M. Salama, Ashraf M. Abdelbar, Fernando E. B. Otero, Alex Alves Freitas
Utilizing multiple pheromones in an ant-based algorithm for continuous-attribute classification rule discovery. Appl. Soft Comput. 13(1): 667-675 (2013) - [j16]Ashraf M. Abdelbar, Donald C. Wunsch II:
Search Context Awareness in Several Ant Colony Optimization Models. Int. J. Comput. Their Appl. 20(2): 97-110 (2013) - [c25]Ahmed Ezzat, Ashraf M. Abdelbar:
A less exploitative variation of the Enhanced Ant Colony System applied to SOP. IEEE Congress on Evolutionary Computation 2013: 1917-1924 - [c24]Islam El-Nabarawy
Levenberg-Marquardt and Conjugate Gradient methods applied to a high-order neural network. IJCNN 2013: 1-7 - 2012
- [j15]Ashraf M. Abdelbar:
Alpha-Beta Pruning and Althöfer's Pathology-Free Negamax Algorithm. Algorithms 5(4): 521-528 (2012) - [c23]Ashraf M. Abdelbar:
Is there a computational advantage to representing evaporation rate in ant colony optimization as a gaussian random variable? GECCO 2012: 1-8 - [c22]Ashraf M. Abdelbar, Donald C. Wunsch:
Improving the performance of MAX-MIN ant system on the TSP using stubborn ants. GECCO (Companion) 2012: 1395-1396 - [c21]Ashraf M. Abdelbar, Donald C. Wunsch II:
Promoting Search Diversity in Ant Colony Optimization with Stubborn Ants. Complex Adaptive Systems 2012: 456-462 - 2011
- [j14]Khalid M. Salama, Ashraf M. Abdelbar, Alex Alves Freitas
Multiple pheromone types and other extensions to the Ant-Miner classification rule discovery algorithm. Swarm Intell. 5(3-4): 149-182 (2011) - [c20]Khalid M. Salama, Ashraf M. Abdelbar:
Exploring different rule quality evaluation functions in ACO-based classification algorithms. SWIS 2011: 88-95 - 2010
- [c19]Khalid M. Salama, Ashraf M. Abdelbar:
Extensions to the Ant-Miner Classification Rule Discovery Algorithm. ANTS Conference 2010: 167-178
2000 – 2009
- 2009
- [c18]Ashraf M. Abdelbar, Eskandar Tooma
Incorporating swarm behavior into the adaptation mechanism of an order-driven artificial financial market. SIS 2009: 104-108 - 2008
- [c17]Ashraf M. Abdelbar:
Stubborn ants. SIS 2008: 1-5 - 2007
- [c16]Ashraf M. Abdelbar, Manar Ibrahim Hosny:
A Self-Adaptive Evolutionary Algorithm Applied to Bayesian Networks. CATA 2007: 118-122 - [c15]Ashraf M. Abdelbar, Suzan Abdelshahid, Donald C. Wunsch II:
Gaussian Versus Cauchy Membership Functions in Fuzzy PSO. IJCNN 2007: 2902-2907 - [c14]Shawn T. Chivers, Gene A. Tagliarini, Ashraf M. Abdelbar:
An Evolutionary Optimization Approach to Cost-Based Abduction, with Comparison to PSO. IJCNN 2007: 2926-2930 - [c13]Shawn T. Chivers, Gene A. Tagliarini, Ashraf M. Abdelbar:
Finding Least Cost Proofs Using a Hierarchical PSO. SIS 2007: 156-161 - 2006
- [j13]Ashraf M. Abdelbar, Sarah H. Gheita, Heba A. Amer:
Exploring the fitness landscape and the run-time behaviour of an iterated local search algorithm for cost-based abduction. J. Exp. Theor. Artif. Intell. 18(3): 365-386 (2006) - [j12]Ashraf M. Abdelbar, Deena Hassan, Gene A. Tagliarini, Sridhar Narayan:
Receptive field optimization for ensemble encoding. Neural Comput. Appl. 15(1): 1-8 (2006) - 2005
- [j11]Ashraf M. Abdelbar, Sahar Attia:
Finding MAPs for Large Belief Networks Using Evolutionary Computation. Int. J. Comput. Their Appl. 12(1): 16-20 (2005) - [j10]Ashraf M. Abdelbar, Mohamed Hefny:
An efficient LP-based admissible heuristic for cost-based abduction. J. Exp. Theor. Artif. Intell. 17(3): 297-303 (2005) - [j9]Ashraf M. Abdelbar, Mostafa A. El-Hemaly, Emad A. M. Andrews, Donald C. Wunsch II:
Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction. Neural Networks 18(5-6): 755-764 (2005) - [c12]Ashraf M. Abdelbar:
Towards an improved twin-page method for rapid transaction undo recovery. AICCSA 2005: 38 - [c11]Ashraf M. Abdelbar, Plínio Roberto Souza Vilela, Mário Jino:
Mapping faults to failures in SQL manipulation commands. AICCSA 2005: 39 - 2004
- [j8]Ashraf M. Abdelbar:
Approximating cost-based abduction is NP-hard . Artif. Intell. 159(1-2): 231-239 (2004) - [c10]M. Mohy Mahmoud, Ashraf M. Abdelbar, Maha Bali, Mohamed El Hagry:
Effective Stock Market Prediction with Neural Networks Optimized by Population-Oriented Simulated Annealing. IASSE 2004: 131-134 - 2003
- [j7]Ashraf M. Abdelbar, Emad A. M. Andrews, Donald C. Wunsch II:
Abductive reasoning with recurrent neural networks. Neural Networks 16(5-6): 665-673 (2003) - [c9]Ashraf M. Abdelbar, Suzan Abdelshahid:
Swarm optimization with instinct-driven particles. IEEE Congress on Evolutionary Computation 2003: 777-782 - [c8]Ashraf M. Abdelbar, M. Mokhtar:
A k-elitist max-min ant system approach to cost-based abduction. IEEE Congress on Evolutionary Computation 2003: 2635-2641 - 2002
- [j6]Ashraf M. Abdelbar, Sahar Attia, Gene A. Tagliarini:
A hybridization of Bayesian and neural learning. Neurocomputing 48(1-4): 443-453 (2002) - 2001
- [c7]Ashraf M. Abdelbar, Awad H. Khalil, Emad A. M. Andrews:
A Hybrid Annealing-Neural Approach to Knowledge Discovery in Databases. IRI 2001: 42-47 - 2000
- [j5]Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi:
The complexity of approximating MAPs for belief networks with bounded probabilities. Artif. Intell. 124(2): 283-288 (2000)
1990 – 1999
- 1999
- [c6]Ashraf M. Abdelbar, Murad Assaggaf:
Recurrent high-order networks for probabilistic explanation. IJCNN 1999: 1515-1520 - [c5]Ashraf M. Abdelbar, Sridhar Narayan:
Using simulated annealing to optimize receptive fields for MLP networks with ensemble encoding. IJCNN 1999: 4079-4083 - [c4]Ashraf M. Abdelbar:
A linear constraint satisfaction approach to Bayesian networks. IJCNN 1999: 4404-4408 - 1998
- [j4]Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi:
Approximating MAPs for Belief Networks is NP-Hard and Other Theorems. Artif. Intell. 102(1): 21-38 (1998) - [j3]Ashraf M. Abdelbar:
An Algorithm for Finding MAPs for Belief Networks Through Cost-Based Abduction. Artif. Intell. 104(1-2): 331-338 (1998) - [j2]Ashraf M. Abdelbar, Gene A. Tagliarini:
Using neural network learning in an Othello evaluation function. J. Exp. Theor. Artif. Intell. 10(2): 217-229 (1998) - [j1]Ashraf M. Abdelbar:
Achieving superior generalisation with a high order neural network. Neural Comput. Appl. 7(2): 141-146 (1998) - [c3]Amr Goneid, Ibrahim Farag, Ashraf M. Abdelbar, Abear Kamel:
A Mahalanobis Distance Error Measure for Backpropagation Neural Networks. NC 1998: 572-576 - 1997
- [c2]Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi:
A parallel hybrid genetic algorithm simulated annealing approach to finding most probable explanations on Bayesian belief networks. ICNN 1997: 450-455 - 1996
- [c1]Ashraf M. Abdelbar, Gene A. Tagliarini:
HONEST: a new high order feedforward neural network. ICNN 1996: 1257-1262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: