Back to Top
Go Back
Journal Photo for Information Sciences
Peer reviewed only Open Access

Information Sciences (IS)

Publisher : Elsevier Inc.
Statistics Probability Electronic Engineering
Claim Your Journal Get PRC Visit Website
e-ISSN 1872-6291
p-ISSN 0020-0255
Issue Frequency Monthly
Est. Year 2024
Mobile 13144478000
Country United States
Language English
APC YES
Impact Factor Assignee Google Scholar
Email publishing.services@elsevier.com

Journal Descriptions

Informatics and Computer Science Intelligent Systems Applications An International Journal Information Sciences will publish original, innovative and creative research results. A smaller number of timely tutorial and surveying contributions will be published from time to time. The journal is designed to serve researchers, developers, managers, strategic planners, graduate students and others interested in state-of-the art research activities in information, knowledge engineering and intelligent systems. Readers are assumed to have a common interest in information science, but with diverse backgrounds in fields such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioural sciences and biochemistry. The journal publishes high-quality, refereed articles. It emphasizes a balanced coverage of both theory and practice. It fully acknowledges and vividly promotes a breadth of the discipline of Informations Sciences.

Information Sciences (IS) is :-

  • International, Peer-Reviewed, Open Access, Refereed, Statistics, Probability, Electronic Engineering, Information Systems, Management, Artificial Intelligence, Computer Science Applications , Online or Print , Monthly Journal

  • UGC Approved, ISSN Approved: P-ISSN P-ISSN: 0020-0255, E-ISSN: 1872-6291, Established: 2024,
  • Does Not Provide Crossref DOI

  • Indexed in: Scopus, WoS

  • Not indexed in DOAJ, PubMed, UGC CARE

Indexing

Publications of IS

Comments on A note on teaching-learning-based optimization algorithm
Gajanan Waghmare March, 2026
A two-stage denoising framework for zero-shot learning with noisy labels
Panos M. Pardalos January, 2024
Although zero-shot learning (ZSL) has gained widespread concern due to its excellent capacity of recognizing new object classes without seeing any visual instances, most existing methods ass...
Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints
Panos M. Pardalos January, 2024
In this paper, we propose a new approximate linear reformulation for distributionally robust joint chance programming with Wasserstein ambiguity sets and an efficient solution approach based...
An efficient particle swarm optimization with evolutionary multitasking for stochastic area coverage of heterogeneous sensors
Panos M. Pardalos October, 2023
This paper investigates the stochastic area coverage problem of sensors with uncertain detection probability. The risk associated with uncertain parameters is managed using the conditional v...
Distributionally robust portfolio optimization with second-order stochastic dominance based on wasserstein metric
Panos M. Pardalos October, 2022
In portfolio optimization, we may be dealing with misspecification of a known distribution, that stock returns follow it. The unknown true distribution is considered in terms of a Wasserstei...
DMaOEA-εC: Decomposition-based many-objective evolutionary algorithm with the ε-constraint framework
Panos M. Pardalos October, 2020
Real-world problems which involve the optimization of multiple conflicting objectives are named as multi-objective optimization problems (MOPs). This paper mainly deals with the widespread a...
A novel perspective on multiclass classification: Regular simplex support vector machine
Panos M. Pardalos April, 2019
Although support vector machine (SVM) and its variants have been combined successfully with partitioning strategies for multiclass classification, a series of individual classifiers have to ...
A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem
Panos M. Pardalos April, 2019
This paper studies the prize-collecting vehicle routing problem (PCVRP), which is a new variant of the vehicle routing problem. In the PCVRP, besides the vehicle assignment and visiting sequ...