Inteligencia Artif.Pub Date : 2021-10-26DOI: 10.4114/intartif.vol24iss68pp72-88
M. Alshayeb, Mashaan Alshammari
{"title":"The Effect of the Dataset Size on the Accuracy of Software Defect Prediction Models: An Empirical Study","authors":"M. Alshayeb, Mashaan Alshammari","doi":"10.4114/intartif.vol24iss68pp72-88","DOIUrl":"https://doi.org/10.4114/intartif.vol24iss68pp72-88","url":null,"abstract":"The ongoing development of computer systems requires massive software projects. Running the components of these huge projects for testing purposes might be a costly process; therefore, parameter estimation can be used instead. Software defect prediction models are crucial for software quality assurance. This study investigates the impact of dataset size and feature selection algorithms on software defect prediction models. We use two approaches to build software defect prediction models: a statistical approach and a machine learning approach with support vector machines (SVMs). The fault prediction model was built based on four datasets of different sizes. Additionally, four feature selection algorithms were used. We found that applying the SVM defect prediction model on datasets with a reduced number of measures as features may enhance the accuracy of the fault prediction model. Also, it directs the test effort to maintain the most influential set of metrics. We also found that the running time of the SVM fault prediction model is not consistent with dataset size. Therefore, having fewer metrics does not guarantee a shorter execution time. From the experiments, we found that dataset size has a direct influence on the SVM fault prediction model. However, reduced datasets performed the same or slightly lower than the original datasets.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2021-09-30DOI: 10.4114/intartif.vol24iss68pp21-32
Yaming Cao, Zhen Yang, Chen Gao
{"title":"A New Method of Different Neural Network Depth and Feature Map Size on Remote Sensing Small Target Detection","authors":"Yaming Cao, Zhen Yang, Chen Gao","doi":"10.4114/intartif.vol24iss68pp21-32","DOIUrl":"https://doi.org/10.4114/intartif.vol24iss68pp21-32","url":null,"abstract":"Convolutional neural networks (CNNs) have shown strong learning capabilities in computer vision tasks such as classification and detection. Especially with the introduction of excellent detection models such as YOLO (V1, V2 and V3) and Faster R-CNN, CNNs have greatly improved detection efficiency and accuracy. However, due to the special angle of view, small size, few features, and complicated background, CNNs that performs well in the ground perspective dataset, fails to reach a good detection accuracy in the remote sensing image dataset. To this end, based on the YOLO V3 model, we used feature maps of different depths as detection outputs to explore the reasons for the poor detection rate of small targets in remote sensing images by deep neural networks. We also analyzed the effect of neural network depth on small target detection, and found that the excessive deep semantic information of neural network has little effect on small target detection. Finally, the verification on the VEDAI dataset shows, that the fusion of shallow feature maps with precise location information and deep feature maps with rich semantics in the CNNs can effectively improve the accuracy of small target detection in remote sensing images.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122275076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2021-09-30DOI: 10.4114/intartif.vol24iss68pp1-20
Jorge E. Camargo, Rigoberto Sáenz
{"title":"Evaluating the impact of curriculum learning on the training process for an intelligent agent in a video game","authors":"Jorge E. Camargo, Rigoberto Sáenz","doi":"10.4114/intartif.vol24iss68pp1-20","DOIUrl":"https://doi.org/10.4114/intartif.vol24iss68pp1-20","url":null,"abstract":"We want to measure the impact of the curriculum learning technique on a reinforcement training setup, several experiments were designed with different training curriculums adapted for the video game chosen as a case study. Then all were executed on a selected game simulation platform, using two reinforcement learning algorithms, and using the mean cumulative reward as a performance measure. Results suggest that curriculum learning has a significant impact on the training process, increasing training times in some cases, and decreasing them up to 40% percent in some other cases.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133788465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2021-09-30DOI: 10.4114/intartif.vol24iss68pp53-71
D. Gonzalez-Calvo, R. Aguilar, C. Criado-Hernandez, L. A. Gonzalez-Mendoza
{"title":"Applying ensemble neural networks to analyze industrial maintenance: Influence of Saharan dust transport on gas turbine axial compressor fouling","authors":"D. Gonzalez-Calvo, R. Aguilar, C. Criado-Hernandez, L. A. Gonzalez-Mendoza","doi":"10.4114/intartif.vol24iss68pp53-71","DOIUrl":"https://doi.org/10.4114/intartif.vol24iss68pp53-71","url":null,"abstract":"The planning of industrial maintenance associated with the production of electricity is vital, as it yields a current and future snapshot of an industrial component in order to optimize the human, technical and economic resources of the installation. This study focuses on the degradation due to fouling of a gas turbine in the Canary Islands, and analyzes fouling levels over time based on the operating regime and local meteorological variables. In particular, we study the relationship between degradation and the suspended dust that originates in the Sahara Desert. To this end, we use a computational procedure that relies on a set of artificial neural networks to build an ensemble, using a cross-validated committees approach, to yield the compressor efficiency. The use of trained models makes it possible to know in advance how the local fouling of an industrial rotating component will evolve, which is useful for maintenance planning and for calculating the relative importance of the variables that make up the system","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125472980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2021-09-30DOI: 10.4114/intartif.vol24iss68pp37-52
M. Demba
{"title":"KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases","authors":"M. Demba","doi":"10.4114/intartif.vol24iss68pp37-52","DOIUrl":"https://doi.org/10.4114/intartif.vol24iss68pp37-52","url":null,"abstract":"In relational databases, it is essential to know all minimal keys since the concept of database normaliza-tion is based on keys and functional dependencies of a relation schema. Existing algorithms for determining keysor computing the closure of arbitrary sets of attributes are generally time-consuming. In this paper we present anefficient algorithm, called KeyFinder, for solving the key-ï¬nding problem. We also propose a more direct methodfor computing the closure of a set of attributes. KeyFinder is based on a powerful proof procedure for ï¬ndingkeys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of searchspace and execution time.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129430911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2020-07-31DOI: 10.4114/intartif.vol23iss65pp86-99
K. Suresh, S. Karthik, M. Hanumanthappa
{"title":"Design an efficient disease monitoring system for paddy leaves based on big data mining","authors":"K. Suresh, S. Karthik, M. Hanumanthappa","doi":"10.4114/intartif.vol23iss65pp86-99","DOIUrl":"https://doi.org/10.4114/intartif.vol23iss65pp86-99","url":null,"abstract":"With the progressions in Information and Communication Technology (ICT), the innumerableelectronic devices (like smart sensors) and several software applications can proffer notable contributions to the challenges that are existent in monitoring plants. In the prevailing work, the segmentation accuracy andclassification accuracy of the Disease Monitoring System (DMS), is low. So, the system doesn't properly monitor the plant diseases. To overcome such drawbacks, this paper proposed an efficient monitoring system for paddy leaves based on big data mining. The proposed model comprises 5 phases: 1) Image acquisition, 2) segmentation, 3) Feature extraction, 4) Feature Selection along with 5) Classification Validation. Primarily, consider the paddy leaf image which is taken as of the dataset as the input. Then, execute image acquisition phase where 3 steps like, i) transmute RGB image to grey scale image, ii) Normalization for high intensity, and iii) preprocessing utilizing Alpha-trimmed mean filter (ATMF) through which the noises are eradicated and its nature is the hybrid of the mean as well as median filters, are performed. Next, segment the resulting image using Fuzzy C-Means (i.e. FCM) Clustering Algorithm. FCM segments the diseased portion in the paddy leaves. In the next phase, features are extorted, and then the resulted features are chosen by utilizing Multi-Verse Optimization (MVO) algorithm. After completing feature selection, the chosen features are classified utilizing ANFIS (Adaptive Neuro-Fuzzy Inference System). Experiential results contrasted with the former SVM classifier (Support Vector Machine) and the prevailing methods in respect of precision, recall, F-measure,sensitivity accuracy, and specificity. In accuracy level, the proposed one has 97.28% but the prevailing techniques only offer 91.2% for SVM classifier, 85.3% for KNN and 88.78% for ANN. Hence, this proposed DMS has more accurate detection and classification process than the other methods. The proposed DMS evinces better accuracy when contrasting with the prevailing methods.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130035485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2020-06-09DOI: 10.4114/intartif.vol23iss65pp67-85
Leonardo Luís Röpke, M. Binelo
{"title":"Development of an Artificial Intelligence System (AI) Based on Patterns Recognition for the Analysis of Vehicular Routes","authors":"Leonardo Luís Röpke, M. Binelo","doi":"10.4114/intartif.vol23iss65pp67-85","DOIUrl":"https://doi.org/10.4114/intartif.vol23iss65pp67-85","url":null,"abstract":"This work presents the study and development of an Artificial Intelligence system, with focus on K-means algorithms and Artificial Neural Networks, to assist fleet managers in the identification of routes and route deviations. The developed tool has the objective of modernizing the process of identification of routes and deviations of routes. The results show that the Artificial Neural Networks obtained a 100% accuracy rate in the identification of routes, and in the identification of route deviations the RNAs were able to identify 61% of the routes presented. Therefore, RNAs are an excellent technique to be applied to the identification of routes and deviations of routes. The K-means algorithm presented good results when applied in the discovery of similar routes, thus becoming an important tool applied to the work of monitoring vehicles routes.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125777618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2020-02-25DOI: 10.4114/intartif.vol22iss64pp152-165
Gustavo Martins, P. Urbano, A. Christensen
{"title":"Augmenting Scalable Communication-Based Role Allocation for a Three-Role Task","authors":"Gustavo Martins, P. Urbano, A. Christensen","doi":"10.4114/intartif.vol22iss64pp152-165","DOIUrl":"https://doi.org/10.4114/intartif.vol22iss64pp152-165","url":null,"abstract":"In evolutionary robotics role allocation studies, it is common that the role assumed by each robot is strongly associated with specific local conditions, which may compromise scalability and robustness because of the dependency on those conditions. To increase scalability, communication has been proposed as a means for robots to exchange signals that represent roles. This idea was successfully applied to evolve communication-based role allocation for a two-role task. However, it was necessary to reward signal differentiation in the fitness function, which is a serious limitation as it does not generalize to tasks where the number of roles is unknown a priori. In this paper, we show that rewarding signal differentiation is not necessary to evolve communication-based role allocation strategies for the given task, and we improve reported scalability, while requiring less a priori knowledge. Our approach for the two-role task puts fewer constrains on the evolutionary process and enhances the potential of evolving communication-based role allocation for more complex tasks. Furthermore, we conduct experiments for a three-role task where we compare two different cognitive architectures and several fitness functions and we show how scalable controllers might be evolved.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127384013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2020-01-27DOI: 10.4114/intartif.vol22iss64pp135-142
A. J. Márquez, G. B. Maza
{"title":"Gray-level Co-Occurrence Matrix application to Images Processing of crushed Olives fruits","authors":"A. J. Márquez, G. B. Maza","doi":"10.4114/intartif.vol22iss64pp135-142","DOIUrl":"https://doi.org/10.4114/intartif.vol22iss64pp135-142","url":null,"abstract":"This paper shows the results obtained from images processing digitized, taken with a 'smartphone', of 56 samples of crushed olives, using the methodology of the gray-level co-occurrence matrix (GLCM). The values of the appropriate direction (θ) and distance (D) that two pixel with gray tone are neighbourhood, are defined to extract the information of the parameters: Contrast, Correlation, Energy and Homogeneity. The values of these parameters are correlated with several characteristic components of the olives mass: oil content (RGH) and water content (HUM), whose values are in the usual ranges during their processing to obtain virgin olive oil in mills and they contribute to generate different mechanical textures in the mass according to their relationship HUM / RGH. The results indicate the existence of significant correlations of the parameters Contrast, Energy and Homogeneity with the RGH and the HUM, which have allowed to obtain, by means of a multiple linear regression (MLR), mathematical equations that allow to predict both components with a high degree of correlation coefficient, r = 0.861 and r = 0.872 for RGH and HUM respectively. These results suggest the feasibility of textural analysis using GLCM to extract features of interest from digital images of the olives mass, quickly and non-destructively, as an aid in the decision making to optimize the production process of virgin olive oil.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124990540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inteligencia Artif.Pub Date : 2019-12-25DOI: 10.4114/intartif.vol22iss64pp123-134
Mohamed Amine Nemmich, F. Debbat, M. Slimane
{"title":"An Enhanced Discrete Bees Algorithm for Resource Constrained Optimization Problems","authors":"Mohamed Amine Nemmich, F. Debbat, M. Slimane","doi":"10.4114/intartif.vol22iss64pp123-134","DOIUrl":"https://doi.org/10.4114/intartif.vol22iss64pp123-134","url":null,"abstract":"In this paper, we propose a novel efficient model based on Bees Algorithm (BA) for the Resource-Constrained Project Scheduling Problem (RCPSP). The studied RCPSP is a NP-hard combinatorial optimization problem which involves resource, precedence, and temporal constraints. It has been applied to many applications. The main objective is to minimize the expected makespan of the project. The proposed model, named Enhanced Discrete Bees Algorithm (EDBA), iteratively solves the RCPSP by utilizing intelligent foraging behaviors of honey bees. The potential solution is represented by the multidimensional bee, where the activity list representation (AL) is considered. This projection involves using the Serial Schedule Generation Scheme (SSGS) as decoding procedure to construct the active schedules. In addition, the conventional local search of the basic BA is replaced by a neighboring technique, based on the swap operator, which takes into account the specificity of the solution space of project scheduling problems and reduces the number of parameters to be tuned. The proposed EDBA is tested on well-known benchmark problem instance sets from Project Scheduling Problem Library (PSPLIB) and compared with other approaches from the literature. The promising computational results reveal the effectiveness of the proposed approach for solving the RCPSP problems of various scales.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120992277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}