• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.231-238
• /
• 2002

As a modeling method where the merits of fuzzy inference system and evolutionary computation are put together, evolutionary fuzzy modeling performs global approximate optimization. The paper proposes fuzzy clustering as fuzzy rule generation process which is one of the most important steps in evolutionary fuzzy modeling. With application of fuzzy clustering into the experiment or simulation results, fuzzy rules which properly describe non-linear and complex design problem can be obtained. The efficiency of evolutionary fuzzy modeling can be improved utilizing the membership degrees of data to clusters from the results of fuzzy clustering. To ensure the validity of the proposed method, the real design problem of an automotive inner trim is applied and the global approximation is achieved. Evolutionary fuzzy modeling is performed for several cases which differ in the number of clusters and the criterion of rule selection and their results are compared to prove that the proposed method can provide proper fuzzy rules for a given system and reduce computation time while maintaining the errors of modeling as a satisfactory level.

• Journal of the Korean Academic Society of Industrial Cluster
• /
• v.2 no.1
• /
• pp.1-13
• /
• 2008

Despite growing recognition of the significance of industrial clusters to regional economic success, there has been only limited attention paid to the effectiveness of cluster policies in old industrial regions. Many of these regions still retain functioning industrial clusters, or have clusters which are adopting new strategies as part of a process of regeneration. This paper argues that the effectiveness of cluster policies in old industrial regions depends upon the extent to which they recognise the evolutionary nature of industrial clusters. It reviews the literature on the transformation of old industrial regions in Europe, and examines how cluster policies have risen to prominence as a policy tool. These strands ate brought together in an exploration of cluster policies in old industrial regions. A brief case study is presented of the evolution of the steel industry supply chain in north east England. The conclusions focus upon the data requirements that form a starting point for informed policy intervention into presses of cluster evolution.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.89-96
• /
• 2007

Various classification methods have been developed to reuse components. These classification methods enable the user to access the needed components quickly and easily. Conventional classification approaches include the following problems: a labor-intensive domain analysis effort to build a classification structure, the representation of the inter-component relationships, difficult to maintain as the domain evolves, and applied to a limited domain. In order to solve these problems, this paper describes a composite cluster analysis approach for component classification. The cluster analysis approach is a combination of a hierarchical cluster analysis method, which generates a stable clustering structure automatically, and a non-hierarchical cluster analysis concept, which classifies new components automatically. The clustering information generated from the proposed approach can support the domain analysis process.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.27-37
• /
• 2009

Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.80-90
• /
• 2002

Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

• Journal of the Korean association of regional geographers
• /
• v.22 no.2
• /
• pp.397-410
• /
• 2016

Although industrial complexes have played as an engine of the Korean economy for the last 40 years, the majority of industrial complexes shows limitations to the continuous growth such as a lack of innovation capabilities and social capital, conceived as a key to transforming into clusters of innovation. To overcome those problems, the Korean government embarked on the cluster policy from the mid 2000's, focusing on promoting the endogenous development capabilities of individual industrial complexes. Drawing upon the in-depth case study of the Gumi IT cluster, one of the representative large-scale industrial complexes in Korea, the authors conclude that the cluster policy has contributed to making the Gumi IT cluster enhance the capabilities of endogenous development through the facilitation of self-organizing learning communities within the cluster.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.139-148
• /
• 2008

The sensor network is applied from the field which is various. The sensor network nodes are exchanged with mobile environment and they construct they select cluster and cluster headers. In this paper, we propose the Dynamic Prediction Clustering Algorithm use to Skyline queries attributes in direction, angel and hop. This algorithm constructs cluster in base mobile sensor node after select cluster header. Propose algorithm is based made cluster header for mobile sensor node. It "Adv" reduced the waste of energy which mobile sensor node is unnecessary. Respects clustering where is efficient according to hop count of sensor node made dynamic cluster. To extend a network life time of 2.4 times to decrease average energy consuming of sensor node. Also maintains dynamic cluster to optimize the within hop count cluster, the average energy specific consumption of node decreased 14%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.16-18
• /
• 2006

데이터마이닝 기법의 클러스터링 알고리즘은 생물정보학에서 데이터 셋의 사전 정보를 고려하지 않고 중요한 유전적, 생물학적 상호작용을 찾기 위하여 적용되고 있다. 그러나 다양한 형식의 수많은 알고리즘들은 바이오데이터의 다양한 특성들과 실험의 가정 때문에 다른 클러스터링 결과들을 만들 수 있다. 본 논문에서는 바이오 데이터 셋의 특성에도 적합하면서 양질의 클러스터링 결과를 만들기 위한 새로운 방법을 제안한다. 이 방법은 여러 가지 클러스터링 알고리즘의 결과들을 유전자 알고리즘의 기본 개념인 진화적 환경에서 가장 적합한 형질을 선택하는 문제와 결합하였다. 그리고 실제 데이터 셋을 이용하여 우리의 제안하는 방법을 증명하고 실험 결과로 최적의 클러스터 결과를 보인다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.62-68
• /
• 2009

Two new generation gap models with modified parent-centric recombination(PCX) operator are proposed. First, the self-adaptation generation gap(SGG) model is a control method that keeps a replaced probability of parents by offspring to a certain level which obtains better performance. Second, virtual cluster generation gap(VCGG) is provided to extend distances among parents using clustering, which causes it to diversify individuals. In this model, distances among parents can be controlled by size of clusters. To demonstrate the effectiveness of our two proposed approaches, experiments for three standard test problems are executed and compared to most competing current approaches, CMA-ES and Generalized Generation Gap(G3) with PCX. It is shown two proposed methods are superior to consistently other approaches in the study.

• Journal of the Economic Geographical Society of Korea
• /
• v.16 no.4
• /
• pp.567-584
• /
• 2013

This study aims to explore an evolutionary path of the IT service industry in Fairfax County using the Cluster Adaptive Cycle model in economic geography. The analysis is based on detailed historical and industrial information obtained through a variety of data sources including local archival materials, economic census, and interviews. This study also performs a shift-share analysis during the period of 1990 to 2011. Using the adaptive cycle model, the local IT service industry is indicated by a trajectory of constant cluster mutation. The evolution of the local IT service industry has been closely related to federal government policy due to the regional specificity of the National Capital Region and the proximity of the Department of Defense. Although the economic downturn of the late 2000s, the local IT service industry has been notable resilience and adapted to a changing market and technological environment. This constant mutation of the local industry is resulted from not only high resilience which is based on the large government procurement market, the reinforcement of adaptive capacity of the local firms and the network of economic agents such as firm and supporting institutions, but also high flexibility of the knowledge-based service industry to a changing business environment.