• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.229-238
• /
• 2003

K-means clustering has been widely used in many applications, such that pattern analysis, data analysis, market research and so on. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters, because it is more primitive and explorative. In this paper we propose a new method of k-means clustering using the grid-based representative value(arithmetic and trimmed mean) for sample. It is more fast than any traditional clustering method and maintains its accuracy.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.134-138
• /
• 1998

Unification of Kohone SOM(Self-Organizing Maps) neural network with the branch-and-bound algorithm is presented for clustering large set of patterns. The branch-and-bound search technique is employed for designing coarse neural network learning paradaim. Those unification can be use for clustering or calssfication of large patterns. For classfication purposes further usefulness is possible, since only two clusters exists in the SOM neural network of each nodes. The result of experiments show the fast learning time, the fast recognition time and the compactness of clustering.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.535-543
• /
• 2003

Cluster analysis has been widely used in many applications, such as pattern analysis or recognition, data analysis, image processing, market research on on-line or off-line and so on. Clustering can identify dense and sparse regions among data attributes or object attributes. But it requires many hours to get clusters that we want, because clustering is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new method of clustering using sample based on grid. It is more fast than any traditional clustering method and maintains its accuracy.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.05a
• /
• pp.77-88
• /
• 2003

Cluster analysis has been widely used in many applications, such that data analysis, pattern recognition, image processing, etc. But clustering requires many hours to get clusters that we want, because it is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new clustering method, 'Clustering algorithm using a center of gravity for grid-based sample'. It is more fast than any traditional clustering method and maintains accuracy. It reduces running time by using grid-based sample and keeps accuracy by using representative point, a center of gravity.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2375-2382
• /
• 2011

The user clustering for web navigation pattern discovery is very useful to get preference and behavior pattern of users for web pages. In addition, the information by the user clustering is very essential for web personalization or customer grouping. In this paper, an algorithm for clustering the web navigation path of users is proposed and then some special navigation patterns can be recognized by the algorithm. The proposed algorithm has two clustering phases. In the first phase, all paths are classified into k-groups on the bases of the their similarities. The initial solution obtained in the first phase is not global optimum but it gives a good and feasible initial solution for the second phase. In the second phase, the first phase solution is improved by revising the k-means algorithm. In the revised K-means algorithm, grouping the paths is performed by the hyperplane instead of the distance between a path and a group center. Experimental results show that the proposed method is more efficient.

• Journal of the Korean Society for information Management
• /
• v.19 no.3
• /
• pp.5-30
• /
• 2002

In this paper, classification feature is selected with focus of musical content, note sequences pattern, and measures similarity between note sequences followed by constructing clusters by similar note sequences, which is easier for users to search by showing the similar note sequences with the search result in the CBMR system. Experimental document was $\ulcorner$A Dictionary of Musical Themes$\lrcorner$, the index of theme bar focused on classical music and obtained kern-type file. Humdrum Toolkit version 1.0 was used as note sequences treat tool. The hierarchical clustering method is by stages focused on four-type similarity matrices by whether the note sequences segmentation or not and where the starting point is. For the measurement of the result, WACS standard is used in the case of being manual classification and in the case of the note sequences starling from any point in the note sequences, there is used common feature pattern distribution in the cluster obtained from the clustering result. According to the result, clustering with segmented feature unconnected with the starting point Is higher with distinct difference compared with clustering with non-segmented feature.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.56-63
• /
• 2015

Several fields of science have demanded large-scale workflow support, which requires thousands of CPU cores or more. In order to support such large-scale scientific workflows, high capacity parallel systems such as supercomputers are widely used. In order to increase the utilization of these systems, most schedulers use backfilling policy: Small jobs are moved ahead to fill in holes in the schedule when large jobs do not delay. Since an estimate of the runtime is necessary for backfilling, most parallel systems use user's estimated runtime. However, it is found to be extremely inaccurate because users overestimate their jobs. Therefore, in this paper, we propose a novel system for the runtime prediction based on workload-aware clustering with the goal of improving prediction performance. The proposed method for runtime prediction of parallel applications consists of three main phases. First, a feature selection based on factor analysis is performed to identify important input features. Then, it performs a clustering analysis of history data based on self-organizing map which is followed by hierarchical clustering for finding the clustering boundaries from the weight vectors. Finally, prediction models are constructed using support vector regression with the clustered workload data. Multiple prediction models for each clustered data pattern can reduce the error rate compared with a single model for the whole data pattern. In the experiments, we use workload logs on parallel systems (i.e., iPSC, LANL-CM5, SDSC-Par95, SDSC-Par96, and CTC-SP2) to evaluate the effectiveness of our approach. Comparing with other techniques, experimental results show that the proposed method improves the accuracy up to 69.08%.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.330-336
• /
• 2009

This paper proposes an on-line voltage management and control solution for a distribution system which can improve the efficiency and accuracy of existing off-line work by collecting customer voltage on-line as well as the voltage compensation capability of the existing ULTC (Under Load Tap Changer) operation and control strategy by controlling the ULTC tap based on pattern clustering and recognition. The proposed solution consists of an ADVMD (Advanced Digital Voltage Management Device), a VMS (Voltage Management Solution) and an OLDUC (On-Line Digital ULTC Controller). An on-line voltage management emulator based on multi-thread programming and the shared memory method is developed to emulate on-line voltage management and digital ULTC control methodology based on the on-line collection of the customer's voltage. In addition, using this emulator, the effectiveness of the proposed pattern clustering and recognition based ULTC control strategy is proven for the worst voltage environments for three days.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.58-64
• /
• 2007

In pattern recognition field, there are many optimization problems having exponential search spaces. To solve of sequential search algorithms seeking sub-optimal solutions have been used. The algorithms have limitations of stopping at local optimums. Recently lots of researches attempt to solve the problems using genetic algorithms. This paper explains the huge search spaces of typical problems such as feature selection, classifier ensemble selection, neural network pruning, and clustering, and it reviews the genetic algorithms for solving them. Additionally we present several subjects worthy of noting as future researches.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.04a
• /
• pp.185-196
• /
• 2008

The objective of this study is to evaluate the mechanical behaviors and structural integrity of the weldment of high strength steel by using an acoustic emission (AE) techniques. Simple tension and AE tests were conducted against the 3 kind of welding test specimens. In order to analysis the effectiveness of weldability, joinability and structural integrity, we used K-means clustering method as a unsupervised learning pattern recognition algorithm for obtained multivariate AE main data sets, such as AE counts, energy, amplitude, hits, risetime, duration, counts to peak and rms signals. Through the experimental results, the effectiveness of the proposed method is discussed.