• Journal of the Korean Data and Information Science Society
• /
• 제16권3호
• /
• pp.557-566
• /
• 2005

Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. In this paper we used k-means clustering of several clustering techniques. The k-means Clustering Is classified as a partitional clustering method. We analyze 2002 Gyeongnam social indicator survey data using k-means clustering techniques for environmental information. We can use these outputs given by k-means clustering for environmental preservation and environmental improvement.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2004년도 추계학술대회
• /
• pp.77-86
• /
• 2004

Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. In this paper we used k-means clustering of several clustering techniques. The k-means Clustering is classified as a partitional clustering method. We analyze 2002 Gyeongnam social indicator survey data using k-means clustering techniques for environmental information. We can use these outputs given by k-means clustering for environmental preservation and environmental improvement.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.434-438
• /
• 2008

Massive data are continuously produced with a data rate of over several terabytes every day. These applications need effective clustering algorithms to achieve an overall high performance computation. In this paper, we propose ancestor as cluster center based approach to clustering, the K-means algorithm using ancestor. We modify the K-means algorithm. We present a clustering architecture and a clustering algorithm that minimize of I/Os and show a performance with excellent. In our experimental performance evaluation, we present that our algorithm can improve the I/O speed and the query processing time.

• 대한수학회지
• /
• 제60권3호
• /
• pp.503-520
• /
• 2023

In this paper, using the theory of majorization, we discuss the Schur m power convexity for L-conjugate means of n variables and the Schur convexity for weighted L-conjugate means of n variables. As applications, we get several inequalities of general mean satisfying Schur convexity, and a few comparative inequalities about n variables Gini mean are established.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제19권4호
• /
• pp.699-713
• /
• 2005

In this paper, we attempted to find out the meaning of several means and inequalities, their relationships and proposed the effective ways to teach them in college mathematics classes. That is, we introduced 8 proofs of arithmetic-geometric mean equality to explain the fact that there exist diverse ways of proof. The students learned the diverseproof-methods and applied them to other theorems and projects. From this, we found out that the attempt to develop the students' logical thinking ability by encouraging them to find out diverse solutions of a problem could be a very effective education method in college mathematics classes.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.1-16
• /
• 1998

The zone clustering problem arising from several area such as deciding the optimal location of ambient measuring stations is to devide the 2-dimensional area into several sub areas in which included individual zone shows simimlar properties. In general, the optimal solution of this problem is very hard to obtain. Therefore, instead of finding an optimal solution, the generation of near optimal solution within the limited time is more meaningful. In this study, the combination of a genetic algorithm and the modified k-means method is used to obtain the near optimal solution. To exploit the genetic algorithm effectively, a representation of chromsomes and appropriate genetic operators are proposed. The k-means method which is originally devised to solve the object clustering problem is modified to improve the solutions obtained from the genetic algorithm. The experiment shows that the proposed method generates the near optimal solution efficiently.

• 한국의류학회지
• /
• 제22권4호
• /
• pp.452-459
• /
• 1998

The purpose of this study was to discover a conceptual framework and evaluation process of apparel quality by means-end chain theory. The theoretical study was conducted to find out a conceptual framework and build a hypothetical evaluation process model of apparel quality. Apparel quality was perceived associative network called a means-end chain and was evaluated in several stages. A conceptual framework of apparel quality evaluation was organized into hierarchical relationships among four different dimensions: physical attribute, physical function, instrumental performance, and expressive performance. The means-end structure linked tangible physical attributes and function to more abstract instrumental and expressive performance. A hypothetical evaluation process model linked dimensions of apparel quality to the selected means-end relationship. Different consumers had different means-end chains for the same apparel. Therefore different subjects are likely to have different evaluation paths. From this study we can suggest an evaluation process model of apparel quality.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 춘계학술대회
• /
• pp.283-293
• /
• 2008

Analysis of Means(ANOM) is a visualization tool for comparing several means to the grand mean like control chart type. This paper reviews five ANOM methods for continuous data such as ANOM, ANOME (ANOM for Treatment Effects), ANCON (Analysis of Contrasts), ANOMV (ANOM for Variance), ANOMC (ANOM for Correaltion). Three ANOM tools for discrete data such as ANOMNP (ANOM for Nonconforming Proportions), ANOMNC (ANOM for Nonconforming Unit), ANOMNPU (ANOM for Nonconfirmities Per Unit) are also developed.

• Kyungpook Mathematical Journal
• /
• 제47권4호
• /
• pp.595-600
• /
• 2007

In this paper we consider weighted arithmetic and geometric means of several positive definite operators proposed by Sagae and Tanabe and we establish a reverse inequality of the arithmetic and geometric means via Specht ratio and the Thompson metric on the convex cone of positive definite operators.

• 한국지능시스템학회논문지
• /
• 제17권2호
• /
• pp.196-201
• /
• 2007

Fuzzy C-Means (FCM) 알고리즘은 probabilitic 멤버쉽을 사용하는 클러스터링 방법으로서 널리 쓰이고 있다. 하지만 이 방법은 노이즈에 대하여 민감한 성질을 가진다는 단점이 있다. 따라서 본 논문에서는 이러한 노이즈에 민감한 성질을 보완하기 위해서 데이터의 밀도추정을 이용하여 새로운 FCM 알고리즘을 제안한다. 본 논문에서 제안된 알고리즘은 FCM과 비슷한 성능의 클러스터링 수행이 가능하며, 노이즈가 포함된 데이터에서는 FCM보다 더 나은 성능을 보여준다.