• Journal of the Korean Data and Information Science Society
• /
• v.21 no.1
• /
• pp.121-128
• /
• 2010

K-means clustering is an iterative algorithm in which items are moved among sets of clusters until the desired set is reached. K-means clustering has been widely used in many applications, such as market research, pattern analysis or recognition, image processing, etc. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using a center of gravity for grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.3
• /
• pp.485-492
• /
• 2014

In baseball, the traditional measure of pitchers are wins and ERA. But these statistics are influenced by luck or team power. So sabermetrician proposes a number of indicators that predict future performance. We determine a new measure, which we call pitching grade index (PGI) that efficiently summarizes a pitcher's performance on a numerical scale using principal components analysis. The PGI statistic can often be useful to assessing a pitcher's individual contribution. Also K-means clustering algorithm are used for segmentation of players into groups.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.2
• /
• pp.349-356
• /
• 2014

In baseball, sabermetric batting statistics are used to compare an offensive performance of players. There exist dozens of sabermetric statistics, but baseball fans don't like the complexity of an abundance of measures. This paper provides a batting grade index (BGI) using principal component based on eight batting statistics. These are OPS, ISO, SECA, TA, RC, RC/27, wOBA and XR. We show that how standardized batting statistics are aggregated and weighted to arrive at a single composite measure of BGI. Also our result allows for segmentation of players into groups using the K-means clustering algorithm.