• Title/Summary/Keyword: cluster-merging

Search Result 94, Processing Time 0.024 seconds

Cluster Merging Using Density based Fuzzy C-Means algorithm (밀도 기반의 퍼지 C-Means 알고리즘을 이용한 클러스터 합병)

  • 한진우;전성해;오경환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.05a
    • /
    • pp.235-238
    • /
    • 2003
  • Fuzzy C-Means(FCM) 알고리즘은 초기 군집 중심의 개수와 위치에 따라 군집 결과의 성능차이가 많이 나타난다. 하지만 일반적인 경우에 군집 중심의 개수는 분석가의 주관에 의해 결정되고, 임의적으로 결정되기 때문에 원래 데이터의 구조와는 무관하게 수행되어 최적화된 군집화 수행을 실행하지 못하는 경우가 발생하게 된다. 따라서 본 논문에서는 원래의 데이터의 구조에 좀더 근접한 퍼지 군집화를 수행하기 위하여 격자를 바탕으로 한 데이터의 밀도를 이용한 FCM을 제안하고, 이러한 밀도 기반 FCM에 의해 결정된 군집의 합병 기법을 제안하였다. N-차원의 데이터 공간을 N-차원의 격자로 나누고, 초기 군집 중심의 개수와 위치는 각 격자의 밀도를 바탕으로 결정된다. 초기화 이후에 각 격자 내부에서 FCM을 이용하여 군집화를 수행하고, 계속해서 이웃 격자의 군집결과에 대하여 군집간의 유사도 측도를 이용하여 군집 합병을 수행함으로써 데이터의 자연적인 구조에 근접한 군집화를 수행하였다. 제안된 군집화 합병 기법의 향상된 성능은 UCI Machine Learning Repository 데이터를 이용하여 확인하였다.

  • PDF

Application of Genetic and Local Optimization Algorithms for Object Clustering Problem with Similarity Coefficients (유사성 계수를 이용한 군집화 문제에서 유전자와 국부 최적화 알고리듬의 적용)

  • Yim, Dong-Soon;Oh, Hyun-Seung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.1
    • /
    • pp.90-99
    • /
    • 2003
  • Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

A CLB-based CPLD Low-power Technology Mapping Algorithm considered a Trade-off

  • Youn, Choong-Mo;Kim, Jae-Jin
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.59-63
    • /
    • 2007
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

Fast Outlier Removal for Image Registration based on Modified K-means Clustering

  • Soh, Young-Sung;Qadir, Mudasar;Kim, In-Taek
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.1
    • /
    • pp.9-14
    • /
    • 2015
  • Outlier detection and removal is a crucial step needed for various image processing applications such as image registration. Random Sample Consensus (RANSAC) is known to be the best algorithm so far for the outlier detection and removal. However RANSAC requires a cosiderable computation time. To drastically reduce the computation time while preserving the comparable quality, a outlier detection and removal method based on modified K-means is proposed. The original K-means was conducted first for matching point pairs and then cluster merging and member exclusion step are performed in the modification step. We applied the methods to various images with highly repetitive patterns under several geometric distortions and obtained successful results. We compared the proposed method with RANSAC and showed that the proposed method runs 3~10 times faster than RANSAC.

Unsupervised Image Classification using Region-growing Segmentation based on CN-chain

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.3
    • /
    • pp.215-225
    • /
    • 2004
  • A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using the conventional agglomerative approach. Using simulation data, the proposed method was compared with another hierarchical clustering technique based on 'mutual closest neighbor.' The experimental results show that the new approach proposed in this study considerably increases in computational efficiency for larger images with a low number of bands. The technique was then applied to classify the land-cover types using the remotely-sensed data acquired from the Korean peninsula.

Stellar populations of the M87 globular cluster system

  • Ko, Youkyung;Peng, Eric W.;Longobardi, Alessia
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.38.1-38.1
    • /
    • 2019
  • Globular clusters (GCs) are one of the excellent tools to trace the assembly history of their host galaxies. Especially, the ages and abundances of the GCs give important clues about the star formation epochs and merging progenitors. We investigate the stellar population of the GCs in M87 based on a stacking analysis using about 900 MMT/Hectospec spectra of the GCs. We measure the ages, [Z/H], and [a/Fe] from the stacked spectra of the GCs within radial bins based on Lick indices. We find clear radial gradients for [Z/H] and [a/Fe] in the GC system. In addition to the radial trends, we investigate the stellar populations of the GC subgroups divided according to colors, radial velocities, and spatial locations. We discuss the formation history of M87 based on the stellar populations of the GCs.

  • PDF

Region-based Multi-level Thresholding for Color Image Segmentation (영역 기반의 Multi-level Thresholding에 의한 컬러 영상 분할)

  • Oh, Jun-Taek;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.20-27
    • /
    • 2006
  • Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

A Recovery Scheme of Single Node Failure using Version Caching in Database Sharing Systems (데이타베이스 공유 시스템에서 버전 캐싱을 이용한 단일 노드 고장 회복 기법)

  • 조행래;정용석;이상호
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.409-421
    • /
    • 2004
  • A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

Globular clusters with multiple red giant branches as remaining nuclei of primeval dwarf galaxies

  • Lee, Young-Wook;Han, Sang-Il;Joo, Seok-Joo;Lim, Dongwook;Jang, Sohee;Na, Chongsam;Roh, Dong-Goo
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.38 no.2
    • /
    • pp.73.2-73.2
    • /
    • 2013
  • In the current ${\Lambda}CDM$ hierarchical merging paradigm, a galaxy like the Milky Way formed by numerous mergers of ancient subsystems. Most of the relics of these building blocks, however, are yet to be discovered or identified. Recent progress in the Milky Way globular cluster research is throwing new light on this perspective. The discoveries of multiple stellar populations having different heavy element abundances in some massive globular clusters are suggesting that they are most likely the remaining cores or relics of disrupted dwarf galaxies. In this talk, we will report our progress in the (1) narrow-band photometry, (2) low-resolution spectroscopy, and (3) population modeling for this growing group of peculiar globular clusters.

  • PDF

Spatial Analysis Methods for Asbestos Exposure Research (석면노출연구를 위한 공간분석기법)

  • Kim, Ju-Young;Kang, Dong-Mug
    • Journal of Environmental Health Sciences
    • /
    • v.38 no.5
    • /
    • pp.369-379
    • /
    • 2012
  • Objectives: Spatial analysis is useful for understanding complicated causal relationships. This paper focuses trends and appling methods for spatial analysis associated with environmental asbestos exposure. Methods: Literature review and reflection of experience of authors were conducted to know academic background of spatial analysis, appling methods on epidemiology and asbestos exposure. Results: Spatial analysis based on spatial autocorrelation provides a variety of methods through which to conduct mapping, cluster analysis, diffusion, interpolation, and identification. Cause of disease occurrence can be investigated through spatial analysis. Appropriate methods can be applied according to contagiousness and continuity. Spatial analysis for asbestos exposure source is needed to study asbestos related diseases. Although a great amount of research has used spatial analysis to study exposure assessment and distribution of disease occurrence, these studies tend to focus on the construction of a thematic map without different forms of analysis. Recently, spatial analysis has been advanced by merging with web tools, mobile computing, statistical packages, social network analysis, and big data. Conclusions: Because the trend in spatial analysis has evolved from simple marking into a variety of forms of analyses, environmental researchers including asbestos exposure study are required to be aware of recent trends.