rss_2.0Sciendo RSS Feed for Journal of Artificial Intelligence and Soft Computing Researchhttps://sciendo.com/journal/JAISCRhttps://www.sciendo.comhttps://sciendo-parsed-data-feed.s3.eu-central-1.amazonaws.com/600759c4fd113962cb04bcb6/cover-image.jpghttps://sciendo.com/journal/JAISCR140216https://sciendo.com/article/10.2478/jaiscr-2023-0007<abstract> <title style='display:none'>Abstract</title> <p>One of the fundamental issues of modern society is access to interesting and useful content. As the amount of available content increases, this task becomes more and more challenging. Our needs are not always formulated in words; sometimes we have to use complex data types like images. In this paper, we consider the three approaches to creating recommender systems based on image data. The proposed systems are evaluated on a real-world dataset. Two case studies are presented. The first one presents the case of an item with many similar objects in a database, and the second one with only a few similar items.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00072023-03-11T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0009<abstract> <title style='display:none'>Abstract</title> <p>Scanning real 3D objects face many technical challenges. Stationary solutions allow for accurate scanning. However, they usually require special and expensive equipment. Competitive mobile solutions (handheld scanners, LiDARs on vehicles, etc.) do not allow for an accurate and fast mapping of the surface of the scanned object. The article proposes an end-to-end automated solution that enables the use of widely available mobile and stationary scanners. The related system generates a full 3D model of the object based on multiple depth sensors. For this purpose, the scanned object is marked with markers. Markers type and positions are automatically detected and mapped to a template mesh. The reference template is automatically selected for the scanned object, which is then transformed according to the data from the scanners with non-rigid transformation. The solution allows for the fast scanning of complex and varied size objects, constituting a set of training data for segmentation and classification systems of 3D scenes. The main advantage of the proposed solution is its efficiency, which enables real-time scanning and the ability to generate a mesh with a regular structure. It is critical for training data for machine learning algorithms. The source code is available at <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://github.com/SATOffice/improved_scanner3D">https://github.com/SATOffice/improved_scanner3D</ext-link>.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00092023-03-11T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0008<abstract> <title style='display:none'>Abstract</title> <p>Recommendation algorithms trained on a training set containing sub-optimal decisions may increase the likelihood of making more bad decisions in the future. We call this harmful effect self-induced bias, to emphasize that the bias is driven directly by the user’s past choices. In order to better understand the nature of self-induced bias of recommendation algorithms that are used by older adults with cognitive limitations, we have used agent-based simulation. Based on state-of-the-art results in psychology of aging and cognitive science, as well as our own empirical results, we have developed a cognitive model of an e-commerce client that incorporates cognitive decision-making abilities. We have evaluated the magnitude of self-induced bias by comparing results achieved by simulated agents with and without cognitive limitations due to age. We have also proposed new recommendation algorithms designed to counteract self-induced bias. The algorithms take into account user preferences and cognitive abilities relevant to decision making. To evaluate the algorithms, we have introduced 3 benchmarks: a simple product filtering method and two types of widely used recommendation algorithms: Content-Based and Collaborative filtering. Results indicate that the new algorithms outperform benchmarks both in terms of increasing the utility of simulated agents (both old and young), and in reducing self-induced bias.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00082023-03-11T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0006<abstract> <title style='display:none'>Abstract</title> <p>This paper presents a parallel approach to the Levenberg-Marquardt algorithm (LM). The use of the Levenberg-Marquardt algorithm to train neural networks is associated with significant computational complexity, and thus computation time. As a result, when the neural network has a big number of weights, the algorithm becomes practically ineffective. This article presents a new parallel approach to the computations in Levenberg-Marquardt neural network learning algorithm. The proposed solution is based on vector instructions to effectively reduce the high computational time of this algorithm. The new approach was tested on several examples involving the problems of classification and function approximation, and next it was compared with a classical computational method. The article presents in detail the idea of parallel neural network computations and shows the obtained acceleration for different problems.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00062023-03-11T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0010<abstract> <title style='display:none'>Abstract</title> <p>Modularity is a feature of most small, medium and large–scale living organisms that has evolved over many years of evolution. A lot of artificial systems are also modular, however, in this case, the modularity is the most frequently a consequence of a handmade design process. Modular systems that emerge automatically, as a result of a learning process, are very rare. What is more, we do not know mechanisms which result in modularity. The main goal of the paper is to continue the work of other researchers on the origins of modularity, which is a form of optimal organization of matter, and the mechanisms that led to the spontaneous formation of modular living forms in the process of evolution in response to limited resources and environmental variability. The paper focuses on artificial neural networks and proposes a number of mechanisms operating at the genetic level, both those borrowed from the natural world and those designed by hand, the use of which may lead to network modularity and hopefully to an increase in their effectiveness. In addition, the influence of external factors on the shape of the networks, such as the variability of tasks and the conditions in which these tasks are performed, is also analyzed. The analysis is performed using the Hill Climb Assembler Encoding constructive neuro-evolutionary algorithm. The algorithm was extended with various module-oriented mechanisms and tested under various conditions. The aim of the tests was to investigate how individual mechanisms involved in the evolutionary process and factors external to this process affect modularity and efficiency of neural networks.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00102023-03-11T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0004<abstract> <title style='display:none'>Abstract</title> <p>Introducing variation in the training dataset through data augmentation has been a popular technique to make Convolutional Neural Networks (CNNs) spatially invariant but leads to increased dataset volume and computation cost. Instead of data augmentation, augmentation of feature maps is proposed to introduce variations in the features extracted by a CNN. To achieve this, a rotation transformer layer called Rotation Invariance Transformer (RiT) is developed, which applies rotation transformation to augment CNN features. The RiT layer can be used to augment output features from any convolution layer within a CNN. However, its maximum effectiveness is shown when placed at the output end of final convolution layer. We test RiT in the application of scale-invariance where we attempt to classify scaled images from benchmark datasets. Our results show promising improvements in the networks ability to be scale invariant whilst keeping the model computation cost low.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00042022-11-28T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0001<abstract> <title style='display:none'>Abstract</title> <p>Outlier detection aims to find a data sample that is significantly different from other data samples. Various outlier detection methods have been proposed and have been shown to be able to detect anomalies in many practical problems. However, in high dimensional data, conventional outlier detection methods often behave unexpectedly due to a phenomenon called the curse of dimensionality. In this paper, we compare and analyze outlier detection performance in various experimental settings, focusing on text data with dimensions typically in the tens of thousands. Experimental setups were simulated to compare the performance of outlier detection methods in unsupervised versus semi-supervised mode and uni-modal versus multi-modal data distributions. The performance of outlier detection methods based on dimension reduction is compared, and a discussion on using k-NN distance in high dimensional data is also provided. Analysis through experimental comparison in various environments can provide insights into the application of outlier detection methods in high dimensional data.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00012022-11-28T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0003<abstract> <title style='display:none'>Abstract</title> <p>Nowadays, textual information grows exponentially on the Internet. Text summarization (TS) plays a crucial role in the massive amount of textual content. Manual TS is time-consuming and impractical in some applications with a huge amount of textual information. Automatic text summarization (ATS) is an essential technology to overcome mentioned challenges. Non-negative matrix factorization (NMF) is a useful tool for extracting semantic contents from textual data. Existing NMF approaches only focus on how factorized matrices should be modeled, and neglect the relationships among sentences. These relationships provide better factorization for TS. This paper suggests a novel non-negative matrix factorization for text summarization (NMFTS). The proposed ATS model puts regularizes on pairwise sentences vectors. A new cost function based on the Frobenius norm is designed, and an algorithm is developed to minimize this function by proposing iterative updating rules. The proposed NMFTS extracts semantic content by reducing the size of documents and mapping the same sentences closely together in the latent topic space. Compared with the basic NMF, the convergence time of the proposed method does not grow. The convergence proof of the NMFTS and empirical results on the benchmark data sets show that the suggested updating rules converge fast and achieve superior results compared to other methods.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00032022-11-28T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0005<abstract> <title style='display:none'>Abstract</title> <p>Real life applications of deep learning (DL) are often limited by the lack of expert labeled data required to effectively train DL models. Creation of such data usually requires substantial amount of time for manual categorization, which is costly and is considered to be one of the major impediments in development of DL methods in many areas. This work proposes a classification approach which completely removes the need for costly expert labeled data and utilizes noisy web data created by the users who are not subject matter experts. The experiments are performed with two well-known Convolutional Neural Network (CNN) architectures: VGG16 and ResNet50 trained on three randomly collected Instagram-based sets of images from three distinct domains: metropolitan cities, popular food and common objects - the last two sets were compiled by the authors and made freely available to the research community. The dataset containing common objects is a webly counterpart of PascalVOC2007 set. It is demonstrated that despite significant amount of label noise in the training data, application of proposed approach paired with standard training CNN protocol leads to high classification accuracy on representative data in all three above-mentioned domains. Additionally, two straightforward procedures of automatic cleaning of the data, before its use in the training process, are proposed. Apparently, data cleaning does not lead to improvement of results which suggests that the presence of noise in webly data is actually helpful in learning meaningful and robust class representations. Manual inspection of a subset of web-based test data shows that labels assigned to many images are ambiguous even for humans. It is our conclusion that for the datasets and CNN architectures used in this paper, in case of training with webly data, a major factor contributing to the final classification accuracy is representativeness of test data rather than application of data cleaning procedures.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00052022-11-28T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2023-0002<abstract> <title style='display:none'>Abstract</title> <p>Nowadays, applied computer-oriented and information digitalization technologies are developing very dynamically and are widely used in various industries. One of the highest priority sectors of the economy of Ukraine and other countries around the world, the needs of which require intensive implementation of high-performance information technologies, is agriculture. The purpose of the article is to synthesise scientific and practical provisions to improve the information technology of the comprehensive monitoring and control of microclimate in industrial greenhouses. The object of research is non-stationary processes of aggregation and transformation of measurement data on soil and climatic conditions of the greenhouse microclimate. The subject of research is methods and models of computer-oriented analysis of measurement data on the soil and climatic state of the greenhouse microclimate. The main scientific and practical effect of the article is the development of the theory of intelligent information technologies for monitoring and control of greenhouse microclimate through the development of methods and models of distributed aggregation and intellectualised transformation of measurement data based on fuzzy logic.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2023-00022022-11-28T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0016<abstract> <title style='display:none'>Abstract</title> <p>Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00162022-10-29T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0020<abstract> <title style='display:none'>Abstract</title> <p>We propose a method for content-based retrieving solar magnetograms. We use the SDO Helioseismic and Magnetic Imager output collected with SunPy PyTorch libraries. We create a mathematical representation of the magnetic field regions of the Sun in the form of a vector. Thanks to this solution we can compare short vectors instead of comparing full-disk images. In order to decrease the retrieval time, we used a fully-connected autoencoder, which reduced the 256-element descriptor to a 32-element semantic hash. The performed experiments and comparisons proved the efficiency of the proposed approach. Our approach has the highest precision value in comparison with other state-of-the-art methods. The presented method can be used not only for solar image retrieval but also for classification tasks.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00202022-10-29T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0018<abstract> <title style='display:none'>Abstract</title> <p>In the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared. In this paper, we propose an approach that: (a) uses an evolutionary algorithm to create signature partitions in the time and velocity domains; (b) selects the most characteristic partitions in terms of matching with reference signatures; and (c) works individually for each user, eliminating the need of using skilled forgeries. The proposed approach was tested using Biosecure DS2 database which is a part of the DeepSignDB, a database with genuine dynamic signatures. Our simulations confirmed the correctness of the adopted assumptions.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00182022-10-29T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0019<abstract> <title style='display:none'>Abstract</title> <p>Two-dimensional human pose estimation has been widely applied in real-world applications such as sports analysis, medical fall detection, human-robot interaction, with many positive results obtained utilizing Convolutional Neural Networks (CNNs). Li et al. at CVPR 2020 proposed a study in which they achieved high accuracy in estimating 2D keypoints estimation/2D human pose estimation. However, the study performed estimation only on the cropped human image data. In this research, we propose a method for automatically detecting and estimating human poses in photos using a combination of YOLOv5 + CC (Contextual Constraints) and HRNet. Our approach inherits the speed of the YOLOv5 for detecting humans and the efficiency of the HRNet for estimating 2D keypoints/2D human pose on the images. We also performed human marking on the images by bounding boxes of the Human 3.6M dataset (Protocol #1) for human detection evaluation. Our approach obtained high detection results in the image and the processing time is 55 FPS on the Human 3.6M dataset (Protocol #1). The mean error distance is 5.14 pixels on the full size of the image (1000 × 1002). In particular, the average results of 2D human pose estimation/2D keypoints estimation are 94.8% of PCK and 99.2% of PDJ@0.4 (head joint). The results are available.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00192022-10-29T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0017<abstract> <title style='display:none'>Abstract</title> <p>This paper presents a neural network model for identifying non-human traffic to a web-site, which is significantly different from visits made by regular users. Such visits are undesirable from the point of view of the website owner as they are not human activity, and therefore do not bring any value, and, what is more, most often involve costs incurred in connection with the handling of advertising. They are made most often by dishonest publishers using special software (bots) to generate profits. Bots are also used in scraping, which is automatic scanning and downloading of website content, which actually is not in the interest of website authors. The model proposed in this work is learnt by data extracted directly from the web browser during website visits. This data is acquired by using a specially prepared JavaScript that monitors the behavior of the user or bot. The appearance of a bot on a website generates parameter values that are significantly different from those collected during typical visits made by human website users. It is not possible to learn more about the software controlling the bots and to know all the data generated by them. Therefore, this paper proposes a variational autoencoder (VAE) neural network model with modifications to detect the occurrence of abnormal parameter values that deviate from data obtained from human users’ Internet traffic. The algorithm works on the basis of a popular autoencoder method for detecting anomalies, however, a number of original improvements have been implemented. In the study we used authentic data extracted from several large online stores.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00172022-10-29T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0012<abstract> <title style='display:none'>Abstract</title> <p>^**This paper presents a novel fast algorithm for feedforward neural networks training. It is based on the Recursive Least Squares (RLS) method commonly used for designing adaptive filters. Besides, it utilizes two techniques of linear algebra, namely the orthogonal transformation method, called the Givens Rotations (GR), and the QR decomposition, creating the GQR (symbolically we write GR + QR = GQR) procedure for solving the normal equations in the weight update process. In this paper, a novel approach to the GQR algorithm is presented. The main idea revolves around reducing the computational cost of a single rotation by eliminating the square root calculation and reducing the number of multiplications. The proposed modification is based on the scaled version of the Givens rotations, denoted as SGQR. This modification is expected to bring a significant training time reduction comparing to the classic GQR algorithm. The paper begins with the introduction and the classic Givens rotation description. Then, the scaled rotation and its usage in the QR decomposition is discussed. The main section of the article presents the neural network training algorithm which utilizes scaled Givens rotations and QR decomposition in the weight update process. Next, the experiment results of the proposed algorithm are presented and discussed. The experiment utilizes several benchmarks combined with neural networks of various topologies. It is shown that the proposed algorithm outperforms several other commonly used methods, including well known Adam optimizer.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00122022-07-23T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0015<abstract> <title style='display:none'>Abstract</title> <p>This paper constructs and settles a charging facility location problem with the link capacity constraint over a mixed traffic network. The reason for studying this problem is that link capacity constraint is mostly insufficient or missing in the studies of traditional user equilibrium models, thereby resulting in the ambiguous of the definition of road traffic network status. Adding capacity constraints to the road network is a compromise to enhance the reality of the traditional equilibrium model. In this paper, we provide a two-layer model for evaluating the efficiency of the charging facilities under the condition of considering the link capacity constraint. The upper level model in the proposed bi-level model is a nonlinear integer programming formulation, which aims to maximize the captured link flows of the battery electric vehicles. Moreover, the lower level model is a typical traffic equilibrium assignment model except that it contains the link capacity constraint and driving distance constraint of the electric vehicles over the mixed road network. Based on the Frank-Wolfe algorithm, a modified algorithm framework is adopted for solving the constructed problem, and finally, a numerical example is presented to verify the proposed model and solution algorithm.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00152022-07-23T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0011<abstract> <title style='display:none'>Abstract</title> <p>Recognizing faces under various lighting conditions is a challenging problem in artificial intelligence and applications. In this paper we describe a new face recognition algorithm which is invariant to illumination. We first convert image files to the logarithm domain and then we implement them using the dual-tree complex wavelet transform (DTCWT) which yields images approximately invariant to changes in illumination change. We classify the images by the collaborative representation-based classifier (CRC). We also perform the following sub-band transformations: (i) we set the approximation sub-band to zero if the noise standard deviation is greater than 5; (ii) we then threshold the two highest frequency wavelet sub-bands using bivariate wavelet shrinkage. (iii) otherwise, we set these two highest frequency wavelet sub-bands to zero. On obtained images we perform the inverse DTCWT which results in illumination invariant face images. The proposed method is strongly robust to Gaussian white noise. Experimental results show that our proposed algorithm outperforms several existing methods on the Extended Yale Face Database B and the CMU-PIE face database.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00112022-07-23T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0014<abstract> <title style='display:none'>Abstract</title> <p>This paper investigates the event-based state estimation for discrete-time recurrent delayed semi-Markovian neural networks. An event-triggering protocol is introduced to find measurement output with a specific triggering condition so as to lower the burden of the data communication. A novel summation inequality is established for the existence of asymptotic stability of the estimation error system. The problem addressed here is to construct an <italic>H</italic>_∞ state estimation that guarantees the asymptotic stability with the novel summation inequality, characterized by event-triggered transmission. By the Lyapunov functional technique, the explicit expressions for the gain are established. Finally, two examples are exploited numerically to illustrate the usefulness of the new methodology.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00142022-07-23T00:00:00.000+00:00https://sciendo.com/article/10.2478/jaiscr-2022-0013<abstract> <title style='display:none'>Abstract</title> <p>Fuzzy logic systems, unlike black-box models, are known as transparent artificial intelligence systems that have explainable rules of reasoning. Type 2 fuzzy systems extend the field of application to tasks that require the introduction of uncertainty in the rules, e.g. for handling corrupted data. Most practical implementations use interval type-2 sets and process interval membership grades. The key role in the design of type-2 interval fuzzy logic systems is played by the type-2 inference defuzzification method. In type-2 systems this generally takes place in two steps: type-reduction first, then standard defuzzification. The only precise type-reduction method is the iterative method known as Karnik-Mendel (KM) algorithm with its enhancement modifications. The known non-iterative methods deliver only an approximation of the boundaries of a type-reduced set and, in special cases, they diminish the profits that result from the use of type-2 fuzzy logic systems. In this paper, we propose a novel type-reduction method based on a smooth approximation of maximum/minimum, and we call this method a smooth type-reduction. Replacing the iterative KM algorithm by the smooth type-reduction, we obtain a structure of an adaptive interval type-2 fuzzy logic which is non-iterative and as close to an approximation of the KM algorithm as we like.</p> </abstract>ARTICLEtruehttps://sciendo.com/article/10.2478/jaiscr-2022-00132022-07-23T00:00:00.000+00:00en-us-1