• Computers and Concrete
• /
• v.21 no.6
• /
• pp.697-703
• /
• 2018

Compressive strength is one of the most important engineering properties of concrete, and testing of the compressive strength of concrete specimens is often costly and time consuming. In order to provide the time for concrete form removal, re-shoring to slab, project scheduling and quality control, it is necessary to predict the concrete strength based upon the early strength data. However, concrete compressive strength is affected by many factors, such as quality of raw materials, water cement ratio, ratio of fine aggregate to coarse aggregate, age of concrete, compaction of concrete, temperature, relative humidity and curing of concrete. The concrete compressive strength is a quite nonlinear function that changes depend on the materials used in the concrete and the time. This paper presents an adaptive neuro-fuzzy inference system (ANFIS) for the prediction of concrete compressive strength. The training of fuzzy system was performed by a hybrid method of gradient descent method and least squares algorithm, and the subtractive clustering algorithm (SCA) was utilized for optimizing the number of fuzzy rules. Experimental data on concrete compressive strength in the literature were used to validate and evaluate the performance of the proposed ANFIS model. Further, predictions from three models (the back propagation neural network model, the statistics model, and the ANFIS model) were compared with the experimental data. The results show that the proposed ANFIS model is a feasible, efficient, and accurate tool for predicting the concrete compressive strength.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.346-351
• /
• 2007

다중 전극으로 측정한 활동 전위의 분류(Multi-electrode spike sorting)는 단일 전극(single-electrode)보다 더 정확한 결과를 보여준다. 그러나 다중 전극에서 주어지는 활동 전위 크기들의 클러스터는 일반적으로 분류하기 쉴지 않은 문제이다. 이 논문에서는 고전적인 클러스터링 알고리듬 중의 하나인 Mountain method를 수정하여 다중 전극 활동전위의 분류에 적합한 알고리듬을 제안한다. 통상적인 데이터 클러스터링이 아닌 공간 분할을 통해 신경 데이터의 다양한 클러스터에 대해서 적응도가 높아지고 빠른 분류를 하게 된다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1431-1438
• /
• 2004

Reinforcement learning learns policies for accomplishing a task's goal by experience through interaction between agent and environment. Q-learning, basis algorithm of reinforcement learning, has the problem of curse of dimensionality and slow learning speed in the incipient stage of learning. In order to solve the problems of Q-learning, new function approximation methods suitable for reinforcement learning should be studied. In this paper, to improve these problems, we suggest Fuzzy Q-Map algorithm that is based on online fuzzy clustering. Fuzzy Q-Map is a function approximation method suitable to reinforcement learning that can do on-line teaming and express uncertainty of environment. We made an experiment on the mountain car problem with fuzzy Q-Map, and its results show that learning speed is accelerated in the incipient stage of learning.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.6-11
• /
• 2005

In this paper, we propose a new fuzzy clustering scheme that optimizes the initial structure and the parameters to improve the performance of a intelligent systems. The proposed method keeps the good properties of clustering, and improves the total systems' performance at the same time, Especially, the proposed algorithm not only keeps robust to change threshold value in the optimization process, but also improves the performance of a system through the process of the self-organizing and the converging intelligent systems in its structure of cluster. In experiments, the superiority of the proposed scheme is presented by comparing its performance with other methods.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.587-592
• /
• 2003

Many real world control problems have continuous states and actions. When the state space is continuous, the reinforcement learning problems involve very large state space and suffer from memory and time for learning all individual state-action values. These problems need function approximators that reason action about new state from previously experienced states. We introduce Fuzzy Q-Map that is a function approximators for 1 - step Q-learning and is based on fuzzy clustering. Fuzzy Q-Map groups similar states and chooses an action and refers Q value according to membership degree. The centroid and Q value of winner cluster is updated using membership degree and TD(Temporal Difference) error. We applied Fuzzy Q-Map to the mountain car problem and acquired accelerated learning speed.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1054-1061
• /
• 2003

Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map

• Journal of Industrial Technology
• /
• v.17
• /
• pp.323-330
• /
• 1997

In this paper, a new approach to modeling of nonlinear systems using fuzzy theory is presented. To express the various and complex behavior of nonlinear system, we combine multiple model method with hierachical prioritized structure, and the mountain clustering technique is used in partitioning of system. TSK rule structure is adopted to form the fuzzy rules, and Back propagation algorithm is used for learning parameters in consequent parts of the rules. Also we soften the paradigm of Mamdani's inference mechanism by using Yager's S-OWA operators. Computer simulations are performed to verify the effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.382-384
• /
• 2004

In this parer, we propose a clustering that perform algorithm using new convergence properties. For detection and optimization of cluster, we use to similarity measure with cumulative probability and to inference the its parameters with MLE. A merits of using the cumulative probability in our method is very effectiveness that robust to noise or unnecessary data for inference the parameters. And we adopt similarity threshold to converge the number of cluster that is enable to past convergence and delete the other influence for this learning algorithm. In the simulation, we show effectiveness of our algorithm for convergence and optimization of cluster in riven data set.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.941-949
• /
• 2011

In this paper, 72 weather stations in Korea are clustered by the hierarchical agglomerative procedure based on the average linkage method. We compare our clusters and stations divided by mountain chains which are applied to study on the impact analysis of foodborne disease outbreak due to climate change.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.425-427
• /
• 1997

In this paper, a new approach to modeling and control of nonlinear systems using fuzzy theory is presented. To express the various and complex behavior of nonlinear system, we combine multiple model method with hierachical prioritized structure. The mountain clustering technique is used in partitioning of system, and TSK rule structure is adopted to form the fuzzy rules. Also we soften the paradigm of Mamdani's inference mechanism by using Yager's S-OWA operators.