• Title/Summary/Keyword: C-Means clustering

Search Result 363, Processing Time 0.024 seconds

Improving Data Accuracy Using Proactive Correlated Fuzzy System in Wireless Sensor Networks

  • Barakkath Nisha, U;Uma Maheswari, N;Venkatesh, R;Yasir Abdullah, R
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3515-3538
    • /
    • 2015
  • Data accuracy can be increased by detecting and removing the incorrect data generated in wireless sensor networks. By increasing the data accuracy, network lifetime can be increased parallel. Network lifetime or operational time is the time during which WSN is able to fulfill its tasks by using microcontroller with on-chip memory radio transceivers, albeit distributed sensor nodes send summary of their data to their cluster heads, which reduce energy consumption gradually. In this paper a powerful algorithm using proactive fuzzy system is proposed and it is a mixture of fuzzy logic with comparative correlation techniques that ensure high data accuracy by detecting incorrect data in distributed wireless sensor networks. This proposed system is implemented in two phases there, the first phase creates input space partitioning by using robust fuzzy c means clustering and the second phase detects incorrect data and removes it completely. Experimental result makes transparent of combined correlated fuzzy system (CCFS) which detects faulty readings with greater accuracy (99.21%) than the existing one (98.33%) along with low false alarm rate.

An eigenspace projection clustering method for structural damage detection

  • Zhu, Jun-Hua;Yu, Ling;Yu, Li-Li
    • Structural Engineering and Mechanics
    • /
    • v.44 no.2
    • /
    • pp.179-196
    • /
    • 2012
  • An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

A Study on Labeling of ECG Signal using Fuzzy Clustering (퍼지 클러스터링을 이용한 심전도 신호의 라벨링에 관한 연구)

  • Kong, I.W.;Lee, J.W.;Lee, S.H.;Choi, S.J.;Lee, M.H.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.11
    • /
    • pp.118-121
    • /
    • 1996
  • This paper describes ECG signal labeling based on Fuzzy clustering, which is necessary at automated ECG diagnosis. The NPPA(Non parametric partitioning algorithm) compares the correlations of wave forms, which tends to recognize the same wave forms as different when the wave forms have a little morphological variation. We propose to apply Fuzzy clustering to ECG QRS Complex labeling, which prevents the errors to mistake by using If-then comparision. The process is divided into two parts. The first part is a parameters extraction process from ECG signal, which is composed of filtering, QRS detection by mapping to a phase space by time delay coordinates and generation of characteristic vectors. The second is fuzzy clustering by FCM(Fuzzy c-means), which is composed of a clustering, an assessment of cluster validity and labeling.

  • PDF

Shot Change Detection Using Fuzzy Clustering Method on MPEG Video Frames (퍼지 클러스터링 기법을 이용한 MPEG 비디오의 장면 전환 검출)

  • Lim, Seong-Jae;Kim, Woon;Lee, Bae-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.159-162
    • /
    • 2000
  • In this paper, we propose an efficient method to detect shot changes in compressed MPEG video data by using reference features among video frames. The reference features among video frames imply the similarities among adjacent frames by prediction coded type of each frame. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. And the shot change detection algorithm is improved by using Fuzzy c-means (FCM) clustering algorithm. The FCM clustering algorithm uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.

  • PDF

Clustering of 2D-Gel Images

  • Hur, Won
    • 한국생물공학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.746-749
    • /
    • 2003
  • Alignment of 2D-gel images of biological samples can visualize the difference of expression profiles and also inform us candidates of protein spots to be further analyzed. However, comparison of two proteome images between case and control does not always successfully identify differentially expressed proteins due to sample-to-sample variation. Because of poor reproducibility of 2D-gel electrophoresis, sample-by-sample variations and inconsistent electrophoresis conditions, multiple number of 2D-gel image must be processed to align each other to visualize the difference of expression profiles and to deduce the protein spots differentially expressed with reliability. Alignment of multiple 2D-Gel images and their clustering were carried out by applying various algorithms and statistical methods. In order to align multiple images, multiresolution-multilevel algorithm was found out to be suitable for fast alignment and for distorted images. Clustering of 12 different images implementing a k-means algorithm gives a phylogenetic tree of distance map of the proteomes. Microsoft Visual C++ was used to implement the algorithms in this work.

  • PDF

A clustering method using the Coulomb Energy Network (쿨롱네트워크를 이용한 집락분석)

  • 이석훈;박래현;김응환
    • The Korean Journal of Applied Statistics
    • /
    • v.8 no.1
    • /
    • pp.39-50
    • /
    • 1995
  • This article deals with the problem that all the statistical clustering methods do not supply the clustering rule after the analysis. We modify the Coulomb Energy Network model basically developed in physics and suggest one model appropriate for our purpose and show the implementation using an actual data. Finally the method suggested is compared with one of the well known methods, K-means algorithm using Rand C.

  • PDF

Parallel Structure Modeling of Nonlinear Process Using Clustering Method (클러스터링 기법을 이용한 비선형 공정의 병렬구조 모델링)

  • 박춘성;최재호;오성권;안태천
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.383-386
    • /
    • 1997
  • In this paper, We proposed a parallel structure of the Neural Network model to nonlinear complex system. Neural Network was used as basic model which has learning ability and high tolerence level. This paper, we used Neural Network which has BP(Error Back Propagation Algorithm) model. But it sometimes has difficulty to append characteristic of input data to nonlinear system. So that, I used HCM(hard c-Means) method of clustering technique to append property of input data. Clustering Algorithms are used extensively not only to organized categorize data, but are also useful for data compression and model construction. Gas furance, a sewage treatment process are used to evaluate the performance of the proposed model and then obtained higher accuracy than other previous medels.

  • PDF

Design of Hard Partition-based Non-Fuzzy Neural Networks

  • Park, Keon-Jun;Kwon, Jae-Hyun;Kim, Yong-Kab
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.30-33
    • /
    • 2012
  • This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

Efficient Shot Change Detection Using Clustering Method on MPEG Video Frames (MPEG 비디오 프레임에서 FCM 클러스터링 기법을 이용한 효과적인 장면 전환 검출)

  • Lim, Seong-Jae;Lee, Bae-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10a
    • /
    • pp.751-754
    • /
    • 2000
  • In this paper, we propose an efficient method to detect abrupt shot changes in compressed MPEG video data by using reference ratios among video frames. The reference ratios among video frames imply the degree of similarities among adjacent frames by prediction coded type of each frames. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. This paper proposes an efficient shot change detection algorithm by using Fuzzy c-means(FCM) clustering algorithm. The FCM clustering uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.

  • PDF

Cluster Analysis Algorithms Based on the Gradient Descent Procedure of a Fuzzy Objective Function

  • Rhee, Hyun-Sook;Oh, Kyung-Whan
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.191-196
    • /
    • 1997
  • Fuzzy clustering has been playing an important role in solving many problems. Fuzzy c-Means(FCM) algorithm is most frequently used for fuzzy clustering. But some fixed point of FCM algorithm, know as Tucker's counter example, is not a reasonable solution. Moreover, FCM algorithm is impossible to perform the on-line learning since it is basically a batch learning scheme. This paper presents unsupervised learning networks as an attempt to improve shortcomings of the conventional clustering algorithm. This model integrates optimization function of FCM algorithm into unsupervised learning networks. The learning rule of the proposed scheme is a result of formal derivation based on the gradient descent procedure of a fuzzy objective function. Using the result of formal derivation, two algorithms of fuzzy cluster analysis, the batch learning version and on-line learning version, are devised. They are tested on several data sets and compared with FCM. The experimental results show that the proposed algorithms find out the reasonable solution on Tucker's counter example.

  • PDF