• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.8-19
• /
• 2004

In this paper, we propose an efficient method for locating destination address block on both of machine-Printed and handwritten Korean mail piece images. The proposed method extracts connected components from the binary mail piece image, generates text lines by merging them, and then groups the text fines into nine clusters. The destination address block is determined by selecting some clusters. Considering the geometric characteristics of address information on Korean mail piece, we split a mail piece image into nine areas with an equal size. The nine clusters are initialized with the center coordinate of each area. A modified Manhattan distance function is used to compute the distance between text lines and clusters. We modified the distance function on which the aspect ratio of mail piece could be reflected. The experiment done with live Korean mail piece images has demonstrated the superiority of the Proposed method. The success rate for 1, 988 testing images was about 93.56%.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.74-84
• /
• 2009

GIS based new postal marketing method is presented in this paper with spatiotemporal mining to cope with domestic mail volume decline and to strengthening competitiveness of postal business. Market segmentation technique for socialogy of population and spatiotemporal prediction of consumer propensity to purchase through spatiotemporal multi-dimensional analysis are suggested to provide meaningful and accurate marketing information with customers. Internal postal acceptance & external statistical data of local districts in the Seoul Metropolis are used for the evaluation of geo-lifestyle clustering and spatiotemporal cube mining. Successfully optimal 14 maketing clusters and spatiotemporal patterns are extracted for the prediction of consumer propensity to purchase.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.5
• /
• pp.89-98
• /
• 2014

This paper suggests heuristic algorithm for single-model simple assembly line balancing problem that is a kind of NP-hard problem. This problem primarily can be solved metaheuristic method. This heuristic algorithm set the main-path that has a most number of operations from start to end-product. Then the clustering algorithm can be assigns operations to each workstation within cycle time follow main-path. This algorithm decides minimum number of workstations and can be reduces the cycle time. This algorithm can be better performance then metaheuristic methods.

• The Korean Journal of Applied Statistics
• /
• v.33 no.5
• /
• pp.591-601
• /
• 2020

The self-organizing map (SOM) is a unsupervised learning method projecting high-dimensional data into low-dimensional nodes. It can visualize data in 2 or 3 dimensional space using the nodes and it is available to explore characteristics of data through the nodes. To understand the structure of data, cluster analysis is often used for nodes obtained from SOM. In cluster analysis, the optimal number of clusters is one of important issues. To help to determine it, various cluster validity indexes have been developed and they can be applied to clustering outcomes for nodes from SOM. However, while SOM has an advantage in that it reflects the topological properties of original data in the low-dimensional space, these indexes do not consider it. Thus, we propose a new cluster validity index for SOM based on connectivity between nodes which considers topological properties of data. The performance of the proposed index is evaluated through simulations and it is compared with various existing cluster validity indexes.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.29 no.3
• /
• pp.41-63
• /
• 2018

This study aimed at analyzing journals and index terms, authors of the reformed theology and evangelicalism, neutral theological position by using bibliometrical analyzing methods. The analyzing methods are average linkage and neighbor centralities, profile cosine similarities. Especially, when analyzing the relationship between authors, we interpreted the research topic by finding the key shared index terms between the authors. In the journal analysis results, 9 journals were largely clustered together in the two clusters of the reformed theology and evangelicalism, but Presbyterian Theological Quarterly that is thought to be a reformed journal was clustered in evangelical cluster. In the index terms analysis results of the clusters, the reformed theology and evangelicalism were key words representing the two clusters. In the authors' analysis results, we had 9 clusters and the Presbyterian theologian studying the reformed theology had the four clusters and the non-Presbyterian theologian had the 5 clusters. Therefore, we consistently had the two clusters of the reformed theology and evangelicalism in all the analysis of the journals and the index terms, the authors.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.661-666
• /
• 2003

In this paper, the conventional k-modes and fuzzy k-modes algorithms for clustering categorical data is extended by representing the clusters of categorical data with fuzzy centroids instead of the hard-type centroids used in the original algorithm. The hard-type centroids of the traditional algorithms had difficulties in dealing with ambiguous boundary data, which might be misclassified and lead to thelocal optima. Use of fuzzy centroids makes it possible to fully exploit the power of fuzzy sets in representing the uncertainty in the classification of categorical data. The distance measure between data and fuzzy centroids is more precise and effective than those of the k-modes and fuzzy k-modes. To test the proposed approach, the proposed algorithm and two conventional algorithms were used to cluster three categorical data sets. The proposed method was found to give markedly better clustering results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.1-5
• /
• 2006

본 논문에서는 유방암의 조기발견에 있어서 중요한 소견중 하나인 군집화된 미세석회질을 유방촬영 영상으로부터 자동으로 분석 및 검출하는 컴퓨터 보조 검출 시스템을 구현하였다. 전처리단계로서 유방영상에 메디안 필터를 사용하여 잡음을 제거하고, 히스토그램과 레이블링 연산을 수행하여 실제 유방영역만을 추출 하는 작업을 구현하였다. 그런 후에 추출된 실제 유방영역에서 LoG (Laplacian of Gaussian)연산을 수행하고 히스토그램을 분석하여 이진화를 수행한후에 후보점을 검출하였다. 마지막으로 이를 이용하여 영역확장 알고리즘을 수행하여 미세석회질의 후보영역을 검출한 후, 미세석회질간의 거리를 분석하여 최종 관심영역을 추출하였다. 데이터베이스는 총 20개의 MIAS Mini Database의 맘모그램 영상을 사용하였으며 실험결과 89%라는 검출 성능을 얻을 수 있었다.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1077-1094
• /
• 2011

We accomplish clustering analyses for yeast cell cycle microarray expression data. To reflect the characteristics of a time-course data, we screen the genes using the test statistics with Fourier coefficients applying a FDR procedure. We compare the results done by model-based clustering, K-means, PAM, SOM, hierarchical Ward method and Fuzzy method with the yeast data. As the validity measure for clustering results, connectivity, Dunn index and silhouette values are computed and compared. A biological interpretation with GO analysis is also included.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2018

As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.