for Journals by Title or ISSN
for Articles by Keywords
help

Publisher: Springer-Verlag   (Total: 2341 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  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 2341 Journals sorted alphabetically
3D Research     Hybrid Journal   (Followers: 19, SJR: 0.214, h-index: 10)
4OR: A Quarterly J. of Operations Research     Hybrid Journal   (Followers: 9, SJR: 1.073, h-index: 25)
AAPS J.     Hybrid Journal   (Followers: 17, SJR: 1.192, h-index: 74)
AAPS PharmSciTech     Hybrid Journal   (Followers: 6, SJR: 0.718, h-index: 54)
Abdominal Imaging     Hybrid Journal   (Followers: 16, SJR: 0.723, h-index: 60)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 2, SJR: 0.447, h-index: 12)
Academic Psychiatry     Full-text available via subscription   (Followers: 22, SJR: 0.492, h-index: 32)
Academic Questions     Hybrid Journal   (Followers: 7, SJR: 0.135, h-index: 6)
Accreditation and Quality Assurance: J. for Quality, Comparability and Reliability in Chemical Measurement     Hybrid Journal   (Followers: 26, SJR: 0.378, h-index: 30)
Acoustical Physics     Hybrid Journal   (Followers: 10, SJR: 0.355, h-index: 20)
Acoustics Australia     Hybrid Journal  
Acta Analytica     Hybrid Journal   (Followers: 7, SJR: 0.387, h-index: 6)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1, SJR: 0.624, h-index: 34)
Acta Biotheoretica     Hybrid Journal   (Followers: 5, SJR: 0.419, h-index: 25)
Acta Diabetologica     Hybrid Journal   (Followers: 12, SJR: 1.318, h-index: 46)
Acta Endoscopica     Hybrid Journal   (Followers: 1, SJR: 0.113, h-index: 8)
acta ethologica     Hybrid Journal   (Followers: 4, SJR: 0.465, h-index: 23)
Acta Geochimica     Hybrid Journal   (Followers: 3)
Acta Geodaetica et Geophysica     Hybrid Journal   (Followers: 1, SJR: 0.294, h-index: 13)
Acta Geotechnica     Hybrid Journal   (Followers: 6, SJR: 1.818, h-index: 22)
Acta Informatica     Hybrid Journal   (Followers: 5, SJR: 0.524, h-index: 32)
Acta Mathematica     Hybrid Journal   (Followers: 10, SJR: 8.021, h-index: 47)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2, SJR: 0.53, h-index: 29)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 5, SJR: 0.406, h-index: 30)
Acta Mathematica Vietnamica     Hybrid Journal   (SJR: 0.451, h-index: 5)
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal   (SJR: 0.22, h-index: 20)
Acta Mechanica     Hybrid Journal   (Followers: 18, SJR: 0.898, h-index: 52)
Acta Mechanica Sinica     Hybrid Journal   (Followers: 4, SJR: 0.426, h-index: 29)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 5, SJR: 0.525, h-index: 18)
Acta Meteorologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.524, h-index: 14)
Acta Neurochirurgica     Hybrid Journal   (Followers: 6, SJR: 0.833, h-index: 73)
Acta Neurologica Belgica     Hybrid Journal   (SJR: 0.348, h-index: 27)
Acta Neuropathologica     Hybrid Journal   (Followers: 3, SJR: 6.61, h-index: 117)
Acta Oceanologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.295, h-index: 17)
Acta Parasitologica     Hybrid Journal   (Followers: 9, SJR: 0.581, h-index: 28)
Acta Physiologiae Plantarum     Hybrid Journal   (Followers: 2, SJR: 0.551, h-index: 39)
Acta Politica     Hybrid Journal   (Followers: 13, SJR: 0.658, h-index: 20)
adhäsion KLEBEN & DICHTEN     Hybrid Journal   (Followers: 5, SJR: 0.103, h-index: 4)
ADHD Attention Deficit and Hyperactivity Disorders     Hybrid Journal   (Followers: 20, SJR: 0.871, h-index: 15)
Adhesion Adhesives & Sealants     Hybrid Journal   (Followers: 7)
Administration and Policy in Mental Health and Mental Health Services Research     Partially Free   (Followers: 14, SJR: 0.795, h-index: 40)
Adsorption     Hybrid Journal   (Followers: 4, SJR: 0.774, h-index: 52)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 3, SJR: 0.319, h-index: 15)
Advances in Atmospheric Sciences     Hybrid Journal   (Followers: 34, SJR: 0.959, h-index: 44)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15, SJR: 1.255, h-index: 44)
Advances in Contraception     Hybrid Journal   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 52, SJR: 1.113, h-index: 14)
Advances in Gerontology     Partially Free   (Followers: 8, SJR: 0.141, h-index: 3)
Advances in Health Sciences Education     Hybrid Journal   (Followers: 23, SJR: 1.397, h-index: 42)
Advances in Manufacturing     Hybrid Journal   (Followers: 3, SJR: 0.2, h-index: 4)
Advances in Polymer Science     Hybrid Journal   (Followers: 40, SJR: 0.637, h-index: 89)
Advances in Therapy     Hybrid Journal   (Followers: 5, SJR: 0.79, h-index: 44)
Aegean Review of the Law of the Sea and Maritime Law     Hybrid Journal   (Followers: 7)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2, SJR: 0.882, h-index: 23)
Aerobiologia     Hybrid Journal   (Followers: 1, SJR: 0.511, h-index: 36)
Aesthetic Plastic Surgery     Hybrid Journal   (Followers: 8, SJR: 0.821, h-index: 49)
African Archaeological Review     Hybrid Journal   (Followers: 14, SJR: 0.612, h-index: 24)
Afrika Matematika     Hybrid Journal   (Followers: 1, SJR: 0.248, h-index: 6)
AGE     Hybrid Journal   (Followers: 7, SJR: 1.358, h-index: 33)
Ageing Intl.     Hybrid Journal   (Followers: 7, SJR: 0.337, h-index: 10)
Aggiornamenti CIO     Hybrid Journal   (Followers: 1)
Aging Clinical and Experimental Research     Hybrid Journal   (Followers: 3, SJR: 0.529, h-index: 55)
Agricultural Research     Hybrid Journal   (Followers: 3)
Agriculture and Human Values     Hybrid Journal   (Followers: 12, SJR: 1.197, h-index: 49)
Agroforestry Systems     Hybrid Journal   (Followers: 20, SJR: 0.64, h-index: 56)
Agronomy for Sustainable Development     Hybrid Journal   (Followers: 10, SJR: 1.732, h-index: 59)
AI & Society     Hybrid Journal   (Followers: 7, SJR: 0.171, h-index: 19)
AIDS and Behavior     Hybrid Journal   (Followers: 13, SJR: 2.006, h-index: 71)
Air Quality, Atmosphere & Health     Hybrid Journal   (Followers: 2, SJR: 0.706, h-index: 19)
Akupunktur & Aurikulomedizin     Full-text available via subscription   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 2, SJR: 0.566, h-index: 18)
Algebra Universalis     Hybrid Journal   (Followers: 2, SJR: 0.388, h-index: 22)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1, SJR: 0.868, h-index: 20)
Algorithmica     Hybrid Journal   (Followers: 7, SJR: 0.898, h-index: 56)
Allergo J.     Full-text available via subscription   (Followers: 1, SJR: 0.183, h-index: 20)
Allergo J. Intl.     Hybrid Journal   (Followers: 2)
Alpine Botany     Hybrid Journal   (Followers: 3, SJR: 0.729, h-index: 20)
ALTEX : Alternatives to Animal Experimentation     Open Access   (Followers: 3, SJR: 1.392, h-index: 32)
AMBIO     Hybrid Journal   (Followers: 14, SJR: 1.094, h-index: 87)
American J. of Cardiovascular Drugs     Hybrid Journal   (Followers: 10, SJR: 0.864, h-index: 39)
American J. of Community Psychology     Hybrid Journal   (Followers: 24, SJR: 1.237, h-index: 83)
American J. of Criminal Justice     Hybrid Journal   (Followers: 5, SJR: 0.634, h-index: 13)
American J. of Cultural Sociology     Hybrid Journal   (Followers: 11, SJR: 0.283, h-index: 3)
American J. of Dance Therapy     Hybrid Journal   (Followers: 4, SJR: 0.175, h-index: 13)
American J. of Potato Research     Hybrid Journal   (Followers: 2, SJR: 0.558, h-index: 35)
American J. of Psychoanalysis     Hybrid Journal   (Followers: 21, SJR: 0.293, h-index: 13)
American Sociologist     Hybrid Journal   (Followers: 11, SJR: 0.18, h-index: 13)
Amino Acids     Hybrid Journal   (Followers: 7, SJR: 1.362, h-index: 83)
AMS Review     Partially Free   (Followers: 4)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 5, SJR: 0.21, h-index: 37)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 4, SJR: 0.665, h-index: 7)
Analysis in Theory and Applications     Hybrid Journal  
Analysis of Verbal Behavior     Hybrid Journal   (Followers: 4)
Analytical and Bioanalytical Chemistry     Hybrid Journal   (Followers: 28, SJR: 1.096, h-index: 123)
Anatomical Science Intl.     Hybrid Journal   (Followers: 2, SJR: 0.301, h-index: 26)
Angewandte Schmerztherapie und Palliativmedizin     Hybrid Journal  
Angiogenesis     Hybrid Journal   (Followers: 3, SJR: 2.212, h-index: 69)
Animal Cognition     Hybrid Journal   (Followers: 14, SJR: 1.122, h-index: 55)
Annales françaises de médecine d'urgence     Hybrid Journal   (Followers: 1, SJR: 0.156, h-index: 4)
Annales Henri Poincaré     Hybrid Journal   (Followers: 3, SJR: 1.377, h-index: 32)
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4)
Annali dell'Universita di Ferrara     Hybrid Journal   (SJR: 0.504, h-index: 14)
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1, SJR: 1.167, h-index: 26)
Annals of Behavioral Medicine     Hybrid Journal   (Followers: 11, SJR: 2.112, h-index: 98)
Annals of Biomedical Engineering     Hybrid Journal   (Followers: 18, SJR: 1.182, h-index: 94)
Annals of Combinatorics     Hybrid Journal   (Followers: 3, SJR: 0.849, h-index: 15)
Annals of Data Science     Hybrid Journal   (Followers: 8)
Annals of Dyslexia     Hybrid Journal   (Followers: 9, SJR: 0.857, h-index: 40)
Annals of Finance     Hybrid Journal   (Followers: 27, SJR: 0.686, h-index: 14)
Annals of Forest Science     Hybrid Journal   (Followers: 4, SJR: 0.929, h-index: 57)
Annals of Global Analysis and Geometry     Hybrid Journal   (Followers: 1, SJR: 1.136, h-index: 23)
Annals of Hematology     Hybrid Journal   (Followers: 13, SJR: 1.117, h-index: 62)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6, SJR: 0.593, h-index: 42)
Annals of Microbiology     Hybrid Journal   (Followers: 9, SJR: 0.402, h-index: 26)
Annals of Nuclear Medicine     Hybrid Journal   (Followers: 5, SJR: 0.68, h-index: 45)
Annals of Operations Research     Hybrid Journal   (Followers: 8, SJR: 1.186, h-index: 78)
Annals of Regional Science     Hybrid Journal   (Followers: 7, SJR: 0.405, h-index: 42)
Annals of Software Engineering     Hybrid Journal   (Followers: 12)
Annals of Solid and Structural Mechanics     Hybrid Journal   (Followers: 9, SJR: 0.553, h-index: 8)
Annals of Surgical Oncology     Hybrid Journal   (Followers: 11, SJR: 1.902, h-index: 127)
Annals of Telecommunications     Hybrid Journal   (Followers: 7, SJR: 0.315, h-index: 25)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1, SJR: 0.931, h-index: 31)
Antonie van Leeuwenhoek     Hybrid Journal   (Followers: 5, SJR: 0.992, h-index: 87)
Apidologie     Hybrid Journal   (Followers: 4, SJR: 1.14, h-index: 57)
APOPTOSIS     Hybrid Journal   (Followers: 7, SJR: 1.554, h-index: 87)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2, SJR: 0.354, h-index: 27)
Applications of Mathematics     Hybrid Journal   (Followers: 1, SJR: 0.274, h-index: 20)
Applied Biochemistry and Biotechnology     Hybrid Journal   (Followers: 44, SJR: 0.575, h-index: 80)
Applied Biochemistry and Microbiology     Hybrid Journal   (Followers: 17, SJR: 0.267, h-index: 26)
Applied Categorical Structures     Hybrid Journal   (Followers: 2, SJR: 0.361, h-index: 21)
Applied Composite Materials     Hybrid Journal   (Followers: 45, SJR: 0.705, h-index: 35)
Applied Entomology and Zoology     Partially Free   (Followers: 2, SJR: 0.554, h-index: 34)
Applied Geomatics     Hybrid Journal   (Followers: 3, SJR: 0.323, h-index: 9)
Applied Geophysics     Hybrid Journal   (Followers: 7, SJR: 0.541, h-index: 13)
Applied Intelligence     Hybrid Journal   (Followers: 14, SJR: 0.777, h-index: 43)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 3, SJR: 0.358, h-index: 34)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 4, SJR: 0.955, h-index: 33)
Applied Mathematics - A J. of Chinese Universities     Hybrid Journal   (SJR: 0.275, h-index: 8)
Applied Mathematics and Mechanics     Hybrid Journal   (Followers: 4, SJR: 0.37, h-index: 26)
Applied Microbiology and Biotechnology     Hybrid Journal   (Followers: 61, SJR: 1.262, h-index: 161)
Applied Physics A     Hybrid Journal   (Followers: 7, SJR: 0.535, h-index: 121)
Applied Physics B: Lasers and Optics     Hybrid Journal   (Followers: 23, SJR: 0.983, h-index: 104)
Applied Psychophysiology and Biofeedback     Hybrid Journal   (Followers: 6, SJR: 0.677, h-index: 47)
Applied Research in Quality of Life     Hybrid Journal   (Followers: 10, SJR: 0.288, h-index: 15)
Applied Solar Energy     Hybrid Journal   (Followers: 15, SJR: 0.251, h-index: 6)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4, SJR: 0.351, h-index: 9)
Aquaculture Intl.     Hybrid Journal   (Followers: 21, SJR: 0.613, h-index: 40)
Aquarium Sciences and Conservation     Hybrid Journal   (Followers: 1)
Aquatic Ecology     Hybrid Journal   (Followers: 30, SJR: 0.646, h-index: 44)
Aquatic Geochemistry     Hybrid Journal   (Followers: 3, SJR: 0.764, h-index: 39)
Aquatic Sciences     Hybrid Journal   (Followers: 12, SJR: 1.172, h-index: 53)
Arabian J. for Science and Engineering     Hybrid Journal   (Followers: 5, SJR: 0.345, h-index: 20)
Arabian J. of Geosciences     Hybrid Journal   (Followers: 1, SJR: 0.417, h-index: 16)
Archaeological and Anthropological Sciences     Hybrid Journal   (Followers: 21, SJR: 1.056, h-index: 15)
Archaeologies     Hybrid Journal   (Followers: 12, SJR: 0.397, h-index: 13)
Archiv der Mathematik     Hybrid Journal   (Followers: 1, SJR: 0.597, h-index: 29)
Archival Science     Hybrid Journal   (Followers: 51, SJR: 0.804, h-index: 22)
Archive for History of Exact Sciences     Hybrid Journal   (Followers: 7, SJR: 0.28, h-index: 15)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 1, SJR: 0.946, h-index: 23)
Archive for Rational Mechanics and Analysis     Hybrid Journal   (SJR: 4.091, h-index: 66)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4, SJR: 0.865, h-index: 40)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4, SJR: 2.841, h-index: 40)
Archives of Dermatological Research     Hybrid Journal   (Followers: 6, SJR: 0.9, h-index: 65)
Archives of Environmental Contamination and Toxicology     Hybrid Journal   (Followers: 10, SJR: 0.846, h-index: 84)
Archives of Gynecology and Obstetrics     Hybrid Journal   (Followers: 16, SJR: 0.695, h-index: 47)
Archives of Microbiology     Hybrid Journal   (Followers: 8, SJR: 0.702, h-index: 85)
Archives of Orthopaedic and Trauma Surgery     Hybrid Journal   (Followers: 8, SJR: 1.039, h-index: 56)
Archives of Osteoporosis     Hybrid Journal   (Followers: 2, SJR: 1.092, h-index: 13)
Archives of Sexual Behavior     Hybrid Journal   (Followers: 9, SJR: 1.198, h-index: 74)
Archives of Toxicology     Hybrid Journal   (Followers: 15, SJR: 1.595, h-index: 76)
Archives of Virology     Hybrid Journal   (Followers: 5, SJR: 1.086, h-index: 90)
Archives of Women's Mental Health     Hybrid Journal   (Followers: 13, SJR: 1.264, h-index: 50)
Archivio di Ortopedia e Reumatologia     Hybrid Journal  
Archivum Immunologiae et Therapiae Experimentalis     Hybrid Journal   (Followers: 2, SJR: 1.2, h-index: 42)
ArgoSpine News & J.     Hybrid Journal   (SJR: 0.102, h-index: 3)
Argumentation     Hybrid Journal   (Followers: 4, SJR: 0.295, h-index: 18)
Arid Ecosystems     Hybrid Journal   (Followers: 3)
Arkiv för Matematik     Hybrid Journal   (Followers: 1, SJR: 0.948, h-index: 22)
Arnold Mathematical J.     Hybrid Journal   (Followers: 1)
Arthropod-Plant Interactions     Hybrid Journal   (Followers: 2, SJR: 0.797, h-index: 17)
Arthroskopie     Hybrid Journal   (Followers: 1, SJR: 0.145, h-index: 8)
Artificial Intelligence and Law     Hybrid Journal   (Followers: 10, SJR: 0.288, h-index: 25)
Artificial Intelligence Review     Hybrid Journal   (Followers: 15, SJR: 0.948, h-index: 48)
Artificial Life and Robotics     Hybrid Journal   (Followers: 8, SJR: 0.231, h-index: 14)
Asia Europe J.     Hybrid Journal   (Followers: 4, SJR: 0.247, h-index: 9)
Asia Pacific Education Review     Hybrid Journal   (Followers: 9, SJR: 0.371, h-index: 17)
Asia Pacific J. of Management     Hybrid Journal   (Followers: 11, SJR: 1.676, h-index: 50)
Asia-Pacific Education Researcher     Hybrid Journal   (Followers: 11, SJR: 0.353, h-index: 13)
Asia-Pacific Financial Markets     Hybrid Journal   (Followers: 2, SJR: 0.19, h-index: 15)
Asia-Pacific J. of Atmospheric Sciences     Hybrid Journal   (Followers: 20, SJR: 1.006, h-index: 14)
Asian Business & Management     Hybrid Journal   (Followers: 7, SJR: 0.41, h-index: 10)
Asian J. of Business Ethics     Hybrid Journal   (Followers: 7)
Asian J. of Criminology     Hybrid Journal   (Followers: 5, SJR: 0.263, h-index: 8)
AStA Advances in Statistical Analysis     Hybrid Journal   (Followers: 2, SJR: 0.681, h-index: 15)
AStA Wirtschafts- und Sozialstatistisches Archiv     Hybrid Journal   (Followers: 5, SJR: 0.195, h-index: 5)
ästhetische dermatologie & kosmetologie     Full-text available via subscription  
Astronomy and Astrophysics Review     Hybrid Journal   (Followers: 21, SJR: 4.511, h-index: 44)
Astronomy Letters     Hybrid Journal   (Followers: 19, SJR: 0.58, h-index: 30)
Astronomy Reports     Hybrid Journal   (Followers: 12, SJR: 0.473, h-index: 23)
Astrophysical Bulletin     Hybrid Journal   (Followers: 2, SJR: 0.469, h-index: 11)

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover Applied Intelligence
  [SJR: 0.777]   [H-I: 43]   [14 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1573-7497 - ISSN (Online) 0924-669X
   Published by Springer-Verlag Homepage  [2341 journals]
  • An angle based constrained many-objective evolutionary algorithm
    • Authors: Yi Xiang; Jing Peng; Yuren Zhou; Miqing Li; Zefeng Chen
      Abstract: Abstract Having successfully handled many-objective optimization problems with box constraints only by using VaEA, a vector angle based many-objective evolutionary algorithm in our precursor study, this paper extended VaEA to solve generic constrained many-objective optimization problems. The proposed algorithm (denoted by CVaEA) differs from the original one mainly in the mating selection and the environmental selection, which are made suitable in the presence of infeasible solutions. Furthermore, we suggest a set of new constrained many-objective test problems which have different ranges of function values for all the objectives. Compared with normalized problems, this set of scaled ones is more applicable to test an algorithm’s performance. This is due to the nature property of practical problems being usually far from normalization. The proposed CVaEA was compared with two latest constrained many-objective optimization methods on the proposed test problems with up to 15 objectives, and on a constrained engineering problem from practice. It was shown by the simulation results that CVaEA could find a set of well converged and properly distributed solutions, and, compared with its competitors, obtained a better balance between convergence and diversity. This, and the original VaEA paper, together demonstrate the usefulness and efficiency of vector angle based algorithms for handling both constrained and unconstrained many-objective optimization problems.
      PubDate: 2017-04-19
      DOI: 10.1007/s10489-017-0929-9
       
  • Multi-objective hybrid artificial bee colony algorithm enhanced with Lévy
           flight and self-adaption for cloud manufacturing service composition
    • Authors: Jiajun Zhou; Xifan Yao
      Abstract: Abstract Service composition and optimal selection (SCOS) is a key problem in cloud manufacturing (CMfg). The present study proposed a multi-objective hybrid artificial bee colony (HABC) algorithm to address the SCOS problem in consideration of both quality of service (QoS) and energy consumption, to which an improved solution update equation with multiple dimensions of perturbation was adopted in the employed bee phase. Likewise, a cuckoo search-inspired Lévy flight was employed in the onlooker bee phase to overcome basic artificial bee colony (ABC) drawbacks such as poor exploitation and slow convergence. Moreover, a parameter adaptive strategy was applied to adjust the perturbation rate and step size of the Lévy flight to improve the performance of the algorithm. The proposed algorithm was first tested on 21 multi-objective benchmark problems and compared with four other state-of-the-art multi-objective evolutionary algorithms (MOEAs). The effect of the improvement strategies was then experimentally verified. Finally, the HABC was applied to solve multiscale SCOS problems using comparison experiments, which resulted in more competitive results and outperformed other MOEAs.
      PubDate: 2017-04-19
      DOI: 10.1007/s10489-017-0927-y
       
  • Bellman residuals minimization using online support vector machines
    • Authors: Gennaro Esposito; Mario Martin
      Abstract: Abstract In this paper we present and theoretically study an Approximate Policy Iteration (API) method called A P I − B R M 𝜖 using a very effective implementation of incremental Support Vector Regression (SVR) to approximate the value function able to generalize Reinforcement Learning (RL) problems with continuous (or large) state space. A P I − B R M 𝜖 is presented as a non-parametric regularization method based on an outcome of the Bellman Residual Minimization (BRM) able to minimize the variance of the problem. The proposed method can be cast as incremental and may be applied to the on-line agent interaction framework of RL. Being also based on SVR which are based on convex optimization, is able to find the global solution of the problem. A P I − B R M 𝜖 using SVR can be seen as a regularization problem using 𝜖−insensitive loss. Compared to standard squared loss also used in regularization, this allows to naturally build a sparse solution for the approximation function. We extensively analyze the statistical properties of A P I − B R M 𝜖 founding a bound which controls the performance loss of the algorithm under some assumptions on the kernel and assuming that the collected samples are not-i.i.d. following a β−mixing process. Some experimental evidence and performance for well known RL benchmarks are also presented.
      PubDate: 2017-04-18
      DOI: 10.1007/s10489-017-0910-7
       
  • Balanced undersampling: a novel sentence-based undersampling method to
           improve recognition of named entities in chemical and biomedical text
    • Authors: Abbas Akkasi; Ekrem Varoğlu; Nazife Dimililer
      Abstract: Abstract The class imbalance problem is a key factor that affects the performance of many classification tasks when using machine learning methods. This mainly refers to the problem where the number of samples in certain classes is much greater than in others. Such imbalance considerably affects the performance of classifiers in which the majority class or classes are often favored, thus resulting in high-precision/low-recall classifiers. Named entity recognition in free text suffers from this problem to a large extent because in any given free text, many samples do not belong to a specific entity. Furthermore, the data used in this specific type of classification is in sequenced mode and is different than that used in other common classification tasks such as image classification, spam detection, and text classification in which no semantic or syntactic relation exists between samples. In this study, we propose an undersampling approach for sequenced data that preserves existing correlations between sequenced samples that comprise sentences and thus improve the performance of classifiers. We call this method balanced undersampling (BUS). Considering the recent increased interest in the use of NER in the chemical and biomedical domains, the proposed method is developed and tested on four recent state-of-the-art corpora in these domains, including BioCreative IV ChemDNER, Bio-entity Recognition Challenge of JNLPBA (JNLPBA), SemEval2013 DDI DrugBank, and SemEval2013 DDI Medline datasets. The performance of the proposed method is evaluated against two other common undersampling methods: random undersampling and stop-word filtering. Our method is shown to outperform both methods with respect to F-score for all datasets used.
      PubDate: 2017-04-17
      DOI: 10.1007/s10489-017-0920-5
       
  • Personalized recommendation algorithm for social networks based on
           comprehensive trust
    • Authors: Zhijun Zhang; Gongwen Xu; Pengfei Zhang; Yongkang Wang
      PubDate: 2017-04-17
      DOI: 10.1007/s10489-017-0928-x
       
  • Self-adaptive differential evolution algorithm with improved mutation mode
    • Authors: Shihao Wang; Yuzhen Li; Hongyu Yang
      Abstract: Abstract The optimization performance of the Differential Evolution algorithm (DE) is easily affected by its control parameters and mutation modes, and their settings depend on the specific optimization problems. Therefore, a Self-adaptive Differential Evolution algorithm with Improved Mutation Mode (IMMSADE) is proposed by improving the mutation mode of DE and introducing a new control parameters adaptation strategy. In IMMSADE, each individual in the population has its own control parameters, and they would be dynamically adjusted according to the population diversity and individual difference. IMMSADE is compared with the basic DE and the other state-of-the-art DE algorithms by using a set of 22 benchmark functions. The experimental results show that the overall performance of the proposed IMMSADE is better than the basic DE and the other compared DE algorithms.
      PubDate: 2017-04-13
      DOI: 10.1007/s10489-017-0914-3
       
  • Fuzzy C-Means Clustering and Particle Swarm Optimization based scheme for
           Common Service Center location allocation
    • Authors: Rajan Gupta; Sunil K. Muttoo; Saibal K. Pal
      Abstract: Abstract Common Service Centers (CSCs), which are also known as Tele-centers and Rural Kiosks, are important infrastructural options for any country aiming to provide E-Governance services in rural regions. Their main objective is to provide adequate information and services to a country’s rural areas, thereby increasing government-citizen connectivity. Within developing nations, such as India, many CSC allocations are being planned. This study proposes a solution for allocating a CSC for villages in a country according to their E-Governance plan. The Fuzzy C-Means (FCM) algorithm was used for clustering the village dataset and finding a cluster center for CSC allocation, and the Particle Swarm Optimization (PSO) algorithm was used for further optimizing the results obtained from the FCM algorithm based on population. In the context of other studies addressing similar issues, this study highlights the practical implementation of location modeling and analysis. An extensive analysis of the results obtained using a village dataset from India including four prominent states shows that the proposed solution reduces the average traveling costs of villagers by an average of 33 % compared with those of allocating these CSCs randomly in a sorted order and by an average of 11 % relative to centroid allocation using the FCM-based approach only. As compared to traditional approaches like P-Center and P-Median, the proposed scheme is better by 31 % and 14 %, respectively. Therefore, the proposed algorithm yields better results than classical FCM and other types of computing techniques, such as random search & linear programming. This scheme could be useful for government departments managing the allocation of CSCs in various regions. This work should also be useful for researchers optimizing the location allocation schemes used for various applications worldwide.
      PubDate: 2017-04-13
      DOI: 10.1007/s10489-017-0917-0
       
  • An improved DPOP algorithm based on breadth first search pseudo-tree for
           distributed constraint optimization
    • Authors: Ziyu Chen; Zhen He; Chen He
      Abstract: Abstract Depth First Search (DFS) pseudo-tree is popularly used as the communication structure in complete algorithms for solving Distributed Constraint Optimization Problems (DCOPs) from multiagent systems. The advantage of a DFS pseudo-tree lies in its parallelism derived from pseudo-tree branches because the nodes in different branches are relatively independent and can compute concurrently. However, the constructed DFS pseudo-trees in experiments often come to be chain-like and greatly impair the performances of solving algorithms. Therefore, we propose a new DPOP algorithm using a Breadth First Search (BFS) pseudo-tree as the communication structure, named BFSDPOP. Compared with a DFS pseudo-tree, a BFS pseudo-tree is more excellent on the parallelism as it has much more branches. Another notable advantage is that the height of a BFS pseudo-tree is much lower than that of a DFS pseudo-tree, which gives rise to the shorter communication paths and less communication time. The method of Cluster Removing is also presented to allocate cross-edge constraints to reduce the size of the largest message in BFSDPOP. In the experiment, BFSDPOP with a BFS pseudo-tree and original DPOP with a DFS pseudo-tree are compared on three types of problems - graph coloring problems, meeting scheduling problems and random DCOPs. The results show that BFSDPOP outperforms original DPOP in most cases, which proves the excellent attributes of BFS pseudo-tree over DFS pseudo-tree.
      PubDate: 2017-04-13
      DOI: 10.1007/s10489-017-0905-4
       
  • Creating diversity in ensembles using synthetic neighborhoods of training
           samples
    • Authors: Zhi Chen; Tao Lin; Rui Chen; Yingtao Xie; Hongyan Xu
      Abstract: Abstract Diversity among base classifiers is known to be a key driver for the construction of an effective ensemble classifier. Several methods have been proposed to construct diverse base classifiers using artificially generated training samples. However, in these methods, diversity is often obtained at the expense of the accuracy of base classifiers. Inspired by the localized generalization error model a new sample generation method is proposed in this study. When preparing different training sets for base classifiers, the proposed method generates samples located within limited neighborhoods of the corresponding training samples. The generated samples are different with the original training samples but they also expand different parts of the original training data. Learning these datasets can result in a set of base classifiers that are accurate in different regions of the input space as well as maintaining appropriate diversity. Experiments performed on 26 benchmark datasets showed that: (1) our proposed method significantly outperformed some state-of-the-art ensemble methods in term of the classification accuracy; (2) our proposed method was significantly more efficient that other sample generation based ensemble methods.
      PubDate: 2017-04-13
      DOI: 10.1007/s10489-017-0922-3
       
  • Evaluation of random forest classifier in security domain
    • Authors: Zeinab Khorshidpour; Sattar Hashemi; Ali Hamzeh
      Abstract: Abstract There is an intrinsic adversarial nature in the security domain such as spam filtering and malware detection systems that attempt to mislead the detection system. This adversarial nature makes security applications different from the classical machine learning problems; for instance, an adversary (attacker) might change the distribution of test data and violate the data stationarity, a common assumption in machine learning techniques. Since machine learning methods are not inherently adversary-aware, a classifier designer should investigate the robustness of a learning system under attack. In this respect, recent studies have modeled the identified attacks against machine learning-based detection systems. Based on this, a classifier designer can evaluate the performance of a learning system leveraging the modeled attacks. Prior research explored a gradient-based approach in order to devise an attack against a classifier with differentiable discriminant function like SVM. However, there are several powerful classifiers with non-differentiable decision boundary such as Random Forest, which are commonly used in different security domain and applications. In this paper, we present a novel approach to model an attack against classifiers with non-differentiable decision boundary. In the experimentation, we first present an example that visually shows the effect of a successful attack on the MNIST handwritten digits classification task. Then we conduct experiments for two well-known applications in the security domain: spam filtering and malware detection in PDF files. The experimental results demonstrate that the proposed attack successfully evades Random Forest classifier and effectively degrades the classifier’s performance.
      PubDate: 2017-04-12
      DOI: 10.1007/s10489-017-0907-2
       
  • Optimizing association rule hiding using combination of border and
           heuristic approaches
    • Authors: Akbar Telikani; Asadollah Shahbahrami
      Abstract: Abstract Data sanitization process transforms the original database into a modified database to protect the disclosure of sensitive knowledge by reducing the confidence/support of patterns. This process produces side-effects on the sanitized database, where some non-sensitive patterns are lost or new patterns are produced. Recently, a number of approaches have been proposed to minimize these side-effects by selecting appropriate transactions/items for sanitization. The heuristic approach is applied to hide sensitive patterns both in association rules and in frequent itemsets. On the other hand, the border, exact, and evolutionary approaches have only been designed to hide frequent itemsets. In this paper, a new hybrid algorithm, called Decrease the Confidence of Rule (DCR), proposed to improve a border-based solution, namely MaxMin, using two heuristics to hide the association rules. To achieve this, first, a heuristic was formulated in combination with MaxMin solution to select victim items in order to control the impact of sanitization process on result quality. Then, the victim items were removed from transactions with the shortest length. Some experiments have been conducted on the four real datasets to compare performance of DCR with the Association Rule Hiding based on Intersection Lattice (ARHIL) algorithm. The experimental results showed that the proposed algorithm yielded fewer side-effects than ARHIL algorithm. In addition, its efficiency was better than the heuristic approach.
      PubDate: 2017-04-12
      DOI: 10.1007/s10489-017-0906-3
       
  • Fusion of local and global features for effective image extraction
    • Authors: Khawaja Tehseen Ahmed; Aun Irtaza; Muhammad Amjad Iqbal
      Abstract: Abstract Image extraction methods rely on locating interest points and describing feature vectors for these key points. These interest points provide different levels of invariance to the descriptors. The image signature can be described well by the pixel regions that surround the interest points at the local and global levels. This contribution presents a feature descriptor that combines the benefits of local interest point detection with the feature extraction strengths of a fine-tuned sliding window in combination with texture pattern analysis. This process is accomplished with an improved Moravec method using the covariance matrix of the local directional derivatives. These directional derivatives are compared with a scoring factor to identify which features are corners, edges or noise. Located interest point candidates are fetched for the sliding window algorithm to extract robust features. These locally-pointed global features are combined with monotonic invariant uniform local binary patterns that are extracted a priory as part of the proposed method. Extensive experiments and comparisons are conducted on the benchmark ImageNet, Caltech-101, Caltech-256 and Corel-100 datasets and compared with sophisticated methods and state-of-the-art descriptors. The proposed method outperforms the other methods with most of the descriptors and many image categories.
      PubDate: 2017-04-11
      DOI: 10.1007/s10489-017-0916-1
       
  • WD2O: a novel wind driven dynamic optimization approach with effective
           change detection
    • Authors: Abdennour Boulesnane; Souham Meshoul
      Abstract: Abstract Dynamic optimization holds promise to solve real world problems that require adaptation to dynamic environments. The challenge is to track optima in an ever changing landscape. This paper describes a new computational intelligence approach to dynamic optimization termed as wind driven dynamic optimization (WD2O). Basically, it relies on an enhanced Multi-Region Modified Wind Driven Optimization (MR-MWDO) model and exhibits four main features. First, a multi-region approach is used to classify regions of the search space into promising and non-promising areas with accordance to low and high pressure regions in the natural model. Second, it uses an effective collision avoidance strategy to prevent collision between sub-populations. Third, it allows cost effective change detection. Fourth, it maintains two types of populations in order to achieve better balanced search. The proposed WD2O has been successfully applied to Moving Peaks Benchmark (MPB) problem. An extensive experimental study has shown that WD2O outperforms significantly the first prototype MR-MWDO. Furthermore, it has shown very competitive results compared to state of the art methods and has achieved the best performance for high dimensional problems while keeping an appreciable time complexity.
      PubDate: 2017-04-10
      DOI: 10.1007/s10489-017-0895-2
       
  • The mean-variance cardinality constrained portfolio optimization problem
           using a local search-based multi-objective evolutionary algorithm
    • Authors: Bili Chen; Yangbin Lin; Wenhua Zeng; Hang Xu; Defu Zhang
      Abstract: Abstract Portfolio optimization problem is an important research topic in finance. The standard model of this problem, called Markowitz mean-variance model, has two conflicting criteria: expected returns and risks. In this paper, we consider a more realistic portfolio optimization problem, including both cardinality and quantity constraints, which is called Markowitz mean-variance cardinality constrained portfolio optimization problem (MVCCPO problem). We extend an algorithm which is based on a multi-objective evolutionary framework incorporating a local search schema and non-dominated sorting. To quantitatively analyze the effectiveness of the proposed algorithm, we compared our algorithm with the other five algorithms on public available data sets involving up to 225 assets. Several modifications based on the fundamental operators and procedures of the algorithm, namely, the boundary constraint handling strategy, the local search schema, the replacement strategy and the farthest-candidate approach, are proposed one-by-one. Success of this exercise is displayed via simulation results. The experimental results with different cardinality constraints illustrate that the proposed algorithm outperforms the other algorithms in terms of proximity and diversity. In addition, the diversity maintenance strategy used in the algorithm is also studied in terms of a spread metric to evaluate the distribution of the obtained non-dominated solutions. The sensitivity of our algorithm has also been experimentally investigated in this paper.
      PubDate: 2017-04-10
      DOI: 10.1007/s10489-017-0898-z
       
  • Proportional data modeling via entropy-based variational bayes learning of
           mixture models
    • Authors: Wentao Fan; Faisal R. Al-Osaimi; Nizar Bouguila; Jixiang Du
      Abstract: Abstract During the last few decades, many statistical approaches that were developed in the fields of computer vision and pattern recognition are based on mixture models. A mixture-based representation has a number of advantages: mixture models are generative, flexible, plus they can take prior information into account to improve the generalization capability. The mixture models that we consider in this paper are based on the Dirichlet and generalized Dirichlet distributions that have been widely used to represent proportional data. The novel aspect of this paper is to develop an entropy-based framework to learn these mixture models. Specifically, we propose a Bayesian framework for model learning by means of a sophisticated entropy-based variational Bayes technique. We present experimental results to show that the proposed method is effective in several applications namely person identity verification, 3D object recognition, text document clustering, and gene expression categorization.
      PubDate: 2017-04-08
      DOI: 10.1007/s10489-017-0909-0
       
  • Termset weighting by adapting term weighting schemes to utilize
           cardinality statistics for binary text categorization
    • Authors: Dima Badawi; Hakan Altınçay
      Abstract: Abstract This study proposes a novel scheme for termset weighting based on cardinality statistics. Specifically, termsets are evaluated by considering the number of apparent member terms. Based on a recently verified hypothesis that the occurrence of a subset of terms may also transfer worthwhile information about class memberships, the existing term weighting schemes are adapted. Here, the weight of a given termset is computed as the product of two factors. The first is a function of the member term frequencies that exist in the given document, and the second takes into account the numbers of positive and negative training documents in which the same number of members appear. By assigning a non-zero weight to the termsets when a subset of the member terms appears, the discriminative ability of different member term subsets is taken into consideration.
      PubDate: 2017-04-07
      DOI: 10.1007/s10489-017-0911-6
       
  • Clustering technique for large-scale home care crew scheduling problems
    • Authors: David Quintana; Alejandro Cervantes; Yago Saez; Pedro Isasi
      Abstract: Abstract The Home Health Care Scheduling Problem involves allocating professional caregivers to patients’ places of residence to meet service demands. These services are regular in nature and must be provided at specific times during the week. In this paper, we present a heuristic with two tie-breaking mechanisms suitable for large-scale versions of the problem. The greedy algorithm merges service lots to minimize the accumulated unproductive time. As a result, the solution is restructured in such a way as to increase its efficiency. The approach is tested on a real-world large instance of the problem for a company whose current resource allocation is inefficient. The solutions are benchmarked against the current service assignment and those obtained by a Ward clustering algorithm, and the results show an improvement in efficiency and cost.
      PubDate: 2017-04-05
      DOI: 10.1007/s10489-017-0908-1
       
  • Attribute weighting for averaged one-dependence estimators
    • Authors: Zhong-Liang Xiang; Dae-Ki Kang
      Abstract: Abstract Averaged one-dependence estimators (AODE) is a type of supervised learning algorithm that relaxes the conditional independence assumption that governs standard naïve Bayes learning algorithms. AODE has demonstrated reasonable improvement in terms of classification performance when compared with a naïve Bayes learner. However, AODE does not consider the relationships between the super-parent attribute and other normal attributes. In this paper, we propose a novel method based on AODE that weighs the relationship between the attributes called weighted AODE (WAODE), which is an attribute weighting method that uses the conditional mutual information metric to rank the relations among the attributes. We have conducted experiments on University of California, Irvine (UCI) benchmark datasets and compared accuracies between AODE and our proposed learner. The experimental results in our paper show that WAODE exhibits higher accuracy performance than the original AODE.
      PubDate: 2017-04-01
      DOI: 10.1007/s10489-016-0854-3
       
  • An efficient method for mining frequent sequential patterns using
           multi-Core processors
    • Authors: Bao Huynh; Bay Vo; Vaclav Snasel
      Abstract: Abstract The problem of mining frequent sequential patterns (FSPs) has attracted a great deal of research attention. Although there are many efficient algorithms for mining FSPs, the mining time is still high, especially for large or dense datasets. Parallel processing has been widely applied to improve processing speed for various problems. Some parallel algorithms have been proposed, but most of them have problems related to synchronization and load balancing. Based on a multi-core processor architecture, this paper proposes a load-balancing parallel approach called Parallel Dynamic Bit Vector Sequential Pattern Mining (pDBV-SPM) for mining FSPs from huge datasets using the dynamic bit vector data structure for fast determining support values. In the pDBV-SPM approach, the support count is sorted in ascending order before the set of frequent 1-sequences is partitioned into parts, each of which is assigned to a task on a processor so that most of the nodes in the leftmost branches will be infrequent and thus pruned during the search; this strategy helps to better balance the search tree. Experiments are conducted to verify the effectiveness of pDBV-SPM. The experimental results show that the proposed algorithm outperforms PIB-PRISM for mining FSPs in terms of mining time and memory usage.
      PubDate: 2017-04-01
      DOI: 10.1007/s10489-016-0859-y
       
  • Erratum to: A mathematical model for solving fully fuzzy linear
           programming problem with trapezoidal fuzzy numbers
    • Authors: Sapan Kumar Das; T. Mandal; S. A. Edalatpanah
      PubDate: 2017-03-02
      DOI: 10.1007/s10489-017-0923-2
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016