• Title/Summary/Keyword: algorithm classification scheme

검색결과 143건 처리시간 0.031초

Wearable Sensor-Based Biometric Gait Classification Algorithm Using WEKA

  • Youn, Ik-Hyun;Won, Kwanghee;Youn, Jong-Hoon;Scheffler, Jeremy
    • Journal of information and communication convergence engineering
    • /
    • 제14권1호
    • /
    • pp.45-50
    • /
    • 2016
  • Gait-based classification has gained much interest as a possible authentication method because it incorporate an intrinsic personal signature that is difficult to mimic. The study investigates machine learning techniques to mitigate the natural variations in gait among different subjects. We incorporated several machine learning algorithms into this study using the data mining package called Waikato Environment for Knowledge Analysis (WEKA). WEKA's convenient interface enabled us to apply various sets of machine learning algorithms to understand whether each algorithm can capture certain distinctive gait features. First, we defined 24 gait features by analyzing three-axis acceleration data, and then selectively used them for distinguishing subjects 10 years of age or younger from those aged 20 to 40. We also applied a machine learning voting scheme to improve the accuracy of the classification. The classification accuracy of the proposed system was about 81% on average.

2진 패턴분류를 위한 신경망 해밍 MAXNET설계 (Neural Hamming MAXNET Design for Binary Pattern Classification)

  • 김대순;김환용
    • 전자공학회논문지B
    • /
    • 제31B권12호
    • /
    • pp.100-107
    • /
    • 1994
  • This article describes the hardware design scheme of Hamming MAXNET algorithm which is appropriate for binary pattern classification with minimum HD measurement between stimulus vector and storage vector. Circuit integration is profitable to Hamming MAXNET because the structure of hamming network have a few connection nodes over the similar neuro-algorithms. Designed hardware is the two-layered structure composed of hamming network and MAXNET which enable the characteristics of low power consumption and fast operation with biline volgate sensing scheme. Proposed Hamming MAXNET hardware was designed as quantize-level converter for simulation, resulting in the expected binary pattern convergence property.

  • PDF

블라인드 채널에서 수신 신호 분석 기법을 사용한 변조 및 채널 상태 추정 알고리즘 (A Modulation and Channel State Estimation Algorithm Using the Received Signal Analysis in the Blind Channel)

  • 최민환;남해운
    • 한국통신학회논문지
    • /
    • 제41권11호
    • /
    • pp.1406-1409
    • /
    • 2016
  • 본 논문에서는 송수신단 간 변조기법 및 채널 상태 값이 약속되지 않은 완벽한 블라인드 통신 상황에서 송신측의 변조방식을 알아내기 위해 성좌도 회전 및 확률밀도함수(probability density function : pdf)를 이용한 새로운 자율 변조 구분(Automatic modulation classification : AMC)기법과 경험적 신호 그룹화 알고리즘을 통해 채널 상태 값을 추정하는 방법을 제안한다. 평균제곱근 편차(Root mean square error : RMSE) 및 심볼 오류율(Symbol error rate : SER) 등의 모의실험을 통해 제안된 기법과 기존의 다른 기법간의 채널 상태와 변조 추정 능력을 비교 평가한다.

고해상도 SAR 영상 Speckle 제거 및 분류 (Despeckling and Classification of High Resolution SAR Imagery)

  • 이상훈
    • 대한원격탐사학회지
    • /
    • 제25권5호
    • /
    • pp.455-464
    • /
    • 2009
  • Lee(2009)에서 영상 강도를 위해서 lognormal 확률 모형과 영상 texture를 위해서 Markov random field(MRF)에 기반하는 Bayesian 모형을 사용하는 boundary-adaptive despeckling 방법을 제안하였다. 이 방법은 speckle 제거 영상의 최대 사후(maximum a posteriori: MAP) 추정치를 구하기 위해서 Point-Jacobian iteration을 이용한다 인접하고 있는 다른 특성의 지역에 위치한 화소의 값을 사용하는 가능성을 줄이기 위해 Boundary-adaptive algorithm은 경계에 가까울 수록 멀리 떨어진 이웃 화소로부터 정보를 덜 수집하도록 고안된다. 이러한 boundary-adaptive 방법은 전반적으로 simulation 자료를 사용하여 Lee(2009)에서 평가되었고 그리고 제안된 방법의 효험을 증명하였다. 본 연구는 Lee(2009)의 확장 연구로 MAP 추정치를 구하기 반복 algorithm의 계산 효율성을 증가 시키고 noise 제거와 함께 분류를 수행하는 수정 algorithm을 제안한다. Simulation 자료를 사용한 실험을 통해서 boundary-adaption이 분류 오류를 줄여줄 뿐 아니라 더욱 명확한 경계선을 보여준다는 것을 알 수 있다. 또한 영종도 서해안에서 관측된 고해상도 Terra-SAR data에 적용한 결과는 boundary-adaption은 SAR 활용에서 분석의 정확성을 개선 시킬 수 있다는 것을 암시한다.

개선된 데이터마이닝을 위한 혼합 학습구조의 제시 (Hybrid Learning Architectures for Advanced Data Mining:An Application to Binary Classification for Fraud Management)

  • Kim, Steven H.;Shin, Sung-Woo
    • 정보기술응용연구
    • /
    • 제1권
    • /
    • pp.173-211
    • /
    • 1999
  • The task of classification permeates all walks of life, from business and economics to science and public policy. In this context, nonlinear techniques from artificial intelligence have often proven to be more effective than the methods of classical statistics. The objective of knowledge discovery and data mining is to support decision making through the effective use of information. The automated approach to knowledge discovery is especially useful when dealing with large data sets or complex relationships. For many applications, automated software may find subtle patterns which escape the notice of manual analysis, or whose complexity exceeds the cognitive capabilities of humans. This paper explores the utility of a collaborative learning approach involving integrated models in the preprocessing and postprocessing stages. For instance, a genetic algorithm effects feature-weight optimization in a preprocessing module. Moreover, an inductive tree, artificial neural network (ANN), and k-nearest neighbor (kNN) techniques serve as postprocessing modules. More specifically, the postprocessors act as second0order classifiers which determine the best first-order classifier on a case-by-case basis. In addition to the second-order models, a voting scheme is investigated as a simple, but efficient, postprocessing model. The first-order models consist of statistical and machine learning models such as logistic regression (logit), multivariate discriminant analysis (MDA), ANN, and kNN. The genetic algorithm, inductive decision tree, and voting scheme act as kernel modules for collaborative learning. These ideas are explored against the background of a practical application relating to financial fraud management which exemplifies a binary classification problem.

  • PDF

Comparison of Classification Rate Between BP and ANFIS with FCM Clustering Method on Off-line PD Model of Stator Coil

  • Park Seong-Hee;Lim Kee-Joe;Kang Seong-Hwa;Seo Jeong-Min;Kim Young-Geun
    • KIEE International Transactions on Electrophysics and Applications
    • /
    • 제5C권3호
    • /
    • pp.138-142
    • /
    • 2005
  • In this paper, we compared recognition rates between NN(neural networks) and clustering method as a scheme of off-line PD(partial discharge) diagnosis which occurs at the stator coil of traction motor. To acquire PD data, three defective models are made. PD data for classification were acquired from PD detector. And then statistical distributions are calculated to classify model discharge sources. These statistical distributions were applied as input data of two classification tools, BP(Back propagation algorithm) and ANFIS(adaptive network based fuzzy inference system) pre-processed FCM(fuzzy c-means) clustering method. So, classification rate of BP were somewhat higher than ANFIS. But other items of ANFIS were better than BP; learning time, parameter number, simplicity of algorithm.

EFTG: Efficient and Flexible Top-K Geo-textual Publish/Subscribe

  • zhu, Hong;Li, Hongbo;Cui, Zongmin;Cao, Zhongsheng;Xie, Meiyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권12호
    • /
    • pp.5877-5897
    • /
    • 2018
  • With the popularity of mobile networks and smartphones, geo-textual publish/subscribe messaging has attracted wide attention. Different from the traditional publish/subscribe format, geo-textual data is published and subscribed in the form of dynamic data flow in the mobile network. The difference creates more requirements for efficiency and flexibility. However, most of the existing Top-k geo-textual publish/subscribe schemes have the following deficiencies: (1) All publications have to be scored for each subscription, which is not efficient enough. (2) A user should take time to set a threshold for each subscription, which is not flexible enough. Therefore, we propose an efficient and flexible Top-k geo-textual publish/subscribe scheme. First, our scheme groups publish and subscribe based on text classification. Thus, only a few parts of related publications should be scored for each subscription, which significantly enhances efficiency. Second, our scheme proposes an adaptive publish/subscribe matching algorithm. The algorithm does not require the user to set a threshold. It can adaptively return Top-k results to the user for each subscription, which significantly enhances flexibility. Finally, theoretical analysis and experimental evaluation verify the efficiency and effectiveness of our scheme.

상향식 계층분류의 최적화 된 병합을 위한 후처리분석과 피드백 알고리즘 (Reinforcement Post-Processing and Feedback Algorithm for Optimal Combination in Bottom-Up Hierarchical Classification)

  • 최윤정;박승수
    • 정보처리학회논문지B
    • /
    • 제17B권2호
    • /
    • pp.139-148
    • /
    • 2010
  • 본 논문은 자동화된 분류시스템의 성능향상을 위한 것으로 오분류율이 높은 불확실성이 강한 문서들의 범주결정방식을 개선하기 위한 후처리분석 방법과 피드백 알고리즘을 제안한다. 전통적인 분류시스템에서 분류의 정확성을 결정하는 요인으로 학습방법과 분류모델, 그리고 데이터의 특성을 들 수 있다. 특성들이 일부 공유되어 있거나 다의적인 특성들이 풍부한 문서들의 분류문제는 정형화된 데이터들에서 보다 심화된 분석과정이 요구된다. 특히 단순히 최상위 항목으로 지정하는 기존의 결정방법이 분류의 정확도를 저하시키는 직접적인 요인이 되므로 학습방법의 개선과 함께 분류모델을 적용한 이후의 결과 값인 순위정보 리스트의 관계를 분석하는 작업이 필요하다. 본 연구에서는 경계범주의 자동탐색기법으로 확장된 학습체계를 제안한 이전 연구의 후속작업으로써, 최종 범주를 결정하기까지의 후처리분석 방법과 이전의 학습단계로 피드백하여 신뢰성을 높일 수 있는 알고리즘을 제안하고 있다. 실험결과에서는 제안된 범주결정방식을 적용한 후 1회의 피드백을 수행하였을 때의 결과들을 단계적이고 종합적으로 분석함으로써 본 연구의 타당성과 정확성을 보인다.

유전 알고리즘을 이용한 선형 결정 함수의 결정 및 이진 결정 트리 구성에의 적용 (A determination of linear decision function using GA and its application to the construction of binary decision tree)

  • 정순원;박귀태
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
    • /
    • pp.271-274
    • /
    • 1996
  • In this paper a new determination scheme of linear decision function is proposed. In this scheme, the weights in linear decision function is obtained by genetic algorithm. The result considering balance between clusters as well as classification error can be obtained by properly selecting the fitness function of genetic algorithm in determination of linear decision function and this has the merit in applying this scheme to the construction of binary decision tree. The proposed scheme is applied to the artificial two dimensional data and real multi dimensional data. Experimental results show the usefulness of the proposed scheme.

  • PDF

Adaptive Fuzzy Inference Algorithm for Shape Classification

  • Kim, Yoon-Ho;Ryu, Kwang-Ryol
    • 한국정보통신학회논문지
    • /
    • 제4권3호
    • /
    • pp.611-618
    • /
    • 2000
  • This paper presents a shape classification method of dynamic image based on adaptive fuzzy inference. It describes the design scheme of fuzzy inference algorithm which makes it suitable for low speed systems such as conveyor, uninhabited transportation. In the first Discrete Wavelet Transform(DWT) is utilized to extract the motion vector in a sequential images. This approach provides a mechanism to simple but robust information which is desirable when dealing with an unknown environment. By using feature parameters of moving object, fuzzy if - then rule which can be able to adapt the variation of circumstances is devised. Then applying the implication function, shape classification processes are performed. Experimental results are presented to testify the performance and applicability of the proposed algorithm.

  • PDF