• Title/Summary/Keyword: Pre-Clustering

Search Result 124, Processing Time 0.021 seconds

IDs Assignment of Hybrid Method for Efficient and Secure USN (Ubiquitous Sensor Networks) (효율적인 안전한 유비쿼터스 센서 네트워크를 위한 하이브리드 방식의 아이디 할당)

  • Sung, Soon-Hwa
    • Journal of Internet Computing and Services
    • /
    • v.9 no.6
    • /
    • pp.15-25
    • /
    • 2008
  • Due to the differences between a mobile ad-hoc network and a sensor network, the pre-existing autoconfiguration for a mobile ad-hoc network cannot be simply applied to a sensor network. But. a mechanism is still necessary to assign locally unique addresses to sensor nodes efficiently. This paper proposes a hybrid IDs assignment scheme of local area sensor networks. The IDs assignment scheme of hybrid method combines a proactive IDs assignment with a reactive IDs assignment scheme. The proposed scheme considers efficient communication using reactive IDs assignment, and security for potential attacks using zone-based self-organized clustering with Byzantine Agreement in sensor networks. Thus, this paper has solved the shortage of security due to minimizing network traffic and the problem of repairing the network from the effects of an aberrant node in sensor networks.

  • PDF

Efficient Processing of Multidimensional Vessel USN Stream Data using Clustering Hash Table (클러스터링 해쉬 테이블을 이용한 다차원 선박 USN 스트림 데이터의 효율적인 처리)

  • Song, Byoung-Ho;Oh, Il-Whan;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.137-145
    • /
    • 2010
  • Digital vessel have to accurate and efficient mange the digital data from various sensors in the digital vessel. But, In sensor network, it is difficult to transmit and analyze the entire stream data depending on limited networks, power and processor. Therefore it is suitable to use alternative stream data processing after classifying the continuous stream data. In this paper, We propose efficient processing method that arrange some sensors (temperature, humidity, lighting, voice) and process query based on sliding window for efficient input stream and pre-clustering using multiple Support Vector Machine(SVM) algorithm and manage hash table to summarized information. Processing performance improve as store and search and memory using hash table and usage reduced so maintain hash table in memory. We obtained to efficient result that accuracy rate and processing performance of proposal method using 35,912 data sets.

A Secure Energy-Efficient Routing Scheme Using Distributed Clustering in Wireless Sensor Networks (무선 센서 네트워크에서 분산 클러스터링을 이용한 안전한 에너지 효율적인 라우팅 기술)

  • Cheon, EunHong;Lee, YonSik
    • Convergence Security Journal
    • /
    • v.16 no.5
    • /
    • pp.3-9
    • /
    • 2016
  • The wireless sensor networks have become an economically viable monitoring solution for a wide variety of civilian and military applications. The main challenge in wireless sensor networks is the secure transmission of information through the network, which ensures that the network is secure, energy-efficient and able to identify and prevent intrusions in a hostile or unattended environment. In that correspondence, this paper proposes a distributed clustering process that integrates the necessary measures for secure wireless sensors to ensure integrity, authenticity and confidentiality of the aggregated data. We use the notion of pre-distribution of symmetric and asymmetric keys for a secured key management scheme, and then describe the detailed scheme which each sensor node within its cluster makes use of the pre-distribution of cryptographic parameters before deployment. Finally, we present simulation results for the proposed scheme in wireless sensor network.

Regime-dependent Characteristics of KOSPI Return

  • Kim, Woohwan;Bang, Seungbeom
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.6
    • /
    • pp.501-512
    • /
    • 2014
  • Stylized facts on asset return are fat-tail, asymmetry, volatility clustering and structure changes. This paper simultaneously captures these characteristics by introducing a multi-regime models: Finite mixture distribution and regime switching GARCH model. Analyzing the daily KOSPI return from $4^{th}$ January 2000 to $30^{th}$ June 2014, we find that a two-component mixture of t distribution is a good candidate to describe the shape of the KOSPI return from unconditional and conditional perspectives. Empirical results suggest that the equality assumption on the shape parameter of t distribution yields better discrimination of heterogeneity component in return data. We report the strong regime-dependent characteristics in volatility dynamics with high persistence and asymmetry by employing a regime switching GJR-GARCH model with t innovation model. Compared to two sub-samples, Pre-Crisis (January 2003 ~ December 2007) and Post-Crisis (January 2010 ~ June 2014), we find that the degree of persistence in the Pre-Crisis is higher than in the Post-Crisis along with a strong asymmetry in the low-volatility (high-volatility) regime during the Pre-Crisis (Post-Crisis).

XML Document Clustering Based on Sequential Pattern (순차패턴에 기반한 XML 문서 클러스터링)

  • Hwang, Jeong-Hee;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1093-1102
    • /
    • 2003
  • As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.

Design of Meteorological Radar Pattern Classifier Using Clustering-based RBFNNs : Comparative Studies and Analysis (클러스터링 기반 RBFNNs를 이용한 기상레이더 패턴분류기 설계 : 비교 연구 및 해석)

  • Choi, Woo-Yong;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.5
    • /
    • pp.536-541
    • /
    • 2014
  • Data through meteorological radar includes ground echo, sea-clutter echo, anomalous propagation echo, clear echo and so on. Each echo is a kind of non-precipitation echoes and the characteristic of individual echoes is analyzed in order to identify with non-precipitation. Meteorological radar data is analyzed through pre-processing procedure because the data is given as big data. In this study, echo pattern classifier is designed to distinguish non-precipitation echoes from precipitation echo in meteorological radar data using RBFNNs and echo judgement module. Output performance is compared and analyzed by using both HCM clustering-based RBFNNs and FCM clustering-based RBFNNs.

An Unsupervised Clustering Technique of XML Documents based on Function Transform and FFT (함수 변환과 FFT에 기반한 조정자가 없는 XML 문서 클러스터링 기법)

  • Lee, Ho-Suk
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.169-180
    • /
    • 2007
  • This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

Development of Portable Electronic Tongue using Fuzzy clustering algorithm (Fuzzy Clustering 알고리즘을 이용한 휴대용 전자 혀 개발)

  • Kim, Joeng-Do;Ham, Yu-Kyung;Jung, Woo-Suk;Jung, Young-Chang
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.602-604
    • /
    • 2004
  • A portable electronic tongue(E-Tongue) system using an array of ion-selective electrode(ISE) and personal digital assistants(PDA) for recognizing and analyzing food and drink have been designed. By the employment of PDA, the complex algorithm such as fuzzy c-means algorithm(FCMA) could be used in E-Tongue, FCMA could iteratively solve the cluster centers of pre-determined standard patterns. And the membership between the standard patterns and unknown pattern could be analyzed easily by the present E-Tongue combined with PDA.

  • PDF

Selection of Optimal Sensor Locations for Thermal Error Model of Machine tools (공작기계 열오차 모델의 최적 센서위치 선정)

  • 안중용
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.345-350
    • /
    • 1999
  • The effectiveness of software error compensation for thermally induced machine tool errors relies on the prediction accuracy of the pre-established thermal error models. The selection of optimal sensor locations is the most important in establishing these empirical models. In this paper, a methodology for the selection of optimal sensor locations is proposed to establish a robust linear model which is not subjected to collinearity. Correlation coefficient and time delay are used as thermal parameters for optimal sensor location. Firstly, thermal deformation and temperatures are measured with machine tools being excited by sinusoidal heat input. And then, after correlation coefficient and time delays are calculated from the measured data, the optimal sensor location is selected through hard c-means clustering and sequential selection method. The validity of the proposed methodology is verified through the estimation of thermal expansion along Z-axis by spindle rotation.

  • PDF

Unsupervised Speaker Adaptation Based on Sufficient HMM Statistics (SUFFICIENT HMM 통계치에 기반한 UNSUPERVISED 화자 적응)

  • Ko Bong-Ok;Kim Chong-Kyo
    • Proceedings of the KSPS conference
    • /
    • 2003.05a
    • /
    • pp.127-130
    • /
    • 2003
  • This paper describes an efficient method for unsupervised speaker adaptation. This method is based on selecting a subset of speakers who are acoustically close to a test speaker, and calculating adapted model parameters according to the previously stored sufficient HMM statistics of the selected speakers' data. In this method, only a few unsupervised test speaker's data are required for the adaptation. Also, by using the sufficient HMM statistics of the selected speakers' data, a quick adaptation can be done. Compared with a pre-clustering method, the proposed method can obtain a more optimal speaker cluster because the clustering result is determined according to test speaker's data on-line. Experiment results show that the proposed method attains better improvement than MLLR from the speaker independent model. Moreover the proposed method utilizes only one unsupervised sentence utterance, while MLLR usually utilizes more than ten supervised sentence utterances.

  • PDF