• Title/Summary/Keyword: network clustering algorithm

Search Result 536, Processing Time 0.026 seconds

Communication coverage-aware cluster head election algorithm for Hierarchical Wireless Sensor Networks (계층형 무선센서 네트워크에서 통신영역을 고려한 클러스터 헤드 선출 알고리즘)

  • Lee, Doo-Wan;Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.527-530
    • /
    • 2010
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

  • PDF

Design & Implementation of Pedestrian Detection System Using HOG-PCA Based pRBFNNs Pattern Classifier (HOG-PCA기반 pRBFNNs 패턴분류기를 이용한 보행자 검출 시스템의 설계 및 구현)

  • Kim, Jin-Yul;Park, Chan-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.7
    • /
    • pp.1064-1073
    • /
    • 2015
  • In this study, we introduce the pedestrian detection system by using the feature of HOG-PCA and RBFNNs pattern classifier. HOG(Histogram of Oriented Gradient) feature is extracted from input image to identify and recognize a object. And a dimension is reduced for improving performance as well as processing speed by using PCA which is a typical dimensional reduction algorithm. So, the feature of HOG-PCA through the dimensional reduction by using PCA leads to the improvement of the detection rate. FCM clustering algorithm is used instead of gaussian function to apply the characteristic of input data as well and connection weight is used by polynomial expression such as constant, linear, quadratic and modified quadratic. Finally, INRIA person database known as one of the benchmark dataset used for pedestrian detection is applied for the performance evaluation of the proposed classifier. The experimental result of the proposed classifier are compared with those studied by Dalal.

Delay-Constrained Energy-Efficient Cluster-based Multi-Hop Routing in Wireless Sensor Networks

  • Huynh, Trong-Thua;Dinh-Duc, Anh-Vu;Tran, Cong-Hung
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.580-588
    • /
    • 2016
  • Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.

Efficient Incremental Learning using the Preordered Training Data (미리 순서가 매겨진 학습 데이타를 이용한 효과적인 증가학습)

  • Lee, Sun-Young;Bang, Sung-Yang
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.2
    • /
    • pp.97-107
    • /
    • 2000
  • Incremental learning generally reduces training time and increases the generalization of a neural network by selecting training data incrementally during the training. However, the existing methods of incremental learning repeatedly evaluate the importance of training data every time they select additional data. In this paper, an incremental learning algorithm is proposed for pattern classification problems. It evaluates the importance of each piece of data only once before starting the training. The importance of the data depends on how close they are to the decision boundary. The current paper presents an algorithm which orders the data according to their distance to the decision boundary by using clustering. Experimental results of two artificial and real world classification problems show that this proposed incremental learning method significantly reduces the size of the training set without decreasing generalization performance.

  • PDF

Development of Medical Cost Prediction Model Based on the Machine Learning Algorithm (머신러닝 알고리즘 기반의 의료비 예측 모델 개발)

  • Han Bi KIM;Dong Hoon HAN
    • Journal of Korea Artificial Intelligence Association
    • /
    • v.1 no.1
    • /
    • pp.11-16
    • /
    • 2023
  • Accurate hospital case modeling and prediction are crucial for efficient healthcare. In this study, we demonstrate the implementation of regression analysis methods in machine learning systems utilizing mathematical statics and machine learning techniques. The developed machine learning model includes Bayesian linear, artificial neural network, decision tree, decision forest, and linear regression analysis models. Through the application of these algorithms, corresponding regression models were constructed and analyzed. The results suggest the potential of leveraging machine learning systems for medical research. The experiment aimed to create an Azure Machine Learning Studio tool for the speedy evaluation of multiple regression models. The tool faciliates the comparision of 5 types of regression models in a unified experiment and presents assessment results with performance metrics. Evaluation of regression machine learning models highlighted the advantages of boosted decision tree regression, and decision forest regression in hospital case prediction. These findings could lay the groundwork for the deliberate development of new directions in medical data processing and decision making. Furthermore, potential avenues for future research may include exploring methods such as clustering, classification, and anomaly detection in healthcare systems.

A Study on Speech Recognition Using the HM-Net Topology Design Algorithm Based on Decision Tree State-clustering (결정트리 상태 클러스터링에 의한 HM-Net 구조결정 알고리즘을 이용한 음성인식에 관한 연구)

  • 정현열;정호열;오세진;황철준;김범국
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.2
    • /
    • pp.199-210
    • /
    • 2002
  • In this paper, we carried out the study on speech recognition using the KM-Net topology design algorithm based on decision tree state-clustering to improve the performance of acoustic models in speech recognition. The Korean has many allophonic and grammatical rules compared to other languages, so we investigate the allophonic variations, which defined the Korean phonetics, and construct the phoneme question set for phonetic decision tree. The basic idea of the HM-Net topology design algorithm is that it has the basic structure of SSS (Successive State Splitting) algorithm and split again the states of the context-dependent acoustic models pre-constructed. That is, it have generated. the phonetic decision tree using the phoneme question sets each the state of models, and have iteratively trained the state sequence of the context-dependent acoustic models using the PDT-SSS (Phonetic Decision Tree-based SSS) algorithm. To verify the effectiveness of the above algorithm we carried out the speech recognition experiments for 452 words of center for Korean language Engineering (KLE452) and 200 sentences of air flight reservation task (YNU200). Experimental results show that the recognition accuracy has progressively improved according to the number of states variations after perform the splitting of states in the phoneme, word and continuous speech recognition experiments respectively. Through the experiments, we have got the average 71.5%, 99.2% of the phoneme, word recognition accuracy when the state number is 2,000, respectively and the average 91.6% of the continuous speech recognition accuracy when the state number is 800. Also we haute carried out the word recognition experiments using the HTK (HMM Too1kit) which is performed the state tying, compared to share the parameters of the HM-Net topology design algorithm. In word recognition experiments, the HM-Net topology design algorithm has an average of 4.0% higher recognition accuracy than the context-dependent acoustic models generated by the HTK implying the effectiveness of it.

Making a Science Map of Korea (국내 광역 과학 지도 생성 연구)

  • Lee, Jae-Yun
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.3
    • /
    • pp.363-383
    • /
    • 2007
  • Global map of science, which is visualizing large scientific domains, can be used to visually analyze the structural relationships between major areas of science. This paper reviewed previous efforts on global science map, and then tried to making a science map of Korea with some new methods. There are several research groups on making global map of science including Dr. Small and Dr. Garfield of ISI (now Thompson Scientific), SCImago research group at the University of Granada, and Dr. Borner's InfoVis Lab at the Indiana University. They called their maps as science map or scientogram and called the activity of mapping science as scientography. Most of the previous works are based on citations between scientific articles. However citation database for Korean journal articles is still under construction. This research tried to make a Korean science map with the text in the proposals suggested for funding from Korean Research Foundation. Two kinds of method for generating networks of scientific fields are used. One is Pathfinder network (PFNet) alogorithm which has been used in several published bibliometric studies. The other is clustering-based network (CBnet) algorithm which was proposed recently as an alternative to PFNet. In order to take into account both views of the two algorithms, the resulting maps are combined to a final science map of Korea.

Self-Diagnosing Disease Classification System for Oriental Medical Science with Refined Fuzzy ART Algorithm (Refined Fuzzy ART 알고리즘을 이용한 한방 자가 질병 분류 시스템)

  • Kim, Kwang-Baek
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.7
    • /
    • pp.1-8
    • /
    • 2009
  • In this paper, we propose a home medical system that integrates a self-diagnosing disease classification system and a tele-consulting system by communication technology. The proposed disease classification system supports to self-diagnose the health condition based on oriental medical science using fuzzy neural network algorithm. The prepared database includes 72 different diseases and their associated symptoms based on a famous medical science book "Dong-eui-bo-gam". The proposed system extracts three most prospective diseases from user's symptoms by analyzing disease database with fuzzy neural network technology. Technically, user's symptoms are used as an input vector and the clustering algorithm based upon a fuzzy neural network is performed. The degree of fuzzy membership is computed for each probable cluster and the system infers the three most prospective diseases with their degree of membership. Such information should be sent to medical doctors via our tele-consulting system module. Finally a user can take an appropriate consultation via video images by a medical doctor. Oriental medical doctors verified the accuracy of disease diagnosing ability and the efficacy of overall system's plausibility in the real world.

Feature Extraction based FE-SONN for Signature Verification (서명 검증을 위한 특정 기반의 FE-SONN)

  • Koo Gun-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.93-102
    • /
    • 2005
  • This paper proposes an approach to verify signature using autonomous self-organized Neural Network Model , fused with fuzzy membership equation of fuzzy c-means algorithm, based on the features of the signature. To overcome limitations of the functional approach and Parametric approach among the conventional on-line signature recognition approaches, this Paper presents novel autonomous signature classification approach based on clustering features. Thirty-six globa1 features and twelve local features were defined, so that a signature verifying system with FE-SONN that learns them was implemented. It was experimented for total 713 signatures that are composed of 155 original signatures and 180 forged signatures yet 378 original signatures written by oneself. The success rate of this test is more than 97.67$\%$ But, a few forged signatures that could not be detected by human eyes could not be done by the system either.

  • PDF

Innovation of technology and social changes - quantitative analysis based on patent big data (기술의 진보와 혁신, 그리고 사회변화: 특허빅데이터를 이용한 정량적 분석)

  • Kim, Yongdai;Jong, Sang Jo;Jang, Woncheol;Lee, Jongsu
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.6
    • /
    • pp.1025-1039
    • /
    • 2016
  • We introduce various methods to investigate the relations between innovation of technology and social changes by analyzing more than 4 millions of patents registered at United States Patent and Trademark Office(USPTO) from year 1985 to 2015. First, we review the history of patent law and its relation with the quantitative changes of registered patents. Second, we investigate the differences of technical innovations of several countries by use of cluster analysis based on the numbers of registered patents at several technical sectors. Third, we introduce the PageRank algorithm to define important nodes in network type data and apply the PageRank algorithm to find important technical sectors based on citation information between registered patents. Finally, we explain how to use the canonical correlation analysis to study relationship between technical innovation and social changes.