• 제목/요약/키워드: Clustering Design

검색결과 604건 처리시간 0.024초

Research on Low-energy Adaptive Clustering Hierarchy Protocol based on Multi-objective Coupling Algorithm

  • Li, Wuzhao;Wang, Yechuang;Sun, Youqiang;Mao, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1437-1459
    • /
    • 2020
  • Wireless Sensor Networks (WSN) is a distributed Sensor network whose terminals are sensors that can sense and check the environment. Sensors are typically battery-powered and deployed in where the batteries are difficult to replace. Therefore, maximize the consumption of node energy and extend the network's life cycle are the problems that must to face. Low-energy adaptive clustering hierarchy (LEACH) protocol is an adaptive clustering topology algorithm, which can make the nodes in the network consume energy in a relatively balanced way and prolong the network lifetime. In this paper, the novel multi-objective LEACH protocol is proposed, in order to solve the proposed protocol, we design a multi-objective coupling algorithm based on bat algorithm (BA), glowworm swarm optimization algorithm (GSO) and bacterial foraging optimization algorithm (BFO). The advantages of BA, GSO and BFO are inherited in the multi-objective coupling algorithm (MBGF), which is tested on ZDT and SCH benchmarks, the results are shown the MBGF is superior. Then the multi-objective coupling algorithm is applied in the multi-objective LEACH protocol, experimental results show that the multi-objective LEACH protocol can greatly reduce the energy consumption of the node and prolong the network life cycle.

Multi-Radial Basis Function SVM Classifier: Design and Analysis

  • Wang, Zheng;Yang, Cheng;Oh, Sung-Kwun;Fu, Zunwei
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권6호
    • /
    • pp.2511-2520
    • /
    • 2018
  • In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

클러스터링을 이용한 시소러스 브라우저의 설계에 대한 이론적 연구 (A Theoretical Study of Designing Thesaurus Browser by Clustering Algorithm)

  • Seo, Hwi
    • 한국도서관정보학회지
    • /
    • 제30권3호
    • /
    • pp.427-456
    • /
    • 1999
  • This paper deals with the problems of information retrieval through full-test database which arise from both the deficiency of searching strategies or methods by information searcher and the difficulties of query representation, generation, extension, etc. In oder to solve these problems, we should use automatic retrieval instead of manual retrieval in the past. One of the ways to make the gap narrow between the terms by the writers and query by the searchers is that the query should be searched with the terms which the writers use. Thus, the preconditions which should be taken one accorded way to solve the problems are that all areas of information retrieval such as should taken one accorded way to solve the problems are that all areas of information retrieval such as contents analysis, information structure, query formation, query evaluation, etc. should be solved as a coherence way. We need to deal all the ares of automatic information retrieval for the efficiency of retrieval thought this paper is trying to solve the design of thesaurus browser. Thus, this paper shows the theoretical analyses about the form of information retrieval, automatic indexing, clustering technique, establishing and expressing thesaurus, and information retrieval technique. As the result of analyzing them, this paper shows us theoretical model, that is to say, the thesaurus browser by clustering algorithm. The result in the paper will be a theoretical basis on new retrieval algorithm.

  • PDF

Energy Efficient Cooperative LEACH Protocol for Wireless Sensor Networks

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • 제12권4호
    • /
    • pp.358-365
    • /
    • 2010
  • We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

새로운 게이트 어레이 배치 알고리듬 (A New Placement Algorithm for Gate Array)

  • 강병익;정정화
    • 대한전자공학회논문지
    • /
    • 제26권5호
    • /
    • pp.117-126
    • /
    • 1989
  • 본 논문에서는 게이트 어레이 방식의 레이아웃 설계를 위한 새로운 배치 알고리듬을 제안한다. 제안된 배치 알고리듬은 서로 크기가 다른 마크로셀을 처리할 수 있으며, I/Q pad의 위치를 고려함으로써 칩의 내부 영역과 I/Q pad간의 배선을 효율적으로 자동화한다. 알고리듬은 초기 분할, 초기 배치 개선의 3단계로 구성된다. 초기 분할 단계에서는 각 I/Q pad의 위치를 고려하여 clustering에 의해 전체 회로를 5그룹으로 분할한다. 초기 배치 단계에서는 각 I/Q pad 및 주변 그룹과의 연결도를 고려한 clustering/min-cut 분할에 의해 각 셀의 위치를 할당한다. 또한, 배치 개선에서는 확률적 배선 밀도 함수를 도입하여 칩내의 배선 밀도를 균일화하기 위한 셀 이동 알고리듬을 제안한다.

  • PDF

연속 동조 방법을 이용한 퍼지 집합 퍼지 모델의 유전자적 최적화 (Genetic Optimization of Fyzzy Set-Fuzzy Model Using Successive Tuning Method)

  • 박건준;오성권;김현기
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.207-209
    • /
    • 2007
  • In this paper, we introduce a genetic optimization of fuzzy set-fuzzy model using successive tuning method to carry out the model identification of complex and nonlinear systems. To identity we use genetic alrogithrt1 (GA) sand C-Means clustering. GA is used for determination the number of input, the seleced input variables, the number of membership function, and the conclusion inference type. Information Granules (IG) with the aid of C-Means clustering algorithm help determine the initial paramters of fuzzy model such as the initial apexes of the, membership functions in the premise part and the initial values of polyminial functions in the consequence part of the fuzzy rules. The overall design arises as a hybrid structural and parametric optimization. Genetic algorithms and C-Means clustering are used to generate the structurally as well as parametrically optimized fuzzy model. To identify the structure and estimate parameters of the fuzzy model we introduce the successive tuning method with variant generation-based evolution by means of GA. Numerical example is included to evaluate the performance of the proposed model.

  • PDF

Web2.0 환경에서의 효율적인 이미지 검색을 위한 태그 클러스터링 시스템의 설계 및 구현 (Design and Implementation of Tag Clustering System for Efficient Image Retrieval in Web2.0 Environment)

  • 이시화;이만형;황대훈
    • 한국멀티미디어학회논문지
    • /
    • 제11권8호
    • /
    • pp.1169-1178
    • /
    • 2008
  • 웹 2.0에서 대부분의 정보는 사용자에 의해 생산되고, 사용자가 붙인 태그에 의해 분류되어진다. 현재 태그와 연관된 서비스 및 연구들은 자동 태깅 기법이나 태그 클라우드 구성 기술에 초점이 맞춰 진행되어짐에 따라, 태그에 의해 분류되어진 정보 및 리소스들을 효율적으로 분류하여 사용자에게 제공하는 연구는 미흡한 실정이다. 이에 본 논문에서는 웹상에 산재되어있는 리소스 및 그에 따른 태그 정보들을 수집하여 태그들 간의 연관성에 따라 맵핑하고, 이를 클러스터링하여 검색에 적용하기 위한 시스템을 설계 및 구현하였다. 또한 제안 시스템의 성능평가를 위해 태그 기반 대표사이트인 플리커 사이트의 이미지 검색 결과와의 정확성과 재현율을 비교 평가함으로서 향상된 검색결과를 제시하였다.

  • PDF

HCM 클러스터링 기반 FNN 구조 설계 (Design of FNN architecture based on HCM Clustering Method)

  • 박호성;오성권
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 하계학술대회 논문집 D
    • /
    • pp.2821-2823
    • /
    • 2002
  • In this paper we propose the Multi-FNN (Fuzzy-Neural Networks) for optimal identification modeling of complex system. The proposed Multi-FNNs is based on a concept of FNNs and exploit linear inference being treated as generic inference mechanisms. In the networks learning, backpropagation(BP) algorithm of neural networks is used to updata the parameters of the network in order to control of nonlinear process with complexity and uncertainty of data, proposed model use a HCM(Hard C-Means)clustering algorithm which carry out the input-output dat a preprocessing function and Genetic Algorithm which carry out optimization of model The HCM clustering method is utilized to determine the structure of Multi-FNNs. The parameters of Multi-FNN model such as apexes of membership function, learning rates, and momentum coefficients are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization abilities of the model. NOx emission process data of gas turbine power plant is simulated in order to confirm the efficiency and feasibility of the proposed approach in this paper.

  • PDF

HCM 클러스터링과 유전자 알고리즘을 이용한 다중 FNN 모델 설계와 비선형 공정으로의 응용 (The Design of Multi-FNN Model Using HCM Clustering and Genetic Algorithms and Its Applications to Nonlinear Process)

  • 박호성;오성권;김현기
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
    • /
    • pp.47-50
    • /
    • 2000
  • In this paper, an optimal identification method using Multi-FNN(Fuzzy-Neural Network) is proposed for model ins of nonlinear complex system. In order to control of nonlinear process with complexity and uncertainty of data, proposed model use a HCM clustering algorithm which carry out the input-output data preprocessing function and Genetic Algorithm which carry out optimization of model. The proposed Multi-FNN is based on Yamakawa's FNN and it uses simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rules. HCM clustering method which carry out the data preprocessing function for system modeling, is utilized to determine the structure of Multi-FNN by means of the divisions of input-output space. Also, the parameters of Multi-FNN model such as apexes of membership function, learning rates and momentum coefficients are adjusted using genetic algorithms. Also, a performance index with a weighting factor is presented to achieve a sound balance between approximation and generalization abilities of the model, To evaluate the performance of the proposed model, we use the time series data for gas furnace and the numerical data of nonlinear function.

  • PDF

GA 기반 TSK 퍼지 분류기의 설계와 응용 (A Design of GA-based TSK Fuzzy Classifier and Its Application)

  • 곽근창;김승석;유정웅;김승석
    • 한국지능시스템학회논문지
    • /
    • 제11권8호
    • /
    • pp.754-759
    • /
    • 2001
  • 본 논문은 주성분분석기법, 퍼지 클러스터링, ANFIS(Adaptive Neuro-Fuzzy Inference System)와 하이브리드 GA(Hybrid Genetic Algorithm)를 이용하여 GA 기반 TSK(Takagi-Sugeno-Kang) 퍼지 분류기를 제안한다. 먼저 구조동정은 주성분분석기법을 이용하여 데이터 성분간의 상관관계가 제거하도록 입력데이터를 변환하고, FCM(Fuzzy c-means) 클러스터링과 ANFIS의 융합을 통해 초기 TSK 퍼지 분류기를 구축한다. 구축된 초기 분류기의 파라미터를 초기집단으로 발생시켜 AGA(Adaptive GA)와 RLSE(Recursive Least Square Estimate)에 의해 파라미터 동정을 수행한다. 이렇게 함으로서 퍼지 클러스터링의 효율적인 입력공간분할로 ANFIS의 문제점을 해결할 수 있고, AGA에 의해 집단의 다양성 유지와 전역적인 최적해의 수렴을 가속화할 수 있다. 마지막으로, 제안된 방법은 Iris 데이터 분류문제에 적용하여 이전의 다른 논문에 비해 좋은 성능을 보임을 알 수 있었다.

  • PDF