• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.6
• /
• pp.1159-1166
• /
• 2010

To improve prediction quality of a nonlinear prediction system, the system's capability for uncertainty of nonlinear data should be satisfactory. This paper presents a TSK fuzzy prediction system that can consider and deal with the uncertainty of nonlinear data sufficiently. In the design procedures of the proposed system, HCBKA(Hierarchical Correlationship-Based K-means clustering Algorithm) was used to generate the accurate fuzzy rule base that can control output according to input efficiently, and the first-order difference method was applied to reflect various characteristics of the nonlinear data. Also, multiple prediction systems were designed to analyze the prediction tendencies of each difference data generated by the difference method. In addition, to enhance the prediction quality of the proposed system, an error compensation method was proposed and it compensated the prediction error of the systems suitably. Finally, the prediction performance of the proposed system was verified by simulating two typical time series examples.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.420-423
• /
• 2001

In this paper, the Multi-FNNs(Fuzzy-Neural Networks) architecture is identified and optimized using HCM(Hard C-Means) clustering method and genetic algorithms. The proposed Multi-FNNs architecture uses simplified inference and linear inference as fuzzy inference method and error back propagation algorithm as learning rules. Here, HCM clustering method, which is carried out for the process data preprocessing of system modeling, is utilized to determine the structure of Multi-FNNs according to the divisions of input-output space using I/O process data. Also, the parameters of Multi-FNNs model such as apexes of membership function, learning rates and momentum coefficients are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is used to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model we use the time series data for gas furnace and the NOx emission process data of gas turbine power plant.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.45-48
• /
• 2003

We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.566-568
• /
• 1998

In this paper, we suggest a optimal design method of Fuzzy-Neural Networks model for complex and nonlinear systems. FNNs have the stucture of fusion of both fuzzy inference with linguistic variables and Neural Networks. The network structure uses the simpified inference as fuzzy inference system and the BP algorithm as learning procedure. And we use a clustering algorithm to find initial parameters of membership function. The parameters such as membership functions, learning rates and momentum coefficients are easily adjusted using the genetic algorithms. Also, the performance index with weighted value is introduced to achieve a meaningful balance between approximation and generalization abilities of the model. To evaluate the performance index, we use the time series data for gas furnace and the sewage treatment process.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.43-52
• /
• 1994

A design method of rule-based fuzzy modeling is presented for the model identification of complex and nonlinear systems. The proposed rule-based fuzzy modeling implements system structure and parameter identification in the efficient form of ``IF....,THEN...', using the theories of optimization theory , linguistic fuzzy implication rules and fuzzy c-means clustering. Three kinds of method for fuzzy modeling presented in this paper include simplified inference (type I), linear inference (type 2), and modified linear inference (type 3). In order to identify premise structure and parameter of fuzzy implication rules, fuzzy c- means clustering and modified complex method are used respectively and the least sequare method is utilized for the identification of optimum consequence parameters. Time series data for gas furance and those for sewage treatment process are used to evaluate the performance of the proposed rule-based fuzzy modeling. Comparison shows that the proposed method can produce the fuzzy model with higher accuracy than previous other studies.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.23-29
• /
• 2015

Energy constraints of wireless sensor networks are an important challenge. Data Transmission requires energy. Distance between origin and destination has an important role in energy consumption. In addition, the location of base station has a large impact on energy consumption and a specific method not proposed for it. In addition, a obtain model for location of base station proposed. Also a model for distributed clustering is presented by cluster heads. Eventually, a combination of discussed ideas is proposed to improve the energy consumption. The proposed ideas have been implemented over the LEACH-C protocol. Evaluation results show that the proposed methods have a better performance in energy consumption and lifetime of the network in comparison with similar methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.585-588
• /
• 2018

시계열 데이터의 특징을 추출하여 분석하는 과정에서 시게열 데이터가 가지는 고차원성은 차원의 저주(Course of Dimensionality)로 인해 데이터내의 유효한 정보를 찾는데 어려움을 만든다. 이러한 문제를 해결하기 위해 차원 축소 기법(dimensionality reduction)이 널리 사용되고 있지만, 축소 과정에서 발생하는 정보의 희석으로 인하여 시계열 데이터에 대한 군집화(clustering)등을 수행하는데 있어서 성능의 변화를 가져온다. 본 논문은 이러한 현상을 관찰하기 위해 이산 웨이블릿 변환(Discrete Wavelet Transform:DWT)과 오토 인코더(AutoEncoder)를 차원 축소 기법으로 활용하여 시계열 데이터의 차원을 압축 한 뒤, 압축된 데이터를 K-평균(K-means) 알고리즘에 적용하여 군집화의 효율성을 비교하였다. 성능 비교 결과, DWT는 압축된 차원수 그리고 오토인코더는 시계열 데이터에 대한 충분한 학습이 각각 보장된다면 좋은 군집화 성능을 보이는 것을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4624-4644
• /
• 2019

With the development of films, games and animation industry, analysis and reuse of human motion capture data become more and more important. Human motion segmentation, which divides a long motion sequence into different types of fragments, is a key part of mocap-based techniques. However, most of the segmentation methods only take into account low-level physical information (motion characteristics) or high-level data information (statistical characteristics) of motion data. They cannot use the data information fully. In this paper, we propose an unsupervised framework using both low-level physical information and high-level data information of human motion data to solve the human segmentation problem. First, we introduce the algorithm of CFSFDP and optimize it to carry out initial segmentation and obtain a good result quickly. Second, we use the ACA method to perform optimized segmentation for improving the result of segmentation. The experiments demonstrate that our framework has an excellent performance.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.925-937
• /
• 2008

In this study, we considered the clustering analysis for stock return traded in the stock market. Most of financial time-series data, for instance, stock price and exchange rate have conditional heterogeneous variability depending on time, and, hence, are not properly applied to the autoregressive moving-average(ARMA) model with assumption of constant variance. Moreover, the variability is font and center for stock investors as well as academic researchers. So, this paper focuses on the generalized autoregressive conditional heteroscedastic(GARCH) model which is known as a solution for capturing the conditional variance(or volatility). We define the metrics for similarity of unconditional volatility and for homogeneity of model structure, and, then, evaluate the performances of the metrics. In real application, we do clustering analysis in terms of volatility and structure with stock return of the 11 Korean companies measured for the latest three years.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.369-380
• /
• 1996

Inductive Loop Detector(ILD) has been commonly used in collecting traffic data such as occupancy time and non-occupancy time. From the data, the traffic volume and type of passing vehicle is calculated. To provide reliable data for traffic control and plan, accuracy is required in type recognition which can be utilized to determine split of traffic signal and to provide forecasting data of queue-length for over-saturation control. In this research, a new recognition model issuggested for recognizing typeof vehicle from thecollected data obtained through ILD systems. Two clustering methods, based on statistical algorithms, and one neural network clustering method were employed to test the reliability and occuracy for the methods. In a series of experiments, it was found that the new model can greatly enhance the reliability and accuracy of type recongition rate, much higher than conventional approa-ches. The model modifies the neural network clustering method and enhances the recongition accuracy by iteratively applying the algorithm until no more unclustered data remains.