• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.59-62
• /
• 2007

본 논문에서는 불균형 및 Under-sampling된 바이오 데이터에 대하여 클래스 구분력이 없는 특징의 소거를 통해 이후 이어질 FLDA 둥 다양한 방법론올 적용할 수 있는 방법을 제안하고자 한다. 제안하는 알고리즘은 평균과 분산을 통해 클래스의 형태를 결정하는 기존 방법론의 문제점을 회피할 수 있는 방법을 제공하며, 클래스 구분력에 중점을 두어 특정을 선별하였을 경우 선별된 특정들의 상관 계수가 높은 문제를 극복할 수 있도록 한다. 이에 따라 알고리즘이 선택한 특정집합은 서로의 특징에 대해 상관계수가 낮으며, 클래스의 구분력이 높은 특정을 갖게 된다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 한국퍼지및지능시스템학회 2004년도 춘계학술대회 학술발표 논문집 제14권 제1호
• /
• pp.345-348
• /
• 2004

플레이어의 상대 역할을 수행하는 NPC(Non-Player Character)의 구현은 게임에서 재미요소를 좌우하는 중요한 부분이다. 일반적인 NPC는 설정된 값에 따라, 동일한 조건에 대해 동일하게 반응하므로 플레이어로 하여금 예측 가능하게 하여 게임의 재미를 저하시키는 요인이 된다. 따라서 플레이어의 행동과 수준에 대하여 지능적으로 적절히 반응하는 NPC 기술이 필요하다. 본 논문은 퍼지 플러스터링을 이용한 플레이어의 게임 성향을 기반으로 NPC의 행동 반응을 조절함으로써 게임에 동적인 반응을 보이며 플레이어의 수준에 적절히 반응하도록 하는 NPC 기법을 제안한다.

• The Bulletin of The Korean Astronomical Society
• /
• 제46권2호
• /
• pp.43.3-43.3
• /
• 2021

The peculiar motion of the observer, if not (or only imperfectly) accounted for, is bound to induce a well-defined clustering signal in the distribution of galaxies. This spurious signal is related to the Kaiser rocket effect. We examined the amplitude of this effect and discuss possible implications for analysis and interpretation of future cosmological surveys. We found that it can in principle bias very significantly the inference of cosmological parameters, especially for primordial non-Gaussianity.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제17권12호
• /
• pp.9-16
• /
• 2016

Wireless sensor networks (WSN) are composed of sensor nodes and a base station. The sensor nodes deploy a non-accessible area, receive critical information, and transmit it to the base station. The information received is applied to real-time monitoring, distribution, medical service, etc.. Recently, the WSN was extended to mobile wireless sensor networks (MWSN). The MWSN has been applied to wild animal tracking, marine ecology, etc.. The important issues are mobility and energy consumption in MWSN. Because of the limited energy of the sensor nodes, the energy consumption for data transmission affects the lifetime of the network. Therefore, efficient data transmission from the sensor nodes to the base station is necessary for sensing data. This paper, proposes an energy consumption model using two-tier clustering in mobile sensor networks (TTCM). This method divides the entire network into two layers. The mobility problem was considered, whole energy consumption was decreased and clustering methods of recent researches were analyzed for the proposed energy consumption model. Through analysis and simulation, the proposed TTCM was found to be better than the previous clustering method in mobile sensor networks at point of the network energy efficiency.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제62권4호
• /
• pp.554-561
• /
• 2013

In this paper, we introduce a modeling and a process simulator developed with the aid of pRBFNNs for activated sludge process in the sewage treatment system. Activated sludge process(ASP) of sewage treatment system facilities is a process that handles biological treatment reaction and is a very complex system with non-linear characteristics. In this paper, we carry out modeling by using essential ASP factors such as water effluent quality, the manipulated value of various pumps, and water inflow quality, and so on. Intelligent algorithms used for constructing process simulator are developed by considering multi-output polynomial radial basis function Neural Networks(pRBFNNs) as well as Fuzzy C-Means clustering and Particle Swarm Optimization. Here, the apexes of the antecedent gaussian functions of fuzzy rules are decided by C-means clustering algorithm and the apexes of the consequent part of fuzzy rules are learned by using back-propagation based on gradient decent method. Also, the parameters related to the fuzzy model are optimized by means of particle swarm optimization. The coefficients of the consequent polynomial of fuzzy rules and performance index are considered by the Least Square Estimation and Mean Squared Error. The descriptions of developed process simulator architecture and ensuing operation method are handled.

• Spatial Information Research
• /
• 제8권2호
• /
• pp.301-315
• /
• 2000

Every, year, a great amount of site investigation data is collected on site to obtain sufficient conditions. Investigation of subsurface conditions is prerequisite to the design and construction of structures and also provides information on ground properties such as geologic formation and types of soil. This data set, which portrays real representation of ground conditions over the existing geologic and soil maps, could be further utilized for analyzing the subsurface conditions. It is therefore necessary to develope a subsurface exploration analysis system which is able to extract the valuable information from the heterogeneous, non-normalized subsurface investigation data. This paper presents the overall design scheme and implementation on a subsurface exploration analysis system. The analysis system employs one of data set such as bore-hole data. The clustering technique employed in the developed system makes a large volume of bore-hole data into several groups in terms of ground formation and geographical vicinity. As a result of clustering, each group or cluster consists of bore-hole data with similar characteristics of subsurface and geographical vicinity. In addition, each clustered data is displayed on digital topographical map with different color so that the analysis of site investigation data could be performed in more sensible ways.

• Journal of the Korean Data and Information Science Society
• /
• 제26권4호
• /
• pp.857-864
• /
• 2015

By Wikipedia, data mining is the computational process of discovering patterns in huge data sets involving methods at the intersection of association rule, decision tree, clustering, artificial intelligence, machine learning. Clustering or cluster analysis is the task of grouping a set of objects in such a way that objects in the same group are more similar to each other than to those in other groups. The similarity measures being used in the clustering may be classified into various types depending on the characteristics of data. In this paper, we computed bounds for similarity measures based on the probabilistic interestingness measure with partially marginal probability such as Peirce I, Peirce II, Cole I, Cole II, Loevinger, Park I, and Park II measure. We confirmed the absolute value of Loevinger measure wasthe upper limit of the absolute value of any other existing measures. Ordering of other measures is determined by the size of concurrence proportion, non-simultaneous occurrence proportion, and mismatch proportion.

• Journal of Environmental Science International
• /
• 제15권12호
• /
• pp.1125-1139
• /
• 2006

The cluster analysis of diurnal precipitation patterns is performed by using daily precipitation of 59 stations in South Korea from 1973 to 1996 in four seasons of each year. Four seasons are shifted forward by 15 days compared to the general ones. Number of clusters are 15 in winter, 16 in spring and autumn, and 26 in summer, respectively. One of the classes is the totally dry day in each season, indicating that precipitation is never observed at any station. This is treated separately in this study. Distribution of the days among the clusters is rather uneven with rather low area-mean precipitation occurring most frequently. These 4 (seasons)$\times$2 (wet and dry days) classes represent more than the half (59 %) of all days of the year. On the other hand, even the smallest seasonal clusters show at least $5\sim9$ members in the 24 years (1973-1996) period of classification. The cluster analysis is directly performed for the major $5\sim8$ non-correlated coefficients of the diurnal precipitation patterns obtained by factor analysis In order to consider the spatial correlation. More specifically, hierarchical clustering based on Euclidean distance and Ward's method of agglomeration is applied. The relative variance explained by the clustering is as high as average (63%) with better capability in spring (66%) and winter (69 %), but lower than average in autumn (60%) and summer (59%). Through applying weighted relative variances, i.e. dividing the squared deviations by the cluster averages, we obtain even better values, i.e 78 % in average, compared to the same index without clustering. This means that the highest variance remains in the clusters with more precipitation. Besides all statistics necessary for the validation of the final classification, 4 cluster centers are mapped for each season to illustrate the range of typical extremities, paired according to their area mean precipitation or negative pattern correlation. Possible alternatives of the performed classification and reasons for their rejection are also discussed with inclusion of a wide spectrum of recommended applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제24권10B호
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제20권1호
• /
• pp.58-64
• /
• 2016

In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.