• Title/Summary/Keyword: Re-clustering

Search Result 101, Processing Time 0.026 seconds

Multihop Routing based on the Topology Matrix in Cluster Sensor Networks (클라스터 센서 네트워크에서 토폴로지 행렬 기반 멀티홉 라우팅)

  • Wu, Mary;Park, Ho-Hwan;Kim, Chong-Gun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.1
    • /
    • pp.45-50
    • /
    • 2013
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

lustering of Categorical Data using Rough Entropy (러프 엔트로피를 이용한 범주형 데이터의 클러스터링)

  • Park, Inkyoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.183-188
    • /
    • 2013
  • A variety of cluster analysis techniques prerequisite to cluster objects having similar characteristics in data mining. But the clustering of those algorithms have lots of difficulties in dealing with categorical data within the databases. The imprecise handling of uncertainty within categorical data in the clustering process stems from the only algebraic logic of rough set, resulting in the degradation of stability and effectiveness. This paper proposes a information-theoretic rough entropy(RE) by taking into account the dependency of attributes and proposes a technique called min-mean-mean roughness(MMMR) for selecting clustering attribute. We analyze and compare the performance of the proposed technique with K-means, fuzzy techniques and other standard deviation roughness methods based on ZOO dataset. The results verify the better performance of the proposed approach.

Power Re-Allocation for Low-Performance User in Cell-free MIMO Network (셀프리 다중안테나 네트워크에서 하위 성능 사용자를 위한 전력 재할당 기법)

  • Ryu, Jong Yeol;Ban, Tae-Won;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1367-1373
    • /
    • 2022
  • In this paper, we consider a power re-allocation technique in order to enhance the frequency efficiency of the low performance user in a cell-free multiple input multiple output (MIMO) network. The AP first allocates transmit power to the user to be proportional to the large-scale fading coefficients of the connected users. Then, the AP reduces the power of the users who were allocated power greater than the threshold ratio of total allocated power to be equal to the threshold ratio of the allocated power. Finally, the AP re-allocates the reduced power from the strong channel user to the user who has the worst channel condition, and thus, the frequency efficiency of the low performance user can be enhanced. In the simulation results, we verify the performance of the power re-allocation technique in terms of the spectral efficiency of the low performance user.

A Grading Method for Student′s Achievements Based on the Clustering Technique (클러스터링에 기반한 학업성적의 등급화 방법)

  • Park, Eun-Jin;Chung, Hong;Jang, Duk-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.2
    • /
    • pp.151-156
    • /
    • 2002
  • There are two methods in evaluation student s achievement. The two evaluation methods are absolute evaluation and relative evaluation. They have much advantages respectively, but also have some limitations such as being too stereotyped or causing overcompetition among learners. This paper suggests a new evaluation method which evaluates student s achievements by considering the score distribution and the frequency The proposed method classifies the scores into several clusters considering the goodness. This approach calculates the goodness by applying the RE(relaxation error), and grades the achievement scores based on the goodness. The suggested method can avoid the problem of grading caused by the narrow gap of scores because it sets a standard for grading by the calculated goodness considering the score distribution and frequency of occurrence. The method can differentiate achievements of a school from those of others, and that it is useful for selecting advanced students and dull ones, and for evaluation of classes based on student s achievement.

Exploratory Study on the Activity about Utilization and Contribution to the Union Catalog (대학도서관의 종합목록 기여 활동 및 이용 정도에 대한 탐사적 연구)

  • Cho, Jane
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.26 no.1
    • /
    • pp.35-50
    • /
    • 2015
  • In order to re-activation of shared cataloging, spirit of community and cooperation are most needed. But proper compensation about contribution would motivate. Through representing basic data for making compensation policy about university library's share cataloging system, this study analyzes activities about contribution and utilization of participated libraries. To put it concretely, this study considers overall status of contribution and utilization through descriptive statistics and analyzes relationship between both sides. Furthermore through clustering participating library, this study brightened the libraries that ought to be compensated and who would be need to be specially rewarded. And draw the libraries that need to be paid and need to be led for active participation of shared cataloging.

Neuro-fuzzy based approach for estimation of concrete compressive strength

  • Xue, Xinhua;Zhou, Hongwei
    • Computers and Concrete
    • /
    • v.21 no.6
    • /
    • pp.697-703
    • /
    • 2018
  • Compressive strength is one of the most important engineering properties of concrete, and testing of the compressive strength of concrete specimens is often costly and time consuming. In order to provide the time for concrete form removal, re-shoring to slab, project scheduling and quality control, it is necessary to predict the concrete strength based upon the early strength data. However, concrete compressive strength is affected by many factors, such as quality of raw materials, water cement ratio, ratio of fine aggregate to coarse aggregate, age of concrete, compaction of concrete, temperature, relative humidity and curing of concrete. The concrete compressive strength is a quite nonlinear function that changes depend on the materials used in the concrete and the time. This paper presents an adaptive neuro-fuzzy inference system (ANFIS) for the prediction of concrete compressive strength. The training of fuzzy system was performed by a hybrid method of gradient descent method and least squares algorithm, and the subtractive clustering algorithm (SCA) was utilized for optimizing the number of fuzzy rules. Experimental data on concrete compressive strength in the literature were used to validate and evaluate the performance of the proposed ANFIS model. Further, predictions from three models (the back propagation neural network model, the statistics model, and the ANFIS model) were compared with the experimental data. The results show that the proposed ANFIS model is a feasible, efficient, and accurate tool for predicting the concrete compressive strength.

Classification of Weather Patterns in the East Asia Region using the K-means Clustering Analysis (K-평균 군집분석을 이용한 동아시아 지역 날씨유형 분류)

  • Cho, Young-Jun;Lee, Hyeon-Cheol;Lim, Byunghwan;Kim, Seung-Bum
    • Atmosphere
    • /
    • v.29 no.4
    • /
    • pp.451-461
    • /
    • 2019
  • Medium-range forecast is highly dependent on ensemble forecast data. However, operational weather forecasters have not enough time to digest all of detailed features revealed in ensemble forecast data. To utilize the ensemble data effectively in medium-range forecasting, representative weather patterns in East Asia in this study are defined. The k-means clustering analysis is applied for the objectivity of weather patterns. Input data used daily Mean Sea Level Pressure (MSLP) anomaly of the ECMWF ReAnalysis-Interim (ERA-Interim) during 1981~2010 (30 years) provided by the European Centre for Medium-Range Weather Forecasts (ECMWF). Using the Explained Variance (EV), the optimal study area is defined by 20~60°N, 100~150°E. The number of clusters defined by Explained Cluster Variance (ECV) is thirty (k = 30). 30 representative weather patterns with their frequencies are summarized. Weather pattern #1 occurred all seasons, but it was about 56% in summer (June~September). The relatively rare occurrence of weather pattern (#30) occurred mainly in winter. Additionally, we investigate the relationship between weather patterns and extreme weather events such as heat wave, cold wave, and heavy rainfall as well as snowfall. The weather patterns associated with heavy rainfall exceeding 110 mm day-1 were #1, #4, and #9 with days (%) of more than 10%. Heavy snowfall events exceeding 24 cm day-1 mainly occurred in weather pattern #28 (4%) and #29 (6%). High and low temperature events (> 34℃ and < -14℃) were associated with weather pattern #1~4 (14~18%) and #28~29 (27~29%), respectively. These results suggest that the classification of various weather patterns will be used as a reference for grouping all ensemble forecast data, which will be useful for the scenario-based medium-range ensemble forecast in the future.

Integrating Ant Colony Clustering Method to a Multi-Robot System Using Mobile Agents

  • Kambayashi, Yasushi;Ugajin, Masataka;Sato, Osamu;Tsujimura, Yasuhiro;Yamachi, Hidemi;Takimoto, Munehiro;Yamamoto, Hisashi
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.3
    • /
    • pp.181-193
    • /
    • 2009
  • This paper presents a framework for controlling mobile multiple robots connected by communication networks. This framework provides novel methods to control coordinated systems using mobile agents. The combination of the mobile agent and mobile multiple robots opens a new horizon of efficient use of mobile robot resources. Instead of physical movement of multiple robots, mobile software agents can migrate from one robot to another so that they can minimize energy consumption in aggregation. The imaginary application is making "carts," such as found in large airports, intelligent. Travelers pick up carts at designated points but leave them arbitrary places. It is a considerable task to re-collect them. It is, therefore, desirable that intelligent carts (intelligent robots) draw themselves together automatically. Simple implementation may be making each cart has a designated assembly point, and when they are free, automatically return to those points. It is easy to implement, but some carts have to travel very long way back to their own assembly point, even though it is located close to some other assembly points. It consumes too much unnecessary energy so that the carts have to have expensive batteries. In order to ameliorate the situation, we employ mobile software agents to locate robots scattered in a field, e.g. an airport, and make them autonomously determine their moving behaviors by using a clustering algorithm based on the Ant Colony Optimization (ACO). ACO is the swarm intelligence-based methods, and a multi-agent system that exploit artificial stigmergy for the solution of combinatorial optimization problems. Preliminary experiments have provided a favorable result. In this paper, we focus on the implementation of the controlling mechanism of the multi-robots using the mobile agents.

Determination of Optimal Cluster Size Using Bootstrap and Genetic Algorithm (붓스트랩 기법과 유전자 알고리즘을 이용한 최적 군집 수 결정)

  • Park, Min-Jae;Jun, Sung-Hae;Oh, Kyung-Whan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.12-17
    • /
    • 2003
  • Optimal determination of cluster size has an effect on the result of clustering. In K-means algorithm, the difference of clustering performance is large by initial K. But the initial cluster size is determined by prior knowledge or subjectivity in most clustering process. This subjective determination may not be optimal. In this Paper, the genetic algorithm based optimal determination approach of cluster size is proposed for automatic determination of cluster size and performance upgrading of its result. The initial population based on attribution is generated for searching optimal cluster size. The fitness value is defined the inverse of dissimilarity summation. So this is converged to upgraded total performance. The mutation operation is used for local minima problem. Finally, the re-sampling of bootstrapping is used for computational time cost.

A Study on the Analysis of Spatial Characteristics with Respect to Regional Mobility Using Clustering Technique Based on Origin-Destination Mobility Data (기종점 모빌리티 데이터 기반 클러스터링 기법을 활용한 지역 모빌리티의 공간적 특성 분석 연구)

  • Donghoun Lee;Yongjun Ahn
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.1
    • /
    • pp.219-232
    • /
    • 2023
  • Mobility services need to change according to the regional characteristics of the target service area. Accordingly, analysis of mobility patterns and characteristics based on Origin-Destination (OD) data that reflect travel behaviors in the target service area is required. However, since conventional methods construct the OD data obtained from the administrative district-based zone system, it is hard to ensure spatial homogeneity. Hence, there are limitations in analyzing the inherent travel patterns of each mobility service, particularly for new mobility service like Demand Responsive Transit (DRT). Unlike the conventional approach, this study applies a data-driven clustering technique to conduct spatial analyses on OD travel patterns of regional mobility services based on reconstructed OD data derived from re-aggregation for original OD distributions. Based on the reconstructed OD data that contains information on the inherent feature vectors of the original OD data, the proposed method enables analysis of the spatial characteristics of regional mobility services, including public transit bus, taxi and DRT.