Статьи журнала - International Journal of Intelligent Systems and Applications
Все статьи: 1126
System with Distributed Lag: Adaptive Identification and Prediction
Статья научная
Adaptive algorithms of parametric identifica-tion of discrete systems with lag variables are proposed. Adaptive algorithms (AA) in the presence of lag input variables are developed. The convergence of the AA and the boundedness of the trajectories the adaptive system is proved. Convergence domain АА depends on operating disturbance. Models with multiplicative parameters (MPM) for the decrease of a number estimated parameters are offered. The process for selection of the vector of base parameters MPM was developed. The performance of adaptive system identification for this case is proved. It is shown that parameters of system estimation at the application of multiplicative identification must be chosen from a condition of minimization of the criterion of the prediction error. Transformation of interdependence be-tween the lagged variables is offered, allowing eliminating their effect on system work. In the second part of work, the method of synthesis АА identification of the systems containing lagged output variables is offered. We consider a case of linear correlation between an output of the system and operating disturbance. For a solution of a problem, we suggest fulfilling an estimation of operating disturbance. Corresponding procedures are described and proved their efficiency. Simulation results are presented that confirm the efficiency of the adaptive methods.
Бесплатно
Technology of gene expression profiles filtering based on wavelet analysis
Статья научная
The paper presents the technology of gene expression profiles filtering based on the wavelet analysis methods. A structural block-chart of the wavelet-filtering process, which involves concurrent calculation of Shannon entropy for both the filtered data and allocated noise component is proposed. Simulation of the wavelet-filtering process was performed with the use of orthogonal and biorthogonal wavelets on different levels of wavelet decomposition and with the use of various values of the thresholding coefficient. Result of the simulation has allowed us to propose the technology to determine the optimal parameters of the wavelet filter based on complex analysis of the filtered data and allocated noise component.
Бесплатно
Temperament and Mood Detection Using Case-Based Reasoning
Статья научная
Case-Based Reasoning (CBR) is a branch of AI that is employed to solving problems which emphasizes the use of previous solutions in solving similar new problems. This work presents TAMDS, a Temperament and Mood Detection system which employs Case-Based Reasoning technique. The proposed system is adapted to the field of psychology to help psychologists solve part of the problems in their complex domain. We have designed TAMDS to detect temperament and moods of individuals. A major aim of our system is to help individuals who are out of reach of a professional psychologist to manage their personality and moods because as humans, moods affect our perceptions, personal health, the way we view the world around us and the way we react to it.
Бесплатно
Статья научная
This paper presents a self-tuning method of fuzzy logic controllers. The consequence part of the fuzzy logic controller is self-tuned through the Q-learning algorithm of reinforcement learning. The off policy temporal difference algorithm is used for tuning which directly approximate the action value function which gives the maximum reward. In this way, the Q-learning algorithm is used for the continuous time environment. The approach considered is having the advantage of fuzzy logic controller in a way that it is robust under the environmental uncertainties and no expert knowledge is required to design the rule base of the fuzzy logic controller.
Бесплатно
Temporal Weather Prediction using Back Propagation based Genetic Algorithm Technique
Статья научная
Hybrid back propagation based genetic algorithm approach is a popular way to train neural networks for weather prediction. The major drawback of this method is that weather parameters were assumed to be independent of each other and their temporal relation with one another was not considered. So in the present research a modified time series based weather prediction model is proposed to eliminate the problems incurred in hybrid BP/GA technique. The results are very encouraging; the proposed temporal weather prediction model outperforms the previous models while performing for dynamic and chaotic weather conditions.
Бесплатно
Temporal community-based collaborative filtering to relieve from cold-start and sparsity problems
Статья научная
Recommender systems inherently dynamic in nature and exponentially grow with time, in terms of interests and behaviour patterns. Traditional recommender systems rely on similarity of users or items in static networks where the user/item neighbourhood is almost same and they generate the same recommendations since the network is constant. This paper proposes a novel architecture, called Temporal Community-based Collaborative filtering, which is an association of recommendation and the dynamic community algorithm in order to exploit the temporal changes in the community structure to enhance the existing system. Our framework also provides solutions to common inherent issues of collaborative filtering approach such as cold-start, sparsity and compared against static and traditional collaborative systems. The outcomes indicate that the proposed system yields higher values in quality standards and minimizes the drawbacks of the traditional recommender system.
Бесплатно
Text Classification based on Discriminative-Semantic Features and Variance of Fuzzy Similarity
Статья научная
Due to the rapid growth of the Internet, large amounts of unlabelled textual data are producing daily. Clearly, finding the subject of a text document is a primary source of information in the text processing applications. In this paper, a text classification method is presented and evaluated for Persian and English. The proposed technique utilizes variance of fuzzy similarity besides discriminative and semantic feature selection methods. Discriminative features are those that distinguish categories with higher power and the concept of semantic feature takes into the calculations the similarity between features and documents by using only available documents. In the proposed method, incorporating fuzzy weighting as a measure of similarity is presented. The fuzzy weights are derived from the concept of fuzzy similarity which is defined as the variance of membership values of a document to all categories in the way that with some membership value at the same time, the sum of these membership values should be equal to 1. The proposed document classification method is evaluated on three datasets (one Persian and two English datasets) and two classification methods, support vector machine (SVM) and artificial neural network (ANN), are used. Comparing the results with other text classification methods, demonstrate the consistent superiority of the proposed technique in all cases. The weighted average F-measure of our method are %82 and %97.8 in the classification of Persian and English documents, respectively.
Бесплатно
Статья научная
In this article an investigation into search operations for the multiplicative inverse in the ring of integers modulo m for Error Control Coding tasks and for data security is shown. The classification of the searching operation of the multiplicative inverse in the ring of integers modulo m is provided. The best values of parameters for Joye-Paillier method and Lehmer algorithm were also found. The improved Bradley modification for the extended Euclidean algorithm is also offered, which gives the operating speed improvement for 10-15%. The integrated experimental research of basic classes of searching methods for multiplicative inverse in the ring of integers modulo m is conducted for the first time and the analytical formulas for these calculations of random access memory necessary space when operated at k-ary RS-algorithms and their modifications are shown.
Бесплатно
Статья научная
Many protection applications are based upon the Phasor Measurement Units (PMUs) technology. Therefore, PMUs have been increasingly widespread throughout the power network, and there are several researches have been made to locate the PMUs for complete system observability. This paper introduces an important application of PMUs in power system protection which is the detection of single line outage. In addition, a detection of the out of service line is achieved depending on the variations of phase angles measured at the system buses where the PMUs are located. Hence, a protection scheme from unexpected overloading in the network that may lead to system collapse can be achieved. Such detections are based upon an artificial intelligence technique which is the support Vector Machine (SVM) classification tool. To demonstrate the effectiveness of the proposed approach, the algorithm is tested using offline simulation for both the 14-bus IEEE and the 30-bus IEEE systems. Two different kernels of the SVM are tested to select the more appropriate one (i.e. polynomial and Radial Basis Function (RBF) kernels are used).
Бесплатно
The Application of Sparse Antenna Array Synthesis Based on Improved Mind Evolutionary Algorithm
Статья научная
Mind Evolutionary Algorithm (MEA) imitates the human mind evolution by using similartaxis and dissimilation operations, which overcomes the prematurity and improves searching efficiency. But the generation of the initial population is blind and the addition of naturally washed out temporary subpopulations is random. This paper improved MEA by introducing chaos and difference into it, which brought adequate diversity to the initial population and saved the excellent genes in the evolution. Then the improved MEA is used in the synthesis of sparse antenna arrays. The excellent results of computer simulation show the advantage of array antenna patterns synthesis using the improved MEA.
Бесплатно
The Complement of Normal Fuzzy Numbers: An Exposition
Статья научная
In this article, our main intention is to revisit the existing definition of complementation of fuzzy sets and thereafter various theories associated with it are also commented on. The main contribution of this paper is to suggest a new definition of complementation of fuzzy sets on the basis of reference function. Some other results have also been introduced whenever possible by using this new definition of complementation.
Бесплатно
Статья научная
Evolutionary algorithms (EAs) are a range of problem-solving techniques based on mechanisms inspired by biological evolution. Nowadays, EAs have proven their ability and effectiveness to solve combinatorial problems. However, these methods require a considerable time of calculation. To overcome this problem, several parallelization strategies have been proposed in the literature. In this paper, we present a new parallel agent-based EC framework for solving numerical optimization problems in order to optimize computation time and solutions quality.
Бесплатно
Статья научная
Mating preferentialism among animals is the natural form of elitism that has a higher genetic variance and a shorter number of interactions. This concept refers to fact that most animals cannot breed indefinitely – this is the case of elitism - and suffer DNA degradation. In this paper, two types of preferentialism were analyzed (mutation and second best); in both cases we found evidence of improvements over no-preferentialism or elitism. The best number of generations for preferentialism was determined to be 5, from a group of 3 to 20, with the smallest average of iterations and the most consistent average fitness. A sequencing of 0 to 7 was selected and used in association with mutation preferentialism in order to determine the best number of generations. In the case of BinaryF6, mutation preferentialism has a higher average best fitness (ABF) (0.9986) and a lower number of interactions (2259). Second best preferentialism has a better average last fitness (ALF) (0.6070) and a little higher number of interactions (3956). These results reveal that the two suggested form of preferentialism exhibit significant improvements in terms of time and result quality when they are compared with elitism (ABF of 0.9981, ALF of 0.6005 and an average number of interactions of 18197) or with no-preferentialism (ABF of 0.9982, ALF of 0.5177 and average number of interactions of 181088.
Бесплатно
The Effects of Beta-I and Fractal Dimension Neurofeedback on Reaction Time
Статья научная
In this paper, we evaluate the effects of neurofeedback training protocols of the relative power of the beta-I band and the fractal dimension on the reaction time of human by the Test of Variables of Attention (TOVA) to show which of these two protocols have the great ability for the improving of the reaction time. The findings of this research show that both protocols have a good ability (p < 0.01) to improving of the reaction time and can create the significant difference (as mean dRT = 37.3 ms for the beta-I protocol and dRT = 19.6 ms for the fractal protocol) in the reaction time. Of course, we must express, the Beta-I protocol has the more ability to improving of the reaction time and it is able to provide a faster reaction time.
Бесплатно
Статья научная
Recommender Systems (RS) help users in making appropriate decisions. In the area of RS research, many researchers focused on improving the performances of the existing methods, but most of them have not considered the potential of their employed methods in reaching the ultimate solution. In our view, the Machine Learning supervised approach as one of the existing techniques to create an RS can reach higher degrees of success in this field. Thus, we implemented a Collaborative Filtering recommender system using various Machine Learning supervised classifiers to study their performances. These classifiers implemented not only on a traditional platform but also on the Apache Spark platforms. The Caret package is used to implement the algorithms in the classical computational platform, and the H2O and Sparklyr are used to run the algorithms on the Spark Machine. Accordingly, we compared the performance of our algorithms with each other and with other algorithms from recent literature. Our experiments indicate the Caret-based algorithms are significantly slower than the Sparklyr and H2O based algorithms. Also, in the Spark platform, the runtime of the Sparklyr-based algorithm decreases with increasing the cluster size. However, the H2O-based algorithms run slower with increasing the cluster size. Moreover, the comparison of the results of our implemented algorithms with each other and with other algorithms from recent literature shows the Bayesian network is the fastest classifier between our implemented classifiers, and the Gradient Boost Model is the most accurate algorithm in our research. Therefore, the supervised approach is better than the other methods to create a collaborative filtering recommender system.
Бесплатно
Статья научная
There is a smoothing reactor and DC filter between the inverter and the direct current line to form a boundary in the HVDC transmission system. Since this boundary presents the stop-band characteristic to the high frequency transient voltage signals, the high-frequency transient voltage signal caused by external faults through boundary will be attenuated and the signals caused by internal faults will be unchanged. The wavelet analysis can be used as a tool to extract the feature of the fault to classify the internal fault and the external fault in HVDC transmission system. This paper explores the new method of wavelet based Multi-Resolution Analysis for signal decomposition to classify the difference types fault.
Бесплатно
Статья научная
In this paper, we present a new investigation to the literature, where we study the impact of false negative (FN) cost on the performance of cost sensitive learning. The proposed investigation approach has been performed on cost sensitive classifiers developed using Bayes minimum risk as an example of an applied mechanism for making a classifier cost sensitive. We consider a case study in credit card fraud detection, where FN refers to the number of fraudulent transactions that are miss-detected and approved as legitimate ones, assuming the classifier predicts the fraudulent transaction. Our investigation approach relies on testing the performance of various complex cost sensitive classifiers from different categories developed using Bayes minimum risk at different costs of FN. Our results show that those classifiers behave differently at different costs of FN including the real and average amount of transaction, and a range of random constant costs that are greater or less than the average amount. However, in general the results show that the lower the costs of FN are, the better the classifier performances are. This leads to different conclusions from the one drawn in [1], which states that choosing the cost of FN to be equal to the amount of transaction leads to better performance of cost sensitive learning using Bayes minimum risk. The results of this paper are based on the real life anonymous and imbalanced UCSD transactional data set.
Бесплатно
The Impact of Feature Selection on Web Spam Detection
Статья научная
Search engine is one of the most important tools for managing the massive amount of distributed web content. Web spamming tries to deceive search engines to rank some pages higher than they deserve. Many methods have been proposed to combat web spamming and to detect spam pages. One basic one is using classification, i.e., learning a classification model for classifying web pages to spam or non-spam. This work tries to select the best feature set for classification of web spam using imperialist competitive algorithm and genetic algorithm. Imperialist competitive algorithm is a novel optimization algorithm that is inspired by socio-political process of imperialism in the real world. Experiments are carried out on WEBSPAM-UK2007 data set, which show feature selection improves classification accuracy, and imperialist competitive algorithm outperforms GA.
Бесплатно
The Method of Measuring the Integration Degree of Countries on the Basis of International Relations
Статья научная
The paper studies the concept of integration, the integration of countries, basic characteristics of the integration of countries, the integration indicators of countries. The number of contacts between countries and the number of contracts signed between countries are offered as the indicators to determine the integration degree of countries. An approach to the design of the data warehouse for the decision support system in the field of foreign policy, using OLAP-technology is offered. Designed polycubic OLAP-model in which each cube is based on a separate data mart. Given the differences between the data warehouse and data mart. Shown that, one of the cubes of this model gives full information about the chosen indicators, including their aggregation on various parameters. Method for measuring the degree of integration of the countries, based on the calculation of the weight coefficients is proposed. In this regard, was described the information model of the relevant subsystem by using graph theory. Practical application of this method was shown. Moreover, the used software was shown.
Бесплатно
The Obstacle Detection and Measurement Based on Machine Vision
Статья научная
To develop a quick obstacle detection and measurement algorithm for the image-based autonomous vehicle (AV) or computer assisted driving system, this paper utilize the previous work of object detection to get the position of an obstacle and refocus windows on the selected target. Further calculation based on single camera will give the detailed measurement of the object, like the height, the distance to the vehicle, and possibly the width. It adopts a two camera system with different pitch angles, which can perform real-time monitoring for the front area of the vehicle with different coverage. This paper assumes that the vehicle will move at an even speed on a flat road, cameras will sample images at a given rate and the images will be analyzed simultaneously. Focus will be on the virtual window area of the image which is proved to be related to the distance to the object and speed of the vehicle. Counting of the blackened virtual sub-area can quickly find the existence of an obstacle and the obstacle area will be cut to get the interested parameter measurements for the object evaluation.
Бесплатно
