Forthcoming Articles

International Journal of Artificial Intelligence and Soft Computing

International Journal of Artificial Intelligence and Soft Computing (IJAISC)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are also listed here. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

International Journal of Artificial Intelligence and Soft Computing (2 papers in press)

Regular Issues

  • Early Identification of Acute Liver Failure through Machine Learning Algorithms   Order a copy of this article
    by Preety Shoran, Esha Saxena, Meenakshi Yadav, Subash Harizan, Akhilendra Khare, Saket Thankur, Avneesh Vashistha 
    Abstract: The liver plays a vital role in metabolism. This organ in the human body is responsible for maintaining and preserving overall health and well-being. However, when it fails to function optimally, it can cause severe and significant health complications. Liver diseases are multifactorial conditions that can be challenging to diagnose and treat. Early detection of any disease is very beneficial for effective treatment and diagnosis of patients conditions. Machine learning algorithms create a great platform for analysing medical data that helps in improving disease detection procedures. This paper aims to get a better understanding of machine learning algorithms in the detection of liver disease. We will explore different machine-learning techniques for predicting liver disease detection. It uses various parameters as symptoms and calculates acute liver failure (ALF) based on the parameters and ALF decides whether the patient has a liver disease or not. Accuracy was calculated with various machine learning techniques, i.e., logistic regression classification, KNN classification, decision tree, random forest and support vector machine (SVM). Out of these, logistic regression was found to be most effective in identifying and predicting the outcome of the dataset compared to other algorithms. SVM has a higher cross-validation score but accuracy, precision and recall are very low thus, cannot select this model.
    Keywords: Acute Liver Failure; Machine Learning; Feature Extraction; Liver Disease.
    DOI: 10.1504/IJAISC.2026.10076041
     
  • Analysing Augmented Objective Function Values in Nonlinear Programming Problems Computationally using an Improved Particle Swarm Optimisation   Order a copy of this article
    by Raju Prajapati, Jayantika Pal, Om Prakash Dubey 
    Abstract: A mixed constrained Nonlinear Programming Problem (NLPP) contains equality as well as inequality constraints. Solution of the same is the goal of this paper. We use penalty methods for this purpose. A version of penalty method is a quadratic penalty method, which is effective on mixed constrained NLPPs. The quadratic penalty method is used for the general constrained NLPP for converting it to an unconstrained NLPP. An improved version of PSO is applied to solve the converted unconstrained NLPP. We consider the improved PSO with constant inertia weight and constriction factor with parameters/values as suggested in literature. Further, we also use a single random number and velocity clamping conditions. The augmented objective function values and objective function values are reported in limited number of iterations. The paper also certifies that on increasing the penalty constants, the computational objective values decrease significantly.
    Keywords: Penalty method; nonlinear programming problems; particle swarm optimization; mixed-constrained optimisation.
    DOI: 10.1504/IJAISC.2026.10076711
     

 

Return to top