• Title/Summary/Keyword: and clustering

Search Result 5,621, Processing Time 0.03 seconds

Emergent damage pattern recognition using immune network theory

  • Chen, Bo;Zang, Chuanzhi
    • Smart Structures and Systems
    • /
    • v.8 no.1
    • /
    • pp.69-92
    • /
    • 2011
  • This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

Topical Clustering Techniques of Twitter Documents Using Korean Wikipedia (한글 위키피디아를 이용한 트위터 문서의 주제별 클러스터링 기법)

  • Chang, Jae-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.189-196
    • /
    • 2014
  • Recently, the need for retrieving documents is growing in SNS environment such as twitter. For supporting the twitter search, a clustering technique classifying the massively retrieved documents in terms of topics is required. However, due to the nature of twitter, there is a limit in applying previous simple techniques to clustering the twitter documents. To overcome such problem, we propose in this paper a new clustering technique suitable to twitter environment. In proposed method, we augment new terms to feature vectors representing the twitter documents, and recalculate the weights of features using Korean Wikipedia. In addition, we performed the experiments with Korean twitter documents, and proved the usability of proposed method through performance comparison with the previous techniques.

Evaluating the Performance of Four Selections in Genetic Algorithms-Based Multispectral Pixel Clustering

  • Kutubi, Abdullah Al Rahat;Hong, Min-Gee;Kim, Choen
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.1
    • /
    • pp.151-166
    • /
    • 2018
  • This paper compares the four selections of performance used in the application of genetic algorithms (GAs) to automatically optimize multispectral pixel cluster for unsupervised classification from KOMPSAT-3 data, since the selection among three main types of operators including crossover and mutation is the driving force to determine the overall operations in the clustering GAs. Experimental results demonstrate that the tournament selection obtains a better performance than the other selections, especially for both the number of generation and the convergence rate. However, it is computationally more expensive than the elitism selection with the slowest convergence rate in the comparison, which has less probability of getting optimum cluster centers than the other selections. Both the ranked-based selection and the proportional roulette wheel selection show similar performance in the average Euclidean distance using the pixel clustering, even the ranked-based is computationally much more expensive than the proportional roulette. With respect to finding global optimum, the tournament selection has higher potential to reach the global optimum prior to the ranked-based selection which spends a lot of computational time in fitness smoothing. The tournament selection-based clustering GA is used to successfully classify the KOMPSAT-3 multispectral data achieving the sufficient the matic accuracy assessment (namely, the achieved Kappa coefficient value of 0.923).

A Neuro-Fuzzy Modeling using the Hierarchical Clustering and Gaussian Mixture Model (계층적 클러스터링과 Gaussian Mixture Model을 이용한 뉴로-퍼지 모델링)

  • Kim, Sung-Suk;Kwak, Keun-Chang;Ryu, Jeong-Woong;Chun, Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.5
    • /
    • pp.512-519
    • /
    • 2003
  • In this paper, we propose a neuro-fuzzy modeling to improve the performance using the hierarchical clustering and Gaussian Mixture Model(GMM). The hierarchical clustering algorithm has a property of producing unique parameters for the given data because it does not use the object function to perform the clustering. After optimizing the obtained parameters using the GMM, we apply them as initial parameters for Adaptive Network-based Fuzzy Inference System. Here, the number of fuzzy rules becomes to the cluster numbers. From this, we can improve the performance index and reduce the number of rules simultaneously. The proposed method is verified by applying to a neuro-fuzzy modeling for Box-Jenkins s gas furnace data and Sugeno's nonlinear system, which yields better results than previous oiles.

A Binary Prediction Method for Outlier Detection using One-class SVM and Spectral Clustering in High Dimensional Data (고차원 데이터에서 One-class SVM과 Spectral Clustering을 이용한 이진 예측 이상치 탐지 방법)

  • Park, Cheong Hee
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.6
    • /
    • pp.886-893
    • /
    • 2022
  • Outlier detection refers to the task of detecting data that deviate significantly from the normal data distribution. Most outlier detection methods compute an outlier score which indicates the degree to which a data sample deviates from normal. However, setting a threshold for an outlier score to determine if a data sample is outlier or normal is not trivial. In this paper, we propose a binary prediction method for outlier detection based on spectral clustering and one-class SVM ensemble. Given training data consisting of normal data samples, a clustering method is performed to find clusters in the training data, and the ensemble of one-class SVM models trained on each cluster finds the boundaries of the normal data. We show how to obtain a threshold for transforming outlier scores computed from the ensemble of one-class SVM models into binary predictive values. Experimental results with high dimensional text data show that the proposed method can be effectively applied to high dimensional data, especially when the normal training data consists of different shapes and densities of clusters.

ANGULAR CLUSTERING OF FIR-SELECTED GALAXIES IN THE AKARI ALL-SKY SURVEY

  • Pollo, A.;Takeuchi, T.T.;Suzuki, T.L.;Oyabu, S.
    • Publications of The Korean Astronomical Society
    • /
    • v.27 no.4
    • /
    • pp.343-344
    • /
    • 2012
  • We present the first measurement of the angular two-point correlation function for AKARI $90{\mu}m$ point sources, detected outside of the Milky Way plane and selected as candidates for extragalactic sources. This is the first measurement of the large-scale angular clustering of galaxies selected in the far-infrared after IRAS. We find a positive clustering signal in both hemispheres extending up to ~ 40 degrees, without any significant fluctuations at larger scales. The observed correlation function is well fitted by a power law function. However, southern galaxies seem to be more strongly clustered than northern ones and the difference is statistically significant. The reason for this difference - technical or physical - is still to be found.

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

  • Kong, In-Wook;Kweon, Hyuk-Je;Lee, Jeong-Whan;Lee, Myoung-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.4
    • /
    • pp.427-436
    • /
    • 1999
  • This paper describes an ECG signal labeling algorithm based on fuzzy clustering, which is very useful to the automated ECG diagnosis. The existing labeling methods compares the crosscorrelations of each wave form using IF-THEN binary logic, which tends to recognize the same wave forms such as different things when the wave forms have a little morphological variation. To prevent this error, we have proposed as ECG signal labeling algorithm using fuzzy clustering. The center and the membership function of a cluster is calculated by a cluster validity function. The dominant cluster type is determined by RR interval, and the representative beat of each cluster is determined by MF (Membership Function). The problem of IF-THEN binary logic is solved by FCM (Fuzzy C-Means). The MF and the result of FCM can be effectively used in the automated fuzzy inference -ECG diagnosis.

  • PDF

Application of k-means Clustering for Association Rule Using Measure of Association

  • Lee, Keun-Woo;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.3
    • /
    • pp.925-936
    • /
    • 2008
  • An association rule mining finds the relation among each items in massive volume database. In generating association rules, the researcher specifies the measurements randomly such as support, confidence and lift, and produces the rules. The rule is not produced if it is not suitable to the one any condition which is given value. For example, in case of a little small one than the value which a confidence value is specified but a support and lift's value is very high, this rule is meaningful rule. But association rule mining can not produce the meaningful rules in this case because it is not suitable to a given condition. Consequently, we creat insignificant error which is not selected to the meaningful rules. In this paper, we suggest clustering technique to association rule measures for finding effective association rules using measure of association.

  • PDF

Dynamic Clustering Based on Location in Wireless Sensor Networks with Skew Distribution

  • Kim, Kyung-Jun;Kim, Jung-Gyu
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.27-30
    • /
    • 2005
  • Because of unreplenishable power resources, reducing node energy consumption to extend network lifetime is an important requirement in wireless sensor networks. In addition both path length and path cost are important metrics affecting sensor lifetime. We propose a dynamic clustering scheme based on location in wireless sensor networks. Our scheme can localize the effects of route failures, reduce control traffic overhead, and thus enhance the reachability to the destination. We have evaluated the performance of our clustering scheme through a simulation and analysis. We provide simulation results showing a good performance in terms of approximation ratios.

  • PDF

Polynomial Fuzzy Radial Basis Function Neural Network Classifiers Realized with the Aid of Boundary Area Decision

  • Roh, Seok-Beom;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.2098-2106
    • /
    • 2014
  • In the area of clustering, there are numerous approaches to construct clusters in the input space. For regression problem, when forming clusters being a part of the overall model, the relationships between the input space and the output space are essential and have to be taken into consideration. Conditional Fuzzy C-Means (c-FCM) clustering offers an opportunity to analyze the structure in the input space with the mechanism of supervision implied by the distribution of data present in the output space. However, like other clustering methods, c-FCM focuses on the distribution of the data. In this paper, we introduce a new method, which by making use of the ambiguity index focuses on the boundaries of the clusters whose determination is essential to the quality of the ensuing classification procedures. The introduced design is illustrated with the aid of numeric examples that provide a detailed insight into the performance of the fuzzy classifiers and quantify several essentials design aspects.