• Title/Summary/Keyword: Cluster Validate

Search Result 58, Processing Time 0.022 seconds

Incremental EM algorithm with multiresolution kd-trees and cluster validation and its application to image segmentation (다중해상도 kd-트리와 클러스터 유효성을 이용한 점증적 EM 알고리즘과 이의 영상 분할에의 적용)

  • Lee, Kyoung-Mi
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.6
    • /
    • pp.523-528
    • /
    • 2015
  • In this paper, we propose a new multiresolutional and dynamic approach of the EM algorithm. EM is a very popular and powerful clustering algorithm. EM, however, has problems that indexes multiresolution data and requires a priori information on a proper number of clusters in many applications, To solve such problems, the proposed EM algorithm can impose a multiresolution kd-tree structure in the E-step and allocates a cluster based on sequential data. To validate clusters, we use a merge criteria for cluster merging. We demonstrate the proposed EM algorithm outperforms for texture image segmentation.

Improved Classification Algorithm using Extended Fuzzy Clustering and Maximum Likelihood Method

  • Jeon Young-Joon;Kim Jin-Il
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.447-450
    • /
    • 2004
  • This paper proposes remotely sensed image classification method by fuzzy c-means clustering algorithm using average intra-cluster distance. The average intra-cluster distance acquires an average of the vector set belong to each cluster and proportionates to its size and density. We perform classification according to pixel's membership grade by cluster center of fuzzy c-means clustering using the mean-values of training data about each class. Fuzzy c-means algorithm considered membership degree for inter-cluster of each class. And then, we validate degree of overlap between clusters. A pixel which has a high degree of overlap applies to the maximum likelihood classification method. Finally, we decide category by comparing with fuzzy membership degree and likelihood rate. The proposed method is applied to IKONOS remote sensing satellite image for the verifying test.

  • PDF

Identification and Validation of Symptom Clusters in Patients with Hepatocellular Carcinoma (간세포암 환자의 증상군 분류와 타당도 검증)

  • Cho, Myung-Sook;Kwon, In-Gak;Kim, Hee-Sun;Kim, Kyung-Hee;Ryu, Eun-Jung
    • Journal of Korean Academy of Nursing
    • /
    • v.39 no.5
    • /
    • pp.683-692
    • /
    • 2009
  • Purpose: The purpose of this study was to identify cancer-related symptom clusters and to validate the conceptual meanings of the revealed symptom clusters in patients with hepatocellular carcinoma. Methods: This study was a cross-sectional survey and methodological study. Patients with hepatocellular carcinoma (N=194) were recruited from a medical center in Seoul. The 20-item Symptom Checklist was used to assess patients' symptom severity. Selected symptoms were factored using principal-axis factoring with varimax rotation. To validate the revealed symptom clusters, the statistical differences were analyzed by status of patients' performance status, Child-Pugh classification, and mood state among symptom clusters. Results: Fatigue was the most prevalent symptom (97.4%), followed by lack of energy and stomach discomfort. Patients' symptom severity ratings fit a four-factor solution that explained 61.04% of the variance. These four factors were named pain-appetite cluster, fatigue cluster, itching-constipation cluster, and gastrointestinal cluster. The revealed symptom clusters were significantly different for patient performance status (ECOG-PSR), Child-Pugh class, anxiety, and depression. Conclusion: Knowing these symptom clusters may help nurses to understand reasonable mechanisms for the aggregation of symptoms. Efficient symptom management of disease-related and treatment-related symptoms is critical in promoting physical and emotional status in patients with hepatocellular carcinoma.

Regional Extension of the Neural Network Model for Storm Surge Prediction Using Cluster Analysis (군집분석을 이용한 국지해일모델 지역확장)

  • Lee, Da-Un;Seo, Jang-Won;Youn, Yong-Hoon
    • Atmosphere
    • /
    • v.16 no.4
    • /
    • pp.259-267
    • /
    • 2006
  • In the present study, the neural network (NN) model with cluster analysis method was developed to predict storm surge in the whole Korean coastal regions with special focuses on the regional extension. The model used in this study is NN model for each cluster (CL-NN) with the cluster analysis. In order to find the optimal clustering of the stations, agglomerative method among hierarchical clustering methods was used. Various stations were clustered each other according to the centroid-linkage criterion and the cluster analysis should stop when the distances between merged groups exceed any criterion. Finally the CL-NN can be constructed for predicting storm surge in the cluster regions. To validate model results, predicted sea level value from CL-NN model was compared with that of conventional harmonic analysis (HA) and of the NN model in each region. The forecast values from NN and CL-NN models show more accuracy with observed data than that of HA. Especially the statistics analysis such as RMSE and correlation coefficient shows little differences between CL-NN and NN model results. These results show that cluster analysis and CL-NN model can be applied in the regional storm surge prediction and developed forecast system.

Cluster Analysis of Daily Electricity Demand with t-SNE

  • Min, Yunhong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.5
    • /
    • pp.9-14
    • /
    • 2018
  • For an efficient management of electricity market and power systems, accurate forecasts for electricity demand are essential. Since there are many factors, either known or unknown, determining the realized loads, it is difficult to forecast the demands with the past time series only. In this paper we perform a cluster analysis on electricity demand data collected from Jan. 2000 to Dec. 2017. Our purpose of clustering on electricity demand data is that each cluster is expected to consist of data whose latent variables are same or similar values. Then, if properly clustered, it is possible to develop an accurate forecasting model for each cluster separately. To validate the feasibility of this approach for building better forecasting models, we clustered data with t-SNE. To apply t-SNE to time series data effectively, we adopt the dynamic time warping as a similarity measure. From the result of experiments, we found that several clusters are well observed and each cluster can be interpreted as a mix of well-known factors such as trends, seasonality and holiday effects and other unknown factors. These findings can motivate the approaches which build forecasting models with respect to each cluster independently.

An Efficient and Stable Congestion Control Scheme with Neighbor Feedback for Cluster Wireless Sensor Networks

  • Hu, Xi;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4342-4366
    • /
    • 2016
  • Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

A Dynamic Clustering Mechanism Considering Energy Efficiency in the Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율성을 고려한 동적 클러스터링 기법)

  • Kim, Hwan;Ahn, Sanghyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.5
    • /
    • pp.199-202
    • /
    • 2013
  • In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.

A Statistical Detection Method to Detect Abnormal Cluster Head Election Attacks in Clustered Wireless Sensor Networks (클러스터 기반 WSN에서 비정상적인 클러스터 헤드 선출 공격에 대한 통계적 탐지 기법)

  • Kim, Sumin;Cho, Youngho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.6
    • /
    • pp.1165-1170
    • /
    • 2022
  • In WSNs, a clustering algorithm groups sensor nodes on a unit called cluster and periodically selects a cluster head (CH) that acts as a communication relay on behalf of nodes in each cluster for the purpose of energy conservation and relay efficiency. Meanwhile, attack techniques also have emerged to intervene in the CH election process through compromised nodes (inside attackers) and have a fatal impact on network operation. However, existing countermeasures such as encryption key-based methods against outside attackers have a limitation to defend against such inside attackers. Therefore, we propose a statistical detection method that detects abnormal CH election behaviors occurs in a WSN cluster. We design two attack methods (Selfish and Greedy attacks) and our proposed defense method in WSNs with two clustering algorithms and conduct experiments to validate our proposed defense method works well against those attacks.

Value Structure Model of the Success Factor of ITO Transition (ITO 이행단계 성공요인에 대한 가치체계모형 연구)

  • Cha, Hwan-Ju;Kim, Ja-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.1
    • /
    • pp.21-39
    • /
    • 2016
  • Although the demand for IT outsourcing (ITO) has increased recently because of the recent recession, concerns about business discontinuity in the transition phase cause companies to hesitate to adopt ITO. Therefore, a guideline to improve the prospects is needed. However, studies on the success factors of the transition phase in ITO are lacking. In this study, we develop an expert hierarchical value map (HVM) of the success of the transition phase in ITO by using cognition scientific methodologies. We empirically verify how success factors affect the success of the transition phase. Specifically, we derive an HVM of main stakeholders by using in-depth interviews and approaches, such as repertory grid technique (RGT) and laddering, based on means-end chain theory. We validate the success factors empirically through a bipolar analysis of RGT. Finally, we determine the most important cluster of success factors through cluster analysis.

Validation Measures of Bicluster Solutions

  • Lee, Young-Rok;Lee, Jeong-Hwa;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.2
    • /
    • pp.101-108
    • /
    • 2009
  • Biclustering is a method to extract subsets of objects and features from a dataset which are characterized in some way. In contrast to traditional clustering algorithms which group objects similar in a whole feature set, biclustering methods find groups of objects which have similar values or patterns in some features. Both in clustering and biclustering, validating how much the result is informative or reliable is a very important task. Whereas validation methods of cluster solutions have been studied actively, there are only few measures to validate bicluster solutions. Furthermore, the existing validation methods of bicluster solutions have some critical problems to be used in general cases. In this paper, we review several well-known validation measures for cluster and bicluster solutions and discuss their limitations. Then, we propose several improved validation indices as modified versions of existing ones.