Pub Date : 2015-07-10DOI: 10.4236/JILSA.2015.73007
M. Iskandarani
A hypothesis of the existence of dominant pattern that may affect the performance of a neural based pattern recognition system and its operation in terms of correct and accurate classification, pruning and optimization is assumed, presented, tested and proved to be correct. Two sets of data subjected to the same ranking process using four main features are used to train a neural network engine separately and jointly. Data transformation and statistical pre-processing are carried out on the datasets before inserting them into the specifically designed multi-layer neural network employing Weight Elimination Algorithm with Back Propagation (WEA-BP). The dynamics of classification and weight elimination process is correlated and used to prove the dominance of one dataset. The presented results proved that one dataset acted aggressively towards the system and displaced the first dataset making its classification almost impossible. Such modulation to the relationships among the selected features of the affected dataset resulted in a mutated pattern and subsequent re-arrangement in the data set ranking of its members.
{"title":"Disparity in Intelligent Classification of Data Sets Due to Dominant Pattern Effect (DPE)","authors":"M. Iskandarani","doi":"10.4236/JILSA.2015.73007","DOIUrl":"https://doi.org/10.4236/JILSA.2015.73007","url":null,"abstract":"A hypothesis of the existence of dominant pattern that may affect the performance of a neural based pattern recognition system and its operation in terms of correct and accurate classification, pruning and optimization is assumed, presented, tested and proved to be correct. Two sets of data subjected to the same ranking process using four main features are used to train a neural network engine separately and jointly. Data transformation and statistical pre-processing are carried out on the datasets before inserting them into the specifically designed multi-layer neural network employing Weight Elimination Algorithm with Back Propagation (WEA-BP). The dynamics of classification and weight elimination process is correlated and used to prove the dominance of one dataset. The presented results proved that one dataset acted aggressively towards the system and displaced the first dataset making its classification almost impossible. Such modulation to the relationships among the selected features of the affected dataset resulted in a mutated pattern and subsequent re-arrangement in the data set ranking of its members.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330908","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}
Pub Date : 2015-05-26DOI: 10.4236/JILSA.2015.72006
A. Lianos, Yanyan Yang
Typical supervised classification techniques require training instances similar to the values that need to be classified. This research proposes a methodology that can utilize training instances found in a different format. The benefit of this approach is that it allows the use of traditional classification techniques, without the need to hand-tag training instances if the information exists in other data sources. The proposed approach is presented through a practical classification application. The evaluation results show that the approach is viable, and that the segmentation of classifiers can greatly improve accuracy.
{"title":"Classifying Unstructured Text Using Structured Training Instances and an Ensemble of Classifiers","authors":"A. Lianos, Yanyan Yang","doi":"10.4236/JILSA.2015.72006","DOIUrl":"https://doi.org/10.4236/JILSA.2015.72006","url":null,"abstract":"Typical supervised classification techniques require training instances similar to the values that need to be classified. This research proposes a methodology that can utilize training instances found in a different format. The benefit of this approach is that it allows the use of traditional classification techniques, without the need to hand-tag training instances if the information exists in other data sources. The proposed approach is presented through a practical classification application. The evaluation results show that the approach is viable, and that the segmentation of classifiers can greatly improve accuracy.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330371","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}
Pub Date : 2015-04-15DOI: 10.4236/JILSA.2015.72005
Siti-Hajar-Aminah Ali, S. Ozawa, J. Nakazato, Tao Ban, Jumpei Shimamura
In this paper, we propose a new online system that can quickly detect malicious spam emails and adapt to the changes in the email contents and the Uniform Resource Locator (URL) links leading to malicious websites by updating the system daily. We introduce an autonomous function for a server to generate training examples, in which double-bounce emails are automatically collected and their class labels are given by a crawler-type software to analyze the website maliciousness called SPIKE. In general, since spammers use botnets to spread numerous malicious emails within a short time, such distributed spam emails often have the same or similar contents. Therefore, it is not necessary for all spam emails to be learned. To adapt to new malicious campaigns quickly, only new types of spam emails should be selected for learning and this can be realized by introducing an active learning scheme into a classifier model. For this purpose, we adopt Resource Allocating Network with Locality Sensitive Hashing (RAN-LSH) as a classifier model with a data selection function. In RAN-LSH, the same or similar spam emails that have already been learned are quickly searched for a hash table in Locally Sensitive Hashing (LSH), in which the matched similar emails located in “well-learned” are discarded without being used as training data. To analyze email contents, we adopt the Bag of Words (BoW) approach and generate feature vectors whose attributes are transformed based on the normalized term frequency-inverse document frequency (TF-IDF). We use a data set of double-bounce spam emails collected at National Institute of Information and Communications Technology (NICT) in Japan from March 1st, 2013 until May 10th, 2013 to evaluate the performance of the proposed system. The results confirm that the proposed spam email detection system has capability of detecting with high detection rate.
{"title":"An Online Malicious Spam Email Detection System Using Resource Allocating Network with Locality Sensitive Hashing","authors":"Siti-Hajar-Aminah Ali, S. Ozawa, J. Nakazato, Tao Ban, Jumpei Shimamura","doi":"10.4236/JILSA.2015.72005","DOIUrl":"https://doi.org/10.4236/JILSA.2015.72005","url":null,"abstract":"In this paper, we propose a new online system that can quickly detect malicious spam emails and adapt to the changes in the email contents and the Uniform Resource Locator (URL) links leading to malicious websites by updating the system daily. We introduce an autonomous function for a server to generate training examples, in which double-bounce emails are automatically collected and their class labels are given by a crawler-type software to analyze the website maliciousness called SPIKE. In general, since spammers use botnets to spread numerous malicious emails within a short time, such distributed spam emails often have the same or similar contents. Therefore, it is not necessary for all spam emails to be learned. To adapt to new malicious campaigns quickly, only new types of spam emails should be selected for learning and this can be realized by introducing an active learning scheme into a classifier model. For this purpose, we adopt Resource Allocating Network with Locality Sensitive Hashing (RAN-LSH) as a classifier model with a data selection function. In RAN-LSH, the same or similar spam emails that have already been learned are quickly searched for a hash table in Locally Sensitive Hashing (LSH), in which the matched similar emails located in “well-learned” are discarded without being used as training data. To analyze email contents, we adopt the Bag of Words (BoW) approach and generate feature vectors whose attributes are transformed based on the normalized term frequency-inverse document frequency (TF-IDF). We use a data set of double-bounce spam emails collected at National Institute of Information and Communications Technology (NICT) in Japan from March 1st, 2013 until May 10th, 2013 to evaluate the performance of the proposed system. The results confirm that the proposed spam email detection system has capability of detecting with high detection rate.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330295","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}
Pub Date : 2015-04-15DOI: 10.4236/JILSA.2015.72004
S. Ling
An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.
{"title":"Iterated Function System-Based Crossover Operation for Real-Coded Genetic Algorithm","authors":"S. Ling","doi":"10.4236/JILSA.2015.72004","DOIUrl":"https://doi.org/10.4236/JILSA.2015.72004","url":null,"abstract":"An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330285","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}
Pub Date : 2015-01-22DOI: 10.4236/JILSA.2015.71002
Lin Ye, S. Su
This paper investigates experimental design (DoE) for the calibration of the triaxial accelerometers embedded in a wearable micro Inertial Measurement Unit (μ-IMU). Firstly, a new linearization strategy is proposed for the accelerometer model associated with the so-called autocalibration scheme. Then, an effective Icosahedron design is developed, which can achieve both D-optimality and G-optimality for linearized accelerometer model in ideal experimental settings. However, due to various technical limitations, it is often infeasible for the users of wearable sensors to fully implement the proposed experimental scheme. To assess the efficiency of each individual experiment, an index is given in terms of desired experimental characteristic. The proposed experimental scheme has been applied for the autocalibration of a newly developed μ-IMU.
{"title":"Experimental Design and Its Posterior Efficiency for the Calibration of Wearable Sensors","authors":"Lin Ye, S. Su","doi":"10.4236/JILSA.2015.71002","DOIUrl":"https://doi.org/10.4236/JILSA.2015.71002","url":null,"abstract":"This paper investigates experimental design (DoE) for the calibration of the triaxial accelerometers embedded in a wearable micro Inertial Measurement Unit (μ-IMU). Firstly, a new linearization strategy is proposed for the accelerometer model associated with the so-called autocalibration scheme. Then, an effective Icosahedron design is developed, which can achieve both D-optimality and G-optimality for linearized accelerometer model in ideal experimental settings. However, due to various technical limitations, it is often infeasible for the users of wearable sensors to fully implement the proposed experimental scheme. To assess the efficiency of each individual experiment, an index is given in terms of desired experimental characteristic. The proposed experimental scheme has been applied for the autocalibration of a newly developed μ-IMU.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330203","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}
Pub Date : 2015-01-22DOI: 10.4236/JILSA.2015.71001
Akhilesh Pathak, Tarang Agarwal, A. Mohan
This paper presents a novel technique for improved voting by adaptively varying the membership boundaries of a fuzzy voter to achieve realistic consensus among inputs of redundant modules of a fault tolerant system. We demonstrate that suggested dynamic membership partitioning minimizes the number of occurrences of incorrect outputs of a voter as compared to the fixed membership partitioning voter implementations. Simulation results for the proposed voter for Triple Modular Redundancy (TMR) fault tolerant system indicate that our algorithm shows better safety and availability performance as compared to the existing one. However, our voter design is general and thus it can be potentially useful for improving safety and availability of critical fault tolerant systems.
{"title":"A Novel Fuzzy Membership Partitioning for Improved Voting in Fault Tolerant System","authors":"Akhilesh Pathak, Tarang Agarwal, A. Mohan","doi":"10.4236/JILSA.2015.71001","DOIUrl":"https://doi.org/10.4236/JILSA.2015.71001","url":null,"abstract":"This paper presents a novel technique for improved voting by adaptively varying the membership boundaries of a fuzzy voter to achieve realistic consensus among inputs of redundant modules of a fault tolerant system. We demonstrate that suggested dynamic membership partitioning minimizes the number of occurrences of incorrect outputs of a voter as compared to the fixed membership partitioning voter implementations. Simulation results for the proposed voter for Triple Modular Redundancy (TMR) fault tolerant system indicate that our algorithm shows better safety and availability performance as compared to the existing one. However, our voter design is general and thus it can be potentially useful for improving safety and availability of critical fault tolerant systems.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330178","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}
Pub Date : 2015-01-22DOI: 10.4236/JILSA.2015.71003
Behrouz Madahian, A. Salighehdar, R. Amini
As rule-based systems (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. In the past several years, a vast body of research has been carried out in developing various graphical techniques such as utilizing Petri Nets to analyze structural errors in rule-based systems, which utilize propositional logic. Four typical errors in rule-based systems are redundancy, circularity, incompleteness, and inconsistency. Recently, a DNA-based computing approach to detect these errors has been proposed. That paper presents algorithms which are able to detect structural errors just for special cases. For a rule base, which contains multiple starting nodes and goal nodes, structural errors are not removed correctly by utilizing the algorithms proposed in that paper and algorithms lack generality. In this study algorithms mainly based on Adleman’s operations, which are able to detect structural errors, in any form that they may arise in rule base, are presented. The potential of applying our algorithm is auspicious giving the operational time complexity of O(n*(Max{q, K, z})), in which n is the number of fact clauses; q is the number of rules in the longest inference chain; K is the number of tubes containing antecedents which are comprised of distinct number of starting nodes; and z denotes the maximum number of distinct antecedents comprised of the same number of starting nodes.
{"title":"Applying DNA Computation to Error Detection Problem in Rule-Based Systems","authors":"Behrouz Madahian, A. Salighehdar, R. Amini","doi":"10.4236/JILSA.2015.71003","DOIUrl":"https://doi.org/10.4236/JILSA.2015.71003","url":null,"abstract":"As rule-based systems (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. In the past several years, a vast body of research has been carried out in developing various graphical techniques such as utilizing Petri Nets to analyze structural errors in rule-based systems, which utilize propositional logic. Four typical errors in rule-based systems are redundancy, circularity, incompleteness, and inconsistency. Recently, a DNA-based computing approach to detect these errors has been proposed. That paper presents algorithms which are able to detect structural errors just for special cases. For a rule base, which contains multiple starting nodes and goal nodes, structural errors are not removed correctly by utilizing the algorithms proposed in that paper and algorithms lack generality. In this study algorithms mainly based on Adleman’s operations, which are able to detect structural errors, in any form that they may arise in rule base, are presented. The potential of applying our algorithm is auspicious giving the operational time complexity of O(n*(Max{q, K, z})), in which n is the number of fact clauses; q is the number of rules in the longest inference chain; K is the number of tubes containing antecedents which are comprised of distinct number of starting nodes; and z denotes the maximum number of distinct antecedents comprised of the same number of starting nodes.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330217","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}
Pub Date : 2014-10-15DOI: 10.4236/JILSA.2014.64012
M. Yousef, N. Najami, Loai AbedAllah, Waleed Khalifa
Computational biology plays a significant role in the discovery of new biomarkers, the analyses of disease states and the validation of potential biomarkers. Biomarkers are used to measure the progress of disease or the physiological effects of therapeutic intervention in the treatment of disease. They are also used as early warning signs for various diseases such as cancer and inflammatory diseases. In this review, we outline recent progresses of computational biology application in research on biomarkers discovery. A brief discussion of some necessary preliminaries on machine learning techniques (e.g., clustering and support vector machines—SVM) which are commonly used in many applications to biomarkers discovery is given and followed by a description of biological background on biomarkers. We further examine the integration of computational biology approaches and biomarkers. Finally, we conclude with a discussion of key challenges for computational biology to biomarkers discovery.
{"title":"Computational Approaches for Biomarker Discovery","authors":"M. Yousef, N. Najami, Loai AbedAllah, Waleed Khalifa","doi":"10.4236/JILSA.2014.64012","DOIUrl":"https://doi.org/10.4236/JILSA.2014.64012","url":null,"abstract":"Computational biology plays a significant role in the discovery of new biomarkers, the analyses of disease states and the validation of potential biomarkers. Biomarkers are used to measure the progress of disease or the physiological effects of therapeutic intervention in the treatment of disease. They are also used as early warning signs for various diseases such as cancer and inflammatory diseases. In this review, we outline recent progresses of computational biology application in research on biomarkers discovery. A brief discussion of some necessary preliminaries on machine learning techniques (e.g., clustering and support vector machines—SVM) which are commonly used in many applications to biomarkers discovery is given and followed by a description of biological background on biomarkers. We further examine the integration of computational biology approaches and biomarkers. Finally, we conclude with a discussion of key challenges for computational biology to biomarkers discovery.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330073","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}
Pub Date : 2014-10-15DOI: 10.4236/JILSA.2014.64014
Uthai Phommasak, D. Kitakoshi, H. Shioya, Junji Maeda
There are many proposed policy-improving systems of Reinforcement Learning (RL) agents which are effective in quickly adapting to environmental change by using many statistical methods, such as mixture model of Bayesian Networks, Mixture Probability and Clustering Distribution, etc. However such methods give rise to the increase of the computational complexity. For another method, the adaptation performance to more complex environments such as multi-layer environments is required. In this study, we used profit-sharing method for the agent to learn its policy, and added a mixture probability into the RL system to recognize changes in the environment and appropriately improve the agent’s policy to adjust to the changing environment. We also introduced a clustering that enables a smaller, suitable selection in order to reduce the computational complexity and simultaneously maintain the system’s performance. The results of experiments presented that the agent successfully learned the policy and efficiently adjusted to the changing in multi-layer environment. Finally, the computational complexity and the decline in effectiveness of the policy improvement were controlled by using our proposed system.
{"title":"A Reinforcement Learning System to Dynamic Movement and Multi-Layer Environments","authors":"Uthai Phommasak, D. Kitakoshi, H. Shioya, Junji Maeda","doi":"10.4236/JILSA.2014.64014","DOIUrl":"https://doi.org/10.4236/JILSA.2014.64014","url":null,"abstract":"There are many proposed policy-improving systems of Reinforcement Learning (RL) agents which are effective in quickly adapting to environmental change by using many statistical methods, such as mixture model of Bayesian Networks, Mixture Probability and Clustering Distribution, etc. However such methods give rise to the increase of the computational complexity. For another method, the adaptation performance to more complex environments such as multi-layer environments is required. In this study, we used profit-sharing method for the agent to learn its policy, and added a mixture probability into the RL system to recognize changes in the environment and appropriately improve the agent’s policy to adjust to the changing environment. We also introduced a clustering that enables a smaller, suitable selection in order to reduce the computational complexity and simultaneously maintain the system’s performance. The results of experiments presented that the agent successfully learned the policy and efficiently adjusted to the changing in multi-layer environment. Finally, the computational complexity and the decline in effectiveness of the policy improvement were controlled by using our proposed system.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330156","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}
Pub Date : 2014-10-15DOI: 10.4236/JILSA.2014.64013
J. Yeh, Renxu Yang
Using a genetic algorithm owing to high nonlinearity of constraints, this paper first works on the optimal design of two-span continuous singly reinforced concrete beams. Given conditions are the span, dead and live loads, compressive strength of concrete and yield strength of steel; design variables are the width and effective depth of the continuous beam and steel ratios for positive and negative moments. The constraints are built based on the ACI Building Code by considering the strength requirements of shear and the maximum positive and negative moments, the development length of flexural reinforcement, and the serviceability requirement of deflection. The objective function is to minimize the total cost of steel and concrete. The optimal data found from the genetic algorithm are divided into three groups: the training set, the checking set and the testing set for the use of the adaptive neuro-fuzzy inference system (ANFIS). The input vector of ANFIS consists of the yield strength of steel, compressive strength of concrete, dead load, span, width and effective depth of the beam; its outputs are the minimum total cost and optimal steel ratios for positive and negative moments. To make ANFIS more efficient, the technique of Subtractive Clustering is applied to group the data to help streamline the fuzzy rules. Numerical results show that the performance of ANFIS is excellent, with correlation coefficients between the three targets and outputs of the testing data being greater than 0.99.
{"title":"Application of the Adaptive Neuro-Fuzzy Inference System for Optimal Design of Reinforced Concrete Beams","authors":"J. Yeh, Renxu Yang","doi":"10.4236/JILSA.2014.64013","DOIUrl":"https://doi.org/10.4236/JILSA.2014.64013","url":null,"abstract":"Using a genetic algorithm owing to high nonlinearity of constraints, this paper first works on the optimal design of two-span continuous singly reinforced concrete beams. Given conditions are the span, dead and live loads, compressive strength of concrete and yield strength of steel; design variables are the width and effective depth of the continuous beam and steel ratios for positive and negative moments. The constraints are built based on the ACI Building Code by considering the strength requirements of shear and the maximum positive and negative moments, the development length of flexural reinforcement, and the serviceability requirement of deflection. The objective function is to minimize the total cost of steel and concrete. The optimal data found from the genetic algorithm are divided into three groups: the training set, the checking set and the testing set for the use of the adaptive neuro-fuzzy inference system (ANFIS). The input vector of ANFIS consists of the yield strength of steel, compressive strength of concrete, dead load, span, width and effective depth of the beam; its outputs are the minimum total cost and optimal steel ratios for positive and negative moments. To make ANFIS more efficient, the technique of Subtractive Clustering is applied to group the data to help streamline the fuzzy rules. Numerical results show that the performance of ANFIS is excellent, with correlation coefficients between the three targets and outputs of the testing data being greater than 0.99.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330113","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：