for Journals by Title or ISSN
for Articles by Keywords

Publisher: Springer-Verlag   (Total: 2335 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

  First | 3 4 5 6 7 8 9 10 | Last   [Sort by number of followers]   [Restore default list]

Showing 1201 - 1400 of 2335 Journals sorted alphabetically
J. of Community Genetics     Hybrid Journal   (Followers: 1, SJR: 0.727, h-index: 14)
J. of Community Health     Hybrid Journal   (Followers: 8, SJR: 0.921, h-index: 44)
J. of Comparative Physiology A: Neuroethology, Sensory, Neural, and Behavioral Physiology     Hybrid Journal   (Followers: 7, SJR: 1.087, h-index: 74)
J. of Comparative Physiology B : Biochemical, Systemic, and Environmental Physiology     Hybrid Journal   (Followers: 4, SJR: 1.126, h-index: 59)
J. of Compassionate Health Care     Open Access   (Followers: 1)
J. of Computational Analysis and Applications     Hybrid Journal   (SJR: 0.291, h-index: 19)
J. of Computational Electronics     Hybrid Journal   (Followers: 3, SJR: 0.511, h-index: 20)
J. of Computational Neuroscience     Hybrid Journal   (Followers: 19, SJR: 1.068, h-index: 60)
J. of Computer and Systems Sciences Intl.     Hybrid Journal   (SJR: 0.27, h-index: 13)
J. of Computer Science and Technology     Open Access   (Followers: 5, SJR: 0.437, h-index: 31)
J. of Computer Virology and Hacking Techniques     Hybrid Journal   (Followers: 7, SJR: 0.151, h-index: 2)
J. of Computer-Aided Molecular Design     Hybrid Journal   (Followers: 4, SJR: 0.995, h-index: 78)
J. of Computers in Education     Hybrid Journal   (Followers: 7)
J. of Computing in Higher Education     Hybrid Journal   (Followers: 12, SJR: 0.363, h-index: 21)
J. of Consumer Policy     Hybrid Journal   (Followers: 5, SJR: 0.704, h-index: 30)
J. of Contemporary Mathematical Analysis     Hybrid Journal   (SJR: 0.237, h-index: 5)
J. of Contemporary Physics (Armenian Academy of Sciences)     Hybrid Journal   (Followers: 1, SJR: 0.197, h-index: 6)
J. of Contemporary Psychotherapy     Hybrid Journal   (Followers: 4, SJR: 0.397, h-index: 23)
J. of Control Theory and Applications     Hybrid Journal   (Followers: 2, SJR: 0.359, h-index: 19)
J. of Control, Automation and Electrical Systems     Hybrid Journal   (Followers: 7, SJR: 0.231, h-index: 9)
J. of Crop Science and Biotechnology     Hybrid Journal   (Followers: 7)
J. of Cross-Cultural Gerontology     Hybrid Journal   (Followers: 3, SJR: 0.631, h-index: 29)
J. of Cryptographic Engineering     Partially Free   (Followers: 5, SJR: 0.989, h-index: 11)
J. of Cryptology     Hybrid Journal   (Followers: 2, SJR: 1.443, h-index: 55)
J. of Cultural Economics     Hybrid Journal   (Followers: 2, SJR: 0.539, h-index: 29)
J. of Database Marketing & Customer Strategy Management     Hybrid Journal   (Followers: 8, SJR: 0.149, h-index: 8)
J. of Derivatives & Hedge Funds     Hybrid Journal   (Followers: 7, SJR: 0.114, h-index: 5)
J. of Developmental and Physical Disabilities     Hybrid Journal   (Followers: 8, SJR: 0.574, h-index: 29)
J. of Digital Imaging     Hybrid Journal   (Followers: 8, SJR: 0.578, h-index: 35)
J. of Direct Data and Digital Marketing Practice     Hybrid Journal   (Followers: 7, SJR: 0.154, h-index: 6)
J. of Dynamical and Control Systems     Hybrid Journal   (Followers: 2, SJR: 0.4, h-index: 26)
J. of Dynamics and Differential Equations     Hybrid Journal   (SJR: 1.418, h-index: 31)
J. of Earth Science     Hybrid Journal   (Followers: 8, SJR: 0.483, h-index: 16)
J. of Earth System Science     Open Access   (Followers: 40, SJR: 0.448, h-index: 32)
J. of East Asian Linguistics     Hybrid Journal   (Followers: 5, SJR: 0.537, h-index: 20)
J. of Echocardiography     Hybrid Journal   (Followers: 4, SJR: 0.22, h-index: 3)
J. of Economic Growth     Hybrid Journal   (Followers: 23, SJR: 3.273, h-index: 63)
J. of Economic Interaction and Coordination     Hybrid Journal   (SJR: 0.263, h-index: 12)
J. of Economics     Hybrid Journal   (Followers: 9, SJR: 0.418, h-index: 23)
J. of Economics and Finance     Hybrid Journal   (Followers: 6, SJR: 0.272, h-index: 19)
J. of Educational Change     Hybrid Journal   (Followers: 7, SJR: 0.961, h-index: 21)
J. of Elasticity     Hybrid Journal   (Followers: 5, SJR: 0.851, h-index: 45)
J. of Electroceramics     Hybrid Journal   (SJR: 0.577, h-index: 57)
J. of Electronic Materials     Hybrid Journal   (Followers: 3, SJR: 0.609, h-index: 75)
J. of Electronic Testing     Hybrid Journal   (Followers: 2, SJR: 0.372, h-index: 27)
J. of Electronics (China)     Hybrid Journal   (Followers: 4, SJR: 0.112, h-index: 9)
J. of Elementary Science Education     Hybrid Journal   (Followers: 8)
J. of Engineering Mathematics     Hybrid Journal   (SJR: 0.347, h-index: 37)
J. of Engineering Physics and Thermophysics     Hybrid Journal   (Followers: 1, SJR: 0.288, h-index: 11)
J. of Engineering Research     Open Access   (SJR: 0.145, h-index: 5)
J. of Engineering Thermophysics     Hybrid Journal   (Followers: 1, SJR: 0.763, h-index: 9)
J. of Environmental Studies and Sciences     Partially Free   (Followers: 2)
J. of Ethology     Hybrid Journal   (Followers: 2, SJR: 0.609, h-index: 25)
J. of Evolution Equations     Hybrid Journal   (SJR: 0.826, h-index: 26)
J. of Evolutionary Biochemistry and Physiology     Hybrid Journal   (SJR: 0.145, h-index: 11)
J. of Evolutionary Economics     Hybrid Journal   (Followers: 8, SJR: 0.492, h-index: 52)
J. of Experimental and Theoretical Physics     Hybrid Journal   (Followers: 4, SJR: 0.458, h-index: 39)
J. of Experimental Criminology     Hybrid Journal   (Followers: 31, SJR: 1.445, h-index: 28)
J. of Failure Analysis and Prevention     Hybrid Journal   (Followers: 5, SJR: 0.261, h-index: 15)
J. of Family and Economic Issues     Hybrid Journal   (Followers: 6, SJR: 0.396, h-index: 32)
J. of Family Violence     Hybrid Journal   (Followers: 17, SJR: 0.639, h-index: 56)
J. of Financial Services Marketing     Hybrid Journal   (Followers: 3, SJR: 0.273, h-index: 10)
J. of Financial Services Research     Hybrid Journal   (Followers: 16, SJR: 0.572, h-index: 36)
J. of Fixed Point Theory and Applications     Hybrid Journal   (SJR: 0.644, h-index: 13)
J. of Fluorescence     Hybrid Journal   (Followers: 3, SJR: 0.465, h-index: 56)
J. of Food Measurement and Characterization     Hybrid Journal   (SJR: 0.307, h-index: 4)
J. of Food Science and Technology     Hybrid Journal   (Followers: 5, SJR: 0.441, h-index: 29)
J. of Forest Research     Hybrid Journal   (Followers: 3, SJR: 0.495, h-index: 27)
J. of Forestry Research     Hybrid Journal   (Followers: 6, SJR: 0.304, h-index: 14)
J. of Fourier Analysis and Applications     Hybrid Journal   (Followers: 1, SJR: 1.18, h-index: 42)
J. of Friction and Wear     Hybrid Journal   (Followers: 6, SJR: 0.373, h-index: 7)
J. of Fusion Energy     Hybrid Journal   (Followers: 3, SJR: 0.387, h-index: 19)
J. of Gambling Studies     Hybrid Journal   (Followers: 4, SJR: 1.171, h-index: 57)
J. of Gastroenterology     Hybrid Journal   (Followers: 12, SJR: 1.651, h-index: 88)
J. of Gastrointestinal Cancer     Hybrid Journal   (Followers: 3, SJR: 0.304, h-index: 39)
J. of Gastrointestinal Surgery     Hybrid Journal   (Followers: 5, SJR: 1.64, h-index: 99)
J. of General Internal Medicine     Hybrid Journal   (Followers: 13, SJR: 1.804, h-index: 134)
J. of General Plant Pathology     Hybrid Journal   (SJR: 0.554, h-index: 22)
J. of Genetic Counseling     Hybrid Journal   (Followers: 4, SJR: 0.902, h-index: 39)
J. of Genetics     Open Access   (Followers: 4, SJR: 0.458, h-index: 28)
J. of Geodesy     Hybrid Journal   (Followers: 8, SJR: 2.173, h-index: 56)
J. of Geographical Sciences     Hybrid Journal   (Followers: 1, SJR: 0.8, h-index: 23)
J. of Geographical Systems     Hybrid Journal   (Followers: 3, SJR: 0.822, h-index: 39)
J. of Geometric Analysis     Hybrid Journal   (SJR: 1.491, h-index: 27)
J. of Geometry     Hybrid Journal   (Followers: 1, SJR: 0.272, h-index: 15)
J. of Global Optimization     Hybrid Journal   (Followers: 4, SJR: 0.992, h-index: 60)
J. of Global Policy and Governance     Hybrid Journal   (Followers: 8)
J. of Grid Computing     Hybrid Journal   (SJR: 1.414, h-index: 37)
J. of Hand and Microsurgery     Hybrid Journal   (Followers: 1)
J. of Happiness Studies     Hybrid Journal   (Followers: 15, SJR: 0.881, h-index: 39)
J. of Hematopathology     Hybrid Journal   (Followers: 3, SJR: 0.2, h-index: 13)
J. of Heuristics     Hybrid Journal   (Followers: 5, SJR: 1.308, h-index: 50)
J. of High Energy Physics     Hybrid Journal   (Followers: 5, SJR: 1.052, h-index: 153)
J. of Homotopy and Related Structures     Hybrid Journal   (SJR: 0.232, h-index: 2)
J. of Housing and the Built Environment     Hybrid Journal   (Followers: 6, SJR: 0.648, h-index: 28)
J. of Huazhong University of Science and Technology [Medical Sciences]     Hybrid Journal   (SJR: 0.344, h-index: 19)
J. of Ichthyology     Hybrid Journal   (Followers: 4, SJR: 0.304, h-index: 10)
J. of Immigrant and Minority Health     Hybrid Journal   (Followers: 8, SJR: 0.759, h-index: 37)
J. of Inclusion Phenomena and Macrocyclic Chemistry     Hybrid Journal   (Followers: 1, SJR: 0.331, h-index: 46)
J. of Indian Philosophy     Hybrid Journal   (Followers: 11, SJR: 0.127, h-index: 12)
J. of Indian Prosthodontic Society     Open Access   (SJR: 0.164, h-index: 7)
J. of Industrial Microbiology and Biotechnology     Hybrid Journal   (Followers: 12, SJR: 0.966, h-index: 80)
J. of Industry, Competition and Trade     Hybrid Journal   (Followers: 6, SJR: 0.327, h-index: 15)
J. of Infection and Chemotherapy     Hybrid Journal   (Followers: 1, SJR: 0.673, h-index: 46)
J. of Information Technology     Hybrid Journal   (Followers: 49, SJR: 1.474, h-index: 55)
J. of Information Technology Teaching Cases     Hybrid Journal   (Followers: 7)
J. of Infrared, Millimeter and Terahertz Waves     Hybrid Journal   (Followers: 1, SJR: 1.25, h-index: 36)
J. of Inherited Metabolic Disease     Hybrid Journal   (Followers: 2, SJR: 1.389, h-index: 77)
J. of Inorganic and Organometallic Polymers and Materials     Partially Free   (Followers: 7, SJR: 0.338, h-index: 33)
J. of Insect Behavior     Hybrid Journal   (Followers: 9, SJR: 0.569, h-index: 39)
J. of Insect Conservation     Hybrid Journal   (Followers: 10, SJR: 0.872, h-index: 43)
J. of Intelligent and Robotic Systems     Hybrid Journal   (Followers: 2, SJR: 0.629, h-index: 43)
J. of Intelligent Information Systems     Hybrid Journal   (Followers: 1, SJR: 0.691, h-index: 43)
J. of Intelligent Manufacturing     Hybrid Journal   (Followers: 4, SJR: 1.397, h-index: 54)
J. of Interventional Cardiac Electrophysiology     Hybrid Journal   (SJR: 0.93, h-index: 43)
J. of Intl. Business Studies     Hybrid Journal   (Followers: 27, SJR: 4.208, h-index: 130)
J. of Intl. Entrepreneurship     Hybrid Journal   (Followers: 8, SJR: 0.549, h-index: 23)
J. of Intl. Migration and Integration / Revue de l integration et de la migration internationale     Hybrid Journal   (Followers: 12, SJR: 0.308, h-index: 13)
J. of Intl. Relations and Development     Hybrid Journal   (Followers: 20, SJR: 0.793, h-index: 22)
J. of Labor Research     Hybrid Journal   (Followers: 15, SJR: 0.394, h-index: 27)
J. of Logic, Language and Information     Hybrid Journal   (Followers: 6, SJR: 0.288, h-index: 25)
J. of Low Temperature Physics     Hybrid Journal   (Followers: 2, SJR: 0.531, h-index: 52)
J. of Machinery Manufacture and Reliability     Hybrid Journal   (Followers: 2, SJR: 0.203, h-index: 7)
J. of Mammalian Evolution     Hybrid Journal   (Followers: 5, SJR: 1.134, h-index: 37)
J. of Mammary Gland Biology and Neoplasia     Hybrid Journal   (Followers: 1, SJR: 2.252, h-index: 83)
J. of Management and Governance     Hybrid Journal   (Followers: 12, SJR: 0.805, h-index: 33)
J. of Management Control     Hybrid Journal   (Followers: 4, SJR: 0.605, h-index: 6)
J. of Marine Science and Application     Hybrid Journal   (Followers: 3, SJR: 0.439, h-index: 11)
J. of Marine Science and Technology     Hybrid Journal   (Followers: 3, SJR: 0.235, h-index: 19)
J. of Maritime Archaeology     Hybrid Journal   (Followers: 21, SJR: 0.228, h-index: 8)
J. of Market-Focused Management     Hybrid Journal   (Followers: 2)
J. of Marketing Analytics     Hybrid Journal   (Followers: 3)
J. of Material Cycles and Waste Management     Hybrid Journal   (Followers: 3, SJR: 0.449, h-index: 22)
J. of Materials Engineering and Performance     Hybrid Journal   (Followers: 24, SJR: 0.544, h-index: 40)
J. of Materials Science     Hybrid Journal   (Followers: 19, SJR: 0.836, h-index: 123)
J. of Materials Science : Materials in Electronics     Hybrid Journal   (Followers: 3)
J. of Materials Science : Materials in Medicine     Hybrid Journal   (Followers: 4)
J. of Mathematical Biology     Hybrid Journal   (Followers: 12, SJR: 1.011, h-index: 71)
J. of Mathematical Chemistry     Hybrid Journal   (Followers: 5, SJR: 0.497, h-index: 45)
J. of Mathematical Fluid Mechanics     Hybrid Journal   (Followers: 5, SJR: 1.22, h-index: 22)
J. of Mathematical Imaging and Vision     Hybrid Journal   (Followers: 3, SJR: 0.901, h-index: 53)
J. of Mathematical Modelling and Algorithms     Hybrid Journal   (Followers: 2, SJR: 0.414, h-index: 23)
J. of Mathematical Sciences     Hybrid Journal   (SJR: 0.272, h-index: 23)
J. of Mathematics Teacher Education     Hybrid Journal   (Followers: 13, SJR: 1.062, h-index: 20)
J. of Maxillofacial and Oral Surgery     Hybrid Journal   (Followers: 2)
J. of Mechanical Science and Technology     Hybrid Journal   (Followers: 5, SJR: 0.589, h-index: 26)
J. of Medical and Biological Engineering     Hybrid Journal   (Followers: 1, SJR: 0.387, h-index: 18)
J. of Medical Humanities     Hybrid Journal   (Followers: 19, SJR: 0.299, h-index: 18)
J. of Medical Systems     Hybrid Journal   (Followers: 1, SJR: 0.717, h-index: 44)
J. of Medical Toxicology     Hybrid Journal   (Followers: 4, SJR: 0.874, h-index: 28)
J. of Medical Ultrasonics     Hybrid Journal   (Followers: 2, SJR: 0.18, h-index: 13)
J. of Medicine and the Person     Hybrid Journal  
J. of Membrane Biology     Hybrid Journal   (Followers: 1, SJR: 0.738, h-index: 82)
J. of Micro-Bio Robotics     Hybrid Journal   (SJR: 0.28, h-index: 3)
J. of Microbiology     Hybrid Journal   (Followers: 7, SJR: 0.741, h-index: 43)
J. of Mining Science     Hybrid Journal   (Followers: 5, SJR: 0.317, h-index: 16)
J. of Molecular Evolution     Hybrid Journal   (Followers: 9, SJR: 0.952, h-index: 108)
J. of Molecular Histology     Hybrid Journal   (Followers: 2, SJR: 0.755, h-index: 48)
J. of Molecular Medicine     Hybrid Journal   (Followers: 15, SJR: 2.165, h-index: 113)
J. of Molecular Modeling     Hybrid Journal   (Followers: 4, SJR: 0.466, h-index: 50)
J. of Molecular Neuroscience     Partially Free   (Followers: 9, SJR: 0.988, h-index: 69)
J. of Mountain Science     Hybrid Journal   (Followers: 3, SJR: 0.418, h-index: 15)
J. of Muscle Research and Cell Motility     Hybrid Journal   (Followers: 1, SJR: 1.264, h-index: 55)
J. of Nanoparticle Research     Hybrid Journal   (Followers: 3, SJR: 0.583, h-index: 84)
J. of Natural Medicines     Hybrid Journal   (SJR: 0.602, h-index: 28)
J. of Near-Death Studies     Hybrid Journal   (Followers: 2)
J. of Nephrology     Hybrid Journal   (Followers: 5, SJR: 0.689, h-index: 55)
J. of Network and Systems Management     Hybrid Journal   (SJR: 0.466, h-index: 26)
J. of Neural Transmission     Hybrid Journal   (Followers: 2, SJR: 1.034, h-index: 86)
J. of Neuro-Oncology     Hybrid Journal   (Followers: 3, SJR: 1.274, h-index: 90)
J. of Neuroimmune Pharmacology     Hybrid Journal   (Followers: 1, SJR: 1.662, h-index: 45)
J. of Neurology     Hybrid Journal   (Followers: 13, SJR: 1.429, h-index: 105)
J. of NeuroVirology     Hybrid Journal   (Followers: 1, SJR: 0.979, h-index: 69)
J. of Nondestructive Evaluation     Hybrid Journal   (Followers: 9, SJR: 0.863, h-index: 27)
J. of Nonlinear Science     Hybrid Journal   (Followers: 1, SJR: 1.887, h-index: 42)
J. of Nonverbal Behavior     Hybrid Journal   (Followers: 3, SJR: 0.723, h-index: 47)
J. of Nuclear Cardiology     Hybrid Journal   (SJR: 1.024, h-index: 68)
J. of Nutrition, Health and Aging     Hybrid Journal   (Followers: 18, SJR: 0.919, h-index: 60)
J. of Obstetrics and Gynecology of India     Hybrid Journal   (Followers: 7, SJR: 0.214, h-index: 6)
J. of Occupational Rehabilitation     Hybrid Journal   (Followers: 12, SJR: 0.811, h-index: 51)
J. of Ocean Engineering and Marine Energy     Hybrid Journal   (Followers: 1)
J. of Ocean University of China (English Edition)     Hybrid Journal   (Followers: 1, SJR: 0.237, h-index: 11)
J. of Oceanography     Hybrid Journal   (Followers: 7, SJR: 0.796, h-index: 52)
J. of Ocular Biology, Diseases, and Informatics     Hybrid Journal   (SJR: 0.183, h-index: 11)
J. of Optical and Fiber Communications Reports     Hybrid Journal   (Followers: 3)
J. of Optics     Hybrid Journal   (Followers: 5, SJR: 0.214, h-index: 8)
J. of Optimization Theory and Applications     Hybrid Journal   (Followers: 3, SJR: 0.898, h-index: 65)
J. of Ornithology     Hybrid Journal   (Followers: 22)
J. of Orofacial Orthopedics / Fortschritte der Kieferorthopädie     Hybrid Journal   (SJR: 0.574, h-index: 33)
J. of Orthopaedic Science     Hybrid Journal   (Followers: 5, SJR: 0.708, h-index: 48)
J. of Paleolimnology     Hybrid Journal   (Followers: 5, SJR: 0.984, h-index: 64)
J. of Parasitic Diseases     Hybrid Journal   (Followers: 2, SJR: 0.298, h-index: 9)
J. of Pediatric Neuropsychology     Hybrid Journal   (Followers: 1)
J. of Pest Science     Hybrid Journal   (Followers: 2, SJR: 1.341, h-index: 28)
J. of Pharmaceutical Health Care and Sciences     Open Access  
J. of Pharmaceutical Innovation     Hybrid Journal   (Followers: 8, SJR: 0.524, h-index: 17)
J. of Pharmaceutical Investigation     Hybrid Journal   (Followers: 1, SJR: 0.331, h-index: 6)
J. of Pharmacokinetics and Pharmacodynamics     Hybrid Journal   (Followers: 21, SJR: 0.708, h-index: 46)
J. of Phase Equilibria and Diffusion     Hybrid Journal   (Followers: 19, SJR: 0.433, h-index: 36)
J. of Philosophical Logic     Hybrid Journal   (Followers: 8, SJR: 0.704, h-index: 26)

  First | 3 4 5 6 7 8 9 10 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover Evolutionary Intelligence
  [SJR: 0.947]   [H-I: 14]   [1 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1864-5917 - ISSN (Online) 1864-5909
   Published by Springer-Verlag Homepage  [2335 journals]
  • Mutual information for feature selection: estimation or counting?
    • Authors: Hoai Bach Nguyen; Bing Xue; Peter Andreae
      Pages: 95 - 110
      Abstract: Abstract In classification, feature selection is an important pre-processing step to simplify the dataset and improve the data representation quality, which makes classifiers become better, easier to train, and understand. Because of an ability to analyse non-linear interactions between features, mutual information has been widely applied to feature selection. Along with counting approaches, a traditional way to calculate mutual information, many mutual information estimations have been proposed to allow mutual information to work directly on continuous datasets. This work focuses on comparing the effect of counting approach and kernel density estimation (KDE) approach in feature selection using particle swarm optimisation as a search mechanism. The experimental results on 15 different datasets show that KDE can work well on both continuous and discrete datasets. In addition, feature subsets evolved by KDE achieves similar or better classification performance than the counting approach. Furthermore, the results on artificial datasets with various interactions show that KDE is able to capture correctly the interaction between features, in both relevance and redundancy, which can not be achieved by using the counting approach.
      PubDate: 2016-08-20
      DOI: 10.1007/s12065-016-0143-4
      Issue No: Vol. 9, No. 3 (2016)
  • A new bats echolocation-based algorithm for single objective optimisation
    • Authors: Nafrizuan Mat Yahya; M. Osman Tokhi; Hyreil Anuar Kasdirin
      Pages: 1 - 20
      Abstract: Abstract Bats sonar algorithm (BSA) as a swarm intelligence approach utilises the concept of echolocation of bats to find prey. However, the algorithm is unable to achieve good precision and fast convergence rate to the optimum solution. With this in mind, an adaptive bats sonar algorithm is introduced with new paradigms of real bats echolocation behaviour. The performance of the algorithm is validated through rigorous tests with several single objective optimisation benchmark test functions. The obtained results show that the proposed scheme outperforms the BSA in terms of accuracy and convergence speed and can be efficiently employed to solve engineering problems.
      PubDate: 2016-02-18
      DOI: 10.1007/s12065-016-0134-5
      Issue No: Vol. 9, No. 1-2 (2016)
  • MCOA: mutated and self-adaptive cuckoo optimization algorithm
    • Authors: Seyed Alireza Mohseni; Tony Wong; Vincent Duchaine
      Pages: 21 - 36
      Abstract: Abstract As with other nature-inspired algorithms, the cuckoo optimization algorithm (COA) produces a population of candidate solutions to find the (near-) optimal solutions to a problem. In this paper, several modifications, including a dynamic mutation operator, are proposed for this algorithm. Design of experiments is employed to determine factors controlling the value of parameters and the target levels of those values to achieve desirable output. The efficiency of the modified COA algorithm is substantiated with the help of several optimization test problems. The results are then compared to other well-known algorithms such as PSO, DE and harmony search using a non-parametric statistical procedure. In order to analyze its effectiveness, the proposed modified COA is applied to a feature selection problem and spacecraft attitude control problem.
      PubDate: 2016-04-12
      DOI: 10.1007/s12065-016-0135-4
      Issue No: Vol. 9, No. 1-2 (2016)
  • An upper and lower CUSUM for signal normalization in the dendritic cell
    • Authors: Mohamad Farhan Mohamad Mohsin; Abdul Razak Hamdan; Azuraliza Abu Bakar
      Pages: 37 - 51
      Abstract: Abstract Signal normalization is a part of signal formalization which is a vital data pre-processing constraint required for the functioning of the dendritic cell algorithm. In existing applications, most normalization algorithms are developed purposely for a specific application with drawing on human domain expertise and very few algorithms are designed for general problems. This makes it difficult for the inexperienced user to exploit existing approaches to another problem, particularly when the initial information about the problem is limited. Therefore, this study proposes a new signal normalization method for the dendritic cell algorithm that uses the statistical upper and lower cumulative sum so that the algorithm can be applied to general classification problems. In addition, a new method to calculate the anomaly threshold based on the average mature-contact antigen value is presented to suit the proposed algorithm. The proposed model is evaluated by applying it to eight universal classification datasets and assessing its performance according to four measurement metrics: detection rate, specificity, false alarm rate, and accuracy. Its performance is compared with that of the existing dendritic cell algorithm and four non-bio-inspired classifiers, namely, rough set, decision tree, naïve Bayes, and multilayer perceptron. The results show that the proposed model outperforms the existing model and the other classifiers as well as demonstrates a significant improvement in terms of specificity, false alarm rate, and accuracy for all datasets. This indicates that the proposed normalization approach can be applied to general classification problems and can improve detection performance.
      PubDate: 2016-04-20
      DOI: 10.1007/s12065-016-0136-3
      Issue No: Vol. 9, No. 1-2 (2016)
  • Anatomy of a portfolio optimizer under a limited budget constraint
    • Authors: Igor Deplano; Giovanni Squillero; Alberto Tonda
      Abstract: Abstract Predicting the market’s behavior to profit from trading stocks is far from trivial. Such a task becomes even harder when investors do not have large amounts of money available, and thus cannot influence this complex system in any way. Machine learning paradigms have been already applied to financial forecasting, but usually with no restrictions on the size of the investor’s budget. In this paper, we analyze an evolutionary portfolio optimizer for the management of limited budgets, dissecting each part of the framework, discussing in detail the issues and the motivations that led to the final choices. Expected returns are modeled resorting to artificial neural networks trained on past market data, and the portfolio composition is chosen by approximating the solution to a multi-objective constrained problem. An investment simulator is eventually used to measure the portfolio performance. The proposed approach is tested on real-world data from New York’s, Milan’s and Paris’ stock exchanges, exploiting data from June 2011 to May 2014 to train the framework, and data from June 2014 to July 2015 to validate it. Experimental results demonstrate that the presented tool is able to obtain a more than satisfying profit for the considered time frame.
      PubDate: 2016-09-02
      DOI: 10.1007/s12065-016-0144-3
  • Foreword: special issue on evolutionary computer vision and pattern
    • Authors: Stefano Cagnoni; Mengjie Zhang
      PubDate: 2016-08-18
      DOI: 10.1007/s12065-016-0142-5
  • Improving performance for classification with incomplete data using
           wrapper-based feature selection
    • Authors: Cao Truong Tran; Mengjie Zhang; Peter Andreae; Bing Xue
      Abstract: Abstract Missing values are an unavoidable problem of many real-world datasets. Inadequate treatment of missing values may result in large errors on classification; thus, dealing well with missing values is essential for classification. Feature selection has been well known for improving classification, but it has been seldom used for improving classification with incomplete datasets. Moreover, some classifiers such as C4.5 are able to directly classify incomplete datasets, but they often generate more complex classifiers with larger classification errors. The purpose of this paper is to propose a wrapper-based feature selection method to improve the ability of a classifier able to classify incomplete datasets. In order to achieve the purpose, the feature selection method evaluates feature subsets using a classifier able to classify incomplete datasets. Empirical results on 14 datasets using particle swarm optimisation for searching feature subsets and C4.5 for evaluating the feature subsets in the feature selection method show that the wrapper-based feature selection is not only able to improve classification accuracy of the classifier, but also able to reduce the size of trees generated by the classifier.
      PubDate: 2016-08-09
      DOI: 10.1007/s12065-016-0141-6
  • Reduced projection angles for binary tomography with particle aggregation
    • Authors: Mohammad Majid al-Rifaie; Tim Blackwell
      Abstract: Abstract This paper extends particle aggregate reconstruction technique (PART), a reconstruction algorithm for binary tomography based on the movement of particles. PART supposes that pixel values are particles, and that particles diffuse through the image, staying together in regions of uniform pixel value known as aggregates. In this work, a variation of this algorithm is proposed and a focus is placed on reducing the number of projections and whether this impacts the reconstruction of images. The algorithm is tested on three phantoms of varying sizes and numbers of forward projections and compared to filtered back projection, a random search algorithm and to SART, a standard algebraic reconstruction method. It is shown that the proposed algorithm outperforms the aforementioned algorithms on small numbers of projections. This potentially makes the algorithm attractive in scenarios where collecting less projection data are inevitable.
      PubDate: 2016-08-08
      DOI: 10.1007/s12065-016-0140-7
  • Population based ant colony optimization for reconstructing ECG signals
    • Authors: Yih-Chun Cheng; Tom Hartmann; Pei-Yun Tsai; Martin Middendorf
      Abstract: Abstract A population based ant colony optimization algorithm (PACO) for the reconstruction of electrocardiogram (ECG) signals is proposed. Specifically, the PACO finds a subset of nonzero positions of a sparse wavelet domain ECG signal vector that is used for the reconstruction of the signal. A time window is used by the proposed PACO for fixing certain decisions of the ants during the run of the algorithm. The optimization behaviour of the PACO is compared with various algorithms from the literature for ECG signal reconstruction, and with two random search heuristics. Experimental results are presented for ECG signals from the MIT-BIT Arrhythmia database. The influence of several algorithmic parameters and of a local search procedure is evaluated. The results show that the proposed PACO algorithm reconstructs ECG signals with high accuracy.
      PubDate: 2016-07-30
      DOI: 10.1007/s12065-016-0139-0
  • On the complexity of the El Farol Bar game: a sensitivity analysis
    • Authors: Shu-Heng Chen; Umberto Gostoli
      Abstract: Abstract In this paper, we carry out a sensitivity analysis for an agent-based model of the use of public resources as manifested by the El Farol Bar problem. An early study using the same model has shown that a good-society equilibrium, characterized by both economic efficiency and economic equality, can be achieved probabilistically by a von Neumann network, and can be achieved surely with the presence of some agents having social preferences, such as the inequity-averse preference or the ‘keeping-up-with-the-Joneses’ preference. In this study, we examine this fundamental result by exploring the inherent complexity of the model; specifically, we address the effect of the three key parameters related to size, namely, the network size, the neighborhood size, and the memory size. We find that social preferences still play an important role over all the sizes considered. Nonetheless, it is also found that when network size becomes large, the parameter, the bar capacity (the attendance threshold), may also play a determining role.
      PubDate: 2016-07-02
      DOI: 10.1007/s12065-016-0138-1
  • Evolving goal-driven multi-agent communication: what, when, and to whom
    • Authors: Alhanoof Althnian; Arvin Agah
      Abstract: Abstract This paper presents an evolutionary approach that, given a performance goal, produces a communication strategy that can improve a multi-agent system’s performance with respect to the desired goal. The evolved strategy determines what, when, and to whom agents communicate. The proposed approach further enables tuning the trade-off between the performance goal and communication cost, to produce a strategy that achieves a good balance between the two objectives, according the system’s designer needs. Experiments are designed to evaluate the approach using the Wumpus World application domain, with variations of three factors: fitness parameters (including objectives’ weights and action and communication costs), fitness goal, and simulation environment. Results show that the system’s performance can be highly tuned by controlling communication, and that the presented approach has significant utilization in improving the performance with respect to the goal.
      PubDate: 2016-06-13
      DOI: 10.1007/s12065-016-0137-2
  • A hybrid evolutionary algorithm for the symbolic modeling of
           multiple-time-scale dynamical systems
    • Authors: Theodore W. Cornforth; Hod Lipson
      Pages: 149 - 164
      Abstract: Abstract Natural and artificial dynamical systems in the real world often have dynamics at multiple time scales. Such dynamics can contribute substantially to the complexity of a dynamical system and increase the difficulty with which it can be analyzed. Although evolutionary algorithms have been proposed that are amenable to the automated modeling of dynamical systems, none have explicitly taken into account multiple time scales or leveraged the information about these dynamics that is inherent in experimental observations. We propose a hybrid approach to the design of models for multiple-time-scale dynamical systems that combines an evolutionary algorithm with other metaheuristics and conventional nonlinear regression. With only minimal human-supplied domain knowledge, the algorithm automates the process of analyzing raw experimental observations and creating an interpretable symbolic model of the system under study. We describe the algorithm in detail and demonstrate its applicability to a variety of both physical and simulated systems. In addition, we study the performance and scalability of the algorithm under different types of dynamics, varying levels of experimental noise, and other factors relevant to the practical application of the algorithm.
      PubDate: 2015-01-31
      DOI: 10.1007/s12065-015-0126-x
      Issue No: Vol. 8, No. 4 (2015)
  • Quadratic assignment problem: a landscape analysis
    • Authors: Mohammad-H. Tayarani-N.; Adam Prügel-Bennett
      Pages: 165 - 184
      Abstract: Abstract The anatomy of the fitness landscape for the quadratic assignment problem is studied in this paper. We study the properties of both random problems, and real-world problems. Using auto-correlation as a measure for the landscape ruggedness, we study the landscape of the problems and show how this property is related to the problem matrices with which the problems are represented. Our main goal in this paper is to study new properties of the fitness landscape, which have not been studied before, and we believe are more capable of reflecting the problem difficulties. Using local search algorithm which exhaustively explore the plateaus and the local optima, we explore the landscape, store all the local optima we find, and study their properties. The properties we study include the time it takes for a local search algorithm to find local optima, the number of local optima, the probability of reaching the global optimum, the expected cost of the local optima around the global optimum and the basin of attraction of the global and local optima. We study the properties for problems of different sizes, and through extrapolations, we show how the properties change with the system size and why the problem becomes harder as the system size grows. In our study we show how the real-world problems are similar to, or different from the random problems. We also try to show what properties of the problem matrices make the landscape of the real problems be different from or similar to one another.
      PubDate: 2015-05-22
      DOI: 10.1007/s12065-015-0132-z
      Issue No: Vol. 8, No. 4 (2015)
  • An on-line Pittsburgh LCS for the Three-Cornered Coevolution Framework
    • Authors: Syahaneim Marzukhi; Will N. Browne; Mengjie Zhang
      Pages: 185 - 201
      Abstract: Abstract The Three-Cornered Coevolution Framework describes a method that is capable of addressing classification tasks through coevolution (coadaptive evolution) where three different agents (i.e. a generation agent and two classification agents) learn and adapt to the changes of the problems without human involvement. Here, artificial problems can be generated in concert with classification agents in order to provide insight into their relationships. Previous work on the Two-Cornered Coevolution Framework provided foundation for implementing the system that was able to set-up the problem’s difficulty appropriately while triggering the coevolutionary process. However, the triggering process was set manually without utilising the third agent as proposed in the original framework to perform this task. Previous work on the Three-Cornered Coevolution introduced the third agent (a new classification agent) to trigger the coevolutionary process within the system, where its functionality and effect on the system requires investigation. This paper details the implementation for this case; two classification agents that use different styles of learning techniques (e.g. supervised versus reinforcement learning techniques) is adapted in the classification agents to learn the various classification problems. Ultimately, Learning Classifier System (LCS) is chosen to be implemented in the participating agents. LCS has several potential characteristics, such as interpretability, generalization capability and variations in representation, that are suitable for the system. Experiments show that the Pittsburgh-style LCS with the adaptation of Tabu Search technique in S capable to autonomously adjust the problem’s difficulty and generate a wide range of problems for classification. The adaptation of A-PLUS to an ‘on-line’ system is successful implemented. Further, the classification agents (i.e. R and I) are able to solve the classification tasks where the classification performance are varied. The Three-Cornered Coevolution Framework offers a great potential for autonomous learning and provides useful insight into coevolution learning over the standard studies of pattern recognition. The system is capable of autonomously generating various problems, learning and providing insight into each learning system’s ability by determining the problem domains where they perform relatively well. This is in contrast to humans having to determine the problem domains.
      PubDate: 2015-11-18
      DOI: 10.1007/s12065-015-0133-y
      Issue No: Vol. 8, No. 4 (2015)
  • Special issue on the 20th anniversary of XCS
    • Authors: Tim Kovacs; Muhammad Iqbal; Kamran Shafi; Ryan Urbanowicz
      Pages: 51 - 53
      PubDate: 2015-04-12
      DOI: 10.1007/s12065-015-0131-0
      Issue No: Vol. 8, No. 2-3 (2015)
  • A brief history of learning classifier systems: from CS-1 to XCS and its
    • Authors: Larry Bull
      Pages: 55 - 70
      Abstract: Abstract The direction set by Wilson’s XCS is that modern Learning Classifier Systems can be characterized by their use of rule accuracy as the utility metric for the search algorithm(s) discovering useful rules. Such searching typically takes place within the restricted space of co-active rules for efficiency. This paper gives an overview of the evolution of Learning Classifier Systems up to XCS, and then of some of the subsequent developments of Wilson’s algorithm to different types of learning.
      PubDate: 2015-01-29
      DOI: 10.1007/s12065-015-0125-y
      Issue No: Vol. 8, No. 2-3 (2015)
  • Rule reduction by selection strategy in XCS with adaptive action map
    • Authors: Masaya Nakata; Pier Luca Lanzi; Keiki Takadama
      Pages: 71 - 87
      Abstract: Abstract The XCS classifier system is a rule-based evolutionary machine learning system. XCS evolves classifiers in order to learn generalized solutions. The XCS with adaptive action mapping (XCSAM) is inherited from XCS, which evolves a best action map where it evolves classifiers that advocate the best action in every state. Accordingly, XCSAM can potentially evolve solutions that are more compact than XCS, which in contrast focuses on a complete action map. Previous experimental results however have shown that, in some problems, XCSAM may produce solutions with more classifiers than XCS. In this paper, we initially show that the original fitness-based selection strategy of XCS produces non effective classifiers which are not likely to be in the best action map (i.e., they are inaccurate ones or do not have best actions) in XCSAM. Then, we introduce a new selection strategy for XCSAM that promotes the evolution of classifiers advocating the best action map and thus produces more compact solutions. The new strategy selects classifiers based both on their fitness (like XCS) and on the parameter optimality of action of XCSAM. The result is a pressure towards classifiers that are accurate and advocate the best actions. We present analyses showing that the new selection strategy successfully enables XCSAM to focus on classifiers having best actions. Our experimental results show that XCSAM with the new selection strategy (called XCSAM-SS) can evolve smaller solutions than XCS (and the original XCSAM) both in single-step and multi-step problems. As a consequence, XCSAM can also learn with smaller iterations than XCS in the single-step problem. Our conclusion is that, as the best action map potentially has a compact solution, XCSAM evolves a much compact solution than XCS by adding an adequate selection strategy.
      PubDate: 2015-04-02
      DOI: 10.1007/s12065-015-0130-1
      Issue No: Vol. 8, No. 2-3 (2015)
  • ExSTraCS 2.0: description and evaluation of a scalable learning classifier
    • Authors: Ryan J. Urbanowicz; Jason H. Moore
      Pages: 89 - 116
      Abstract: Abstract Algorithmic scalability is a major concern for any machine learning strategy in this age of ‘big data’. A large number of potentially predictive attributes is emblematic of problems in bioinformatics, genetic epidemiology, and many other fields. Previously, ExSTraCS was introduced as an extended Michigan-style supervised learning classifier system that combined a set of powerful heuristics to successfully tackle the challenges of classification, prediction, and knowledge discovery in complex, noisy, and heterogeneous problem domains. While Michigan-style learning classifier systems are powerful and flexible learners, they are not considered to be particularly scalable. For the first time, this paper presents a complete description of the ExSTraCS algorithm and introduces an effective strategy to dramatically improve learning classifier system scalability. ExSTraCS 2.0 addresses scalability with (1) a rule specificity limit, (2) new approaches to expert knowledge guided covering and mutation mechanisms, and (3) the implementation and utilization of the TuRF algorithm for improving the quality of expert knowledge discovery in larger datasets. Performance over a complex spectrum of simulated genetic datasets demonstrated that these new mechanisms dramatically improve nearly every performance metric on datasets with 20 attributes and made it possible for ExSTraCS to reliably scale up to perform on related 200 and 2000-attribute datasets. ExSTraCS 2.0 was also able to reliably solve the 6, 11, 20, 37, 70, and 135 multiplexer problems, and did so in similar or fewer learning iterations than previously reported, with smaller finite training sets, and without using building blocks discovered from simpler multiplexer problems. Furthermore, ExSTraCS usability was made simpler through the elimination of previously critical run parameters.
      PubDate: 2015-04-03
      DOI: 10.1007/s12065-015-0128-8
      Issue No: Vol. 8, No. 2-3 (2015)
  • XCSF with tile coding in discontinuous action-value landscapes
    • Authors: Pier Luca Lanzi; Daniele Loiacono
      Pages: 117 - 132
      Abstract: Abstract Tile coding is an effective reinforcement learning method that uses a rather ingenious generalization mechanism based on (1) a carefully designed parameter setting and (2) the assumption that nearby states in the problem space will correspond to similar payoff predictions in the action-value function. Previously, we extended XCSF with tile coding prediction and compared it to tabular tile coding, showing that (1) XCSF performs as well as parameter-optimized tile coding, while also (2) evolving individualized parameter settings in each problem subspace. Our comparison was based on a set of well-known reinforcement learning environments (2D Gridworld and the Mountain Car) that involved no action-value discontinuities and so posed no challenge to tabular tile coding. In this paper, we go a step further and test XCSF with tile coding on a set of problems designed to challenge tile coding by introducing discontinuities in the action value landscape. The new testbed (called MazeWorld) extends 2D Gridworld with impenetrable obstacles, a conceptually simple modification that can dramatically increase the problem complexity for tabular tile coding. We compare four versions of XCSF with tile coding (each adapting a different set of parameters) to tabular tile coding on four problems of increasing complexity. We show that our system (1) needs fewer training problems than standard tile coding to reach an optimal policy; (2) it can evolve adequate coding parameters in each subspace without any previous knowledge; and that (3) even when XCSF is not allowed to evolve these parameters, the genetic algorithm will still adapt classifier conditions to properly decompose the problem into subspaces thus being much less sensitive to the parameter settings than tabular tile coding.
      PubDate: 2015-04-11
      DOI: 10.1007/s12065-015-0129-7
      Issue No: Vol. 8, No. 2-3 (2015)
  • XCS-SL: a rule-based genetic learning system for sequence labeling
    • Authors: Masaya Nakata; Tim Kovacs; Keiki Takadama
      Pages: 133 - 148
      Abstract: Abstract Sequence labeling is an interesting classification domain where, like normal classification, every input has a class label, but unlike normal classification, prediction of an input’s label may depend on the values of other inputs or their classes, and so a learner may need to refer to inputs and classes at different time stamps to classify the current input. This is more difficult because a learner does not know where and how many inputs are needed to classify the current input. Our interest is in learning general rules for sequence labeling. The XCS algorithm is a rule-based knowledge discovery system powered by a genetic algorithm which has often been used for classification. Here we present XCS-SL, an extension of XCS classifier system which can be applicable to sequence labeling. Towards an application of Learning Classifier System (LCS) to sequence labeling, we propose a new classifier condition with memory (called a variable-length condition) and a rule-discovery system for the new classifier condition, which enables XCS to apply it to sequence labeling. In XCS-SL, classification rules (called “classifiers” here) can include extra conditions on previous inputs, which act as memories. In sequence labeling, the number of conditions/memories needed may be different for each input, hence, using a fixed number of conditions (i.e., fixed-length condition) for all classifiers is not a good solution. Instead, XCS-SL classifiers have a variable-length condition to provide more or less memory. The genetic algorithm can grow and shrink conditions to find a suitable memory size. On two synthetic benchmark problems XCS-SL learns optimal classifiers, and on a real-world sequence labeling task it derives high classification accuracy and discovers interesting knowledge that shows dependencies between inputs at different times. The comprehensively described system is the first application of a LCS to sequence labeling and we consider it a promising direction for future work.
      PubDate: 2015-03-10
      DOI: 10.1007/s12065-015-0127-9
      Issue No: Vol. 8, No. 2-3 (2015)
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016