• Journal of Information Processing Systems
• /
• 제15권2호
• /
• pp.359-373
• /
• 2019

For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2002년도 춘계학술대회 논문집
• /
• pp.221-228
• /
• 2002

The NAVER is based on a cluster of low-cost personal computers. The goal of NAVER is to provide flexible, extensible, scalable and re-configurable framework for the diverse virtual environments especially for Gamsung research experiments. Personal computers are divided into three servers are according to their specific functions: Render Server, Device Server and Control Server. While Device Server contains external modules requiring event-based communication for the integration, Control Server contains external modules requiring synchronous communication every frame. And, the Render Server consists of 5 managers: Scenario Manager, Event Manger, Command Manager, Interaction Manager and Sync Manager. In this paper, we discuss NAVER as effective distributed system and its application to Gamsung experiment.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (D)
• /
• pp.306-311
• /
• 2007

본 논문에서는 Wireless Sensor Network상에서 전체 노드들의 lifetime을 증대시키기 위하여 "random한" 방식으로 cluster-head를 선출하는 LEACH 알고리즘이 가지고 있는 cluster-head 선출 과정에서 선출되는 수와 선출되는 노드들의 위치가 적절히 분산되지 않는 문제를 해결하기 위해 변형된 Graph Coloring 문제를 기반으로 노드의 위치 정보를 사용하지 않고 cluster-head를 적절히 분산하여 선출함으로써 효율적인 clustering을 하는 중앙처리 방식의 새로운 알고리즘 "GCCA : Graph Coloring based Clustering Algorithm for Wireless Sensor Networks" 을 제안한다. GCCA는 cluster-head가 선출되는 수를 일정하게 유지하고 선출되는 노드의 위치가 전체 network area에 적절히 분산되는 효과를 가져 옴으로 LEACH 알고리즘보다 에너지 효율이 증대됨을 실험을 통하여 보인다.

• Journal of Computing Science and Engineering
• /
• 제10권1호
• /
• pp.1-8
• /
• 2016

The fuzzy c-means (FCM) is a frequently utilized algorithm at present. Yet, the clustering quality and convergence rate of FCM are determined by the initial cluster centers, and so an improved FCM algorithm based on canopy cluster concept to quickly analyze the dataset has been proposed. Taking advantage of the canopy algorithm for its rapid acquisition of cluster centers, this algorithm regards the cluster results of canopy as the input. In this way, the convergence rate of the FCM algorithm is accelerated. Meanwhile, the MapReduce scheme of the proposed FCM algorithm is designed in a cloud environment. Experimental results demonstrate the hybrid canopy-FCM clustering algorithm processed by MapReduce be endowed with better clustering quality and higher operation speed.

• 천문학회보
• /
• 제39권2호
• /
• pp.52-52
• /
• 2014

It is widely accepted that the evolution of galaxies is accelerated in dense environments. According to recent studies, however, the evolution by direct interactions between galaxies is known to be most active in a galaxy group rather than in a galaxy cluster. In particular, the central galaxy in a group is closely related to its satellites in the properties such as morphology, color and star formation rate, because those galaxies evolve together in a small-scale environment. Currently, however, it is not yet studied well whether such conformity between bright galaxies and their faint companions remains after a galaxy group falls into a galaxy cluster. Recently, Lee et al. (2014) have found that the colors of bright galaxies show a measurable correlation with the mean colors of faint companions around them in WHL J085910.0+294957, a galaxy cluster at z = 0.3, which may be the vestige of infallen groups in the cluster. As a follow-up study, we study Abell 2744, an ongoing cluster-cluster merger at z = 0.308, using the HST Frontier Fields Survey data. The cluster members are selected based on the distributions of color, size and concentration along magnitude. The correlation in color between bright galaxies and their companions is not found in the full area of Abell 2744. However, when the area is limited to the southeastern part of the Abell 2744 image, the mean color of faint companions shows marginal dependence (> $2{\sigma}$ to Bootstrap uncertainties) on the color of their adjacent bright galaxy. We discuss the implication of these results, focusing on their dependence on local environments.

• The Journal of Asian Finance, Economics and Business
• /
• 제3권2호
• /
• pp.51-57
• /
• 2016

The aim of this study is to examine of the cluster approach to ensure high rates of innovation, information and communication enterprises of information technology cluster in order to enhance the competitiveness of regions. Keeping with the previous literature, the present research determined that the novelty of the problem, concerning of the creation IT clusters as drivers of new generation, i.e. a kind of platform of "startup accelerators" through the creation of previously not existing in the country high-tech industries and sectors of the economy. The study employs system approach involves to determine prospective directions of the formation of clusters of IT industry, also applies structured approach to shows relationships between elements of cluster systems (participants of cluster), as well as focusing on some aspects of cluster development such as networking. Based on this analysis we have proposed to create clusters in regions, which can play the role of translator's innovations at the periphery of the country. This research shows that formation of IT clusters is one of the most successful tools to avoid of dependence of Kazakhstan from raw materials.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

• Journal of Applied Biological Chemistry
• /
• 제61권4호
• /
• pp.357-365
• /
• 2018

된장의 최적 섭취 기간을 판단하기 위해 원료 대두로부터 3년 동안 발효 숙성 하면서 6개월 단위로 시료를 채취하여 분석하였다. 이화학적 분석, 항산화력과 관능 검사를 주성분분석과 k-평균 군집 분석하여 종합적인 품질 특성을 평가하였다. 된장의 품질 특성은 PCA에 의해 1년 간격으로 큰 변화가 확인되었고, 군집 분석에 의해 숙성 기간에 따라 각각 cluster 1, 2, 3의 군집으로 분류되었다. 건강기능성과 관련된 항산화력으로 총 페놀함량, SOD 유사활성, DPPH 라디칼 소거 능력은 cluster 3에서 높았다. Cluster 3에서는 맛과 관련된 관능 평가 항목과 유리아미노산, 유기산 등도 높게 나타났다. 기호도 평가도 cluster 3에서 높게 나타났고 기호도에 가장 큰 영향을 준 관능 항목 요인은 감칠맛과 갈색이었다. 따라서 된장은 숙성 12개월 이후부터 섭취 가능하지만 된장의 맛과 건강 기능적 측면을 동시에 고려한다면 숙성 30개월 이후가 된장의 최적 섭취 시기라고 할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4228-4247
• /
• 2018

Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.