• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2157-2164
• /
• 2011

In this paper, we introduce a new category of fuzzy inference system based on Type-2 fuzzy c-means clustering algorithm (T2FCM-based FIS). The premise part of the rules of the proposed model is realized with the aid of the scatter partition of input space generated by Type-2 FCM clustering algorithm. The number of the partition of input space is composed of the number of clusters and the individual partitioned spaces describe the fuzzy rules. Due to these characteristics, we can alleviate the problem of the curse of dimensionality. The consequence part of the rule is represented by polynomial functions with interval sets. To determine the structure and estimate the values of the parameters of Type-2 FCM-based FIS we consider the successive tuning method with generation-based evolution by means of real-coded genetic algorithms. The proposed model is evaluated with the use of numerical experimentation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5449-5464
• /
• 2018

Recent works have validated the possibility of reducing the energy consumption in wireless heterogeneous networks, achieved by switching on/off some base stations (BSs) dynamically. In this paper, to realize energy conservation, the discrete time Markov Decision Process (DTMDP) is developed to match up the BS switching operations with the traffic load variations. Then, an asynchronous decision-making algorithm, which is based on the Bellman equation and the on/off priorities of the BSs, is firstly put forward and proved to be optimal in this paper. Through reducing the state and action space during one decision, the proposed asynchronous algorithm can avoid the "curse of dimensionality" occurred in DTMDP frequently. Finally, numerical simulations are conducted to validate the effectiveness and advantages of the proposed asynchronous on/off strategies.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.237-244
• /
• 2021

Clustering is a most powerful un-supervised machine learning techniques for division of instances into homogenous group, which is called cluster. This Clustering is mainly used for generating a good quality of cluster through which we can discover hidden patterns and knowledge from the large datasets. It has huge application in different field like in medicine field, healthcare, gene-expression, image processing, agriculture, fraud detection, profitability analysis etc. The goal of this paper is to explore both hierarchical as well as partitioning clustering and understanding their problem with various approaches for their solution. Among different clustering K-means is better than other clustering due to its linear time complexity. Further this paper also focused on data mining that dealing with high-dimensional datasets with their problems and their existing approaches for their relevancy

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.109.3-109
• /
• 2001

The so-called curse of dimensionality arises when Gaussian mixture is used on high-dimensional small-sample-size data, since the number of free elements that needs to be specied in each covariance matrix of Gaussian mixture increases exponentially with the number of dimension d. In this paper, by constraining the covariance matrix in its decomposed orthonormal form we get a local PCA model so as to reduce the number of free elements needed to be specified. Moreover, to cope with the small sample size problem, we adopt BYY data smoothing learning which is a regularization over maximum likelihood learning obtained from BYY harmony learning to implement this local PCA model.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.157-166
• /
• 2001

In this paper we propose a feature vector extraction technique using regression of shape features for the content-based image retrieval system. The proposed technique can reduce the number of dimensions of a feature vector by converting the extracted high-dimensional feature vector into a specific n-dimensional feature vector. This paper shows how to resolve the 'dimensionality curse' problem by reducing the number of dimensions of a feature vector, and shows that the technique is more efficient than the conventional techniques for the practical image retrievals.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.29.1-29
• /
• 2001

Neuro-fuzzy systems are multi-layered connectionist networks that realize the elements and functions of traditional fuzzy logic control/decision systems. A trained neuro-fuzzy system is isomorphic to a fuzzy logic system, and fuzzy IF-THEN rule knowledge can be explicitly extracted from the network. This talk presents a brief introduction to self-adaptive neuro-fuzzy systems and addresses some recent research results and applications. Most of the existing neuro-fuzzy systems exhibit several major drawbacks that lead to performance degradation. These drawbacks are the curse of dimensionality (i.e., fuzzy rule explosion), inability to re-structure their internal nodes in a changing environment, and their lack of ability to extract knowledge from a given set of training data. This talk focuses on our investigation of network architectures, self-adaptation algorithms, and efficient learning algorithms that will enable existing neuro-fuzzy systems to self-adapt themselves in an unstructured and uncertain environment.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.517-524
• /
• 2004

For real world applications of reinforcement learning techniques, function approximation or generalization will be required to avoid curse of dimensionality. For this, an improved function approximation-based reinforcement teaming method is proposed to speed up convergence by using CA-CMAC(Credit-Assigned Cerebellar Model Articulation Controller). To show that our proposed CACRL(CA-CMAC-based Reinforcement Learning) performs better than the CRL(CMAC- based Reinforcement Learning), computer simulation and experiment results are illustrated, where a swing-up control Problem of an acrobot is considered.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.621-624
• /
• 2003

For real world applications of reinforcement learning techniques, function approximation or generalization will be required to avoid curse of dimensionality. For this, an improved function approximation-based reinforcement learning method is proposed to speed up convergence by using CA-CMAC(Credit-Assigned Cerebellar Model Articulation Controller). To show that our proposed CACRL(CA-CMAC-based Reinforcement Learning) performs better than the CRL(CMAC-based Reinforcement Learning), computer simulation results are illustrated, where a swing-up control problem of an acrobot is considered.

• The Korean Journal of Applied Statistics
• /
• v.5 no.1
• /
• pp.103-111
• /
• 1992

The projection pursuit method has been gussested as a technique for the analysis of the multivariate data. This method seeks out interesting linear projections of the multivariate data onto a line of a plane to solve the curse or dimensionality. In this paper we developed the discriminant analysis by using the projection method and simulations were used for comparison between this and other existing discriminant analysis methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.232-234
• /
• 2004

강화 학습(Reinforcement Learning)을 실제 문제에 적용하는 데 있어 가장 큰 문제는 차원성의 저주(Curse of dimensionality)이다. 문제가 커짐에 따라 목적을 이루기 위해서 더 않은 단계의 판단이 필요하고 이에 따라 문제의 해결이 지수적으로 어려워지게 된다. 이를 해결하기 위칠 문제를 여러 단계로 나누어 단계별로 학습하는 계층적 강화 학습(Hierarchical Reinforcement Learning)이 제시된 바 있다. 하지만 대부분의 계층적 강화 학습 방법들은 사전에 문제의 구조를 아는 것을 전제로 하며 큰 사이즈의 문제를 간단히 표현할 방법을 제시하지 않는다. 따라서 이들 방법들도 실제적인 문제에 바로 적용하기에는 적합하지 않다. 이러한 문제점들을 해결하기 위해 복잡계 네트워크(Complex Network)가 갖는 작은 세상 성질(Small world Property)에 착안하여 자기조직화 하는 생장 네트워크(Self organizing growing network)를 기반으로 한 환경 표현 모델이 제안된 바 있다. 이러한 모델에서는 문제 크기가 커지더라도 네트워크의 사이즈가 크게 커지지 않기 때문에 문제의 난이도가 크기에 따라 크게 증가하지 않을 것을 기대할 수 있다. 본 논문에서는 이러한 환경 모델을 사용한 강화 학습 알고리즘을 구현하고 실험을 통하여 각 모델이 강화 학습의 문제 사이즈에 따른 성능에 끼치는 영향에 대해 알아보았다.