• Title/Summary/Keyword: Classification Algorithms

Search Result 1,173, Processing Time 0.027 seconds

Power Efficient Classification Method for Sensor Nodes in BSN Based ECG Monitoring System

  • Zeng, Min;Lee, Jeong-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1322-1329
    • /
    • 2010
  • As body sensor network (BSN) research becomes mature, the need for managing power consumption of sensor nodes has become evident since most of the applications are designed for continuous monitoring. Real time Electrocardiograph (ECG) analysis on sensor nodes is proposed as an optimal choice for saving power consumption by reducing data transmission overhead. Smart sensor nodes with the ability to categorize lately detected ECG cycles communicate with base station only when ECG cycles are classified as abnormal. In this paper, ECG classification algorithms are described, which categorize detected ECG cycles as normal or abnormal, or even more specific cardiac diseases. Our Euclidean distance (ED) based classification method is validated to be most power efficient and very accurate in determining normal or abnormal ECG cycles. A close comparison of power efficiency and classification accuracy between our ED classification algorithm and generalized linear model (GLM) based classification algorithm is provided. Through experiments we show that, CPU cycle power consumption of ED based classification algorithm can be reduced by 31.21% and overall power consumption can be reduced by 13.63% at most when compared with GLM based method. The accuracy of detecting NSR, APC, PVC, SVT, VT, and VF using GLM based method range from 55% to 99% meanwhile, we show that the accuracy of detecting normal and abnormal ECG cycles using our ED based method is higher than 86%.

Design and Implementation of Hierarchical Image Classification System for Efficient Image Classification of Objects (효율적인 사물 이미지 분류를 위한 계층적 이미지 분류 체계의 설계 및 구현)

  • You, Taewoo;Kim, Yunuk;Jeong, Hamin;Yoo, Hyunsoo;Ahn, Yonghak
    • Convergence Security Journal
    • /
    • v.18 no.3
    • /
    • pp.53-59
    • /
    • 2018
  • In this paper, we propose a hierarchical image classification scheme for efficient object image classification. In the non-hierarchical image classification, which classifies the existing whole images at one time, it showed that objects with relatively similar shapes are not recognized efficiently. Therefore, in this paper, we introduce the image classification method in the hierarchical structure which attempts to classify object images hierarchically. Also, we introduce to the efficient class structure and algorithms considering the scalability that can occur when a deep learning image classification is applied to an actual system. Such a scheme makes it possible to classify images with a higher degree of confidence in object images having relatively similar shapes.

  • PDF

Classification Algorithm-based Prediction Performance of Order Imbalance Information on Short-Term Stock Price (분류 알고리즘 기반 주문 불균형 정보의 단기 주가 예측 성과)

  • Kim, S.W.
    • Journal of Intelligence and Information Systems
    • /
    • v.28 no.4
    • /
    • pp.157-177
    • /
    • 2022
  • Investors are trading stocks by keeping a close watch on the order information submitted by domestic and foreign investors in real time through Limit Order Book information, so-called price current provided by securities firms. Will order information released in the Limit Order Book be useful in stock price prediction? This study analyzes whether it is significant as a predictor of future stock price up or down when order imbalances appear as investors' buying and selling orders are concentrated to one side during intra-day trading time. Using classification algorithms, this study improved the prediction accuracy of the order imbalance information on the short-term price up and down trend, that is the closing price up and down of the day. Day trading strategies are proposed using the predicted price trends of the classification algorithms and the trading performances are analyzed through empirical analysis. The 5-minute KOSPI200 Index Futures data were analyzed for 4,564 days from January 19, 2004 to June 30, 2022. The results of the empirical analysis are as follows. First, order imbalance information has a significant impact on the current stock prices. Second, the order imbalance information observed in the early morning has a significant forecasting power on the price trends from the early morning to the market closing time. Third, the Support Vector Machines algorithm showed the highest prediction accuracy on the day's closing price trends using the order imbalance information at 54.1%. Fourth, the order imbalance information measured at an early time of day had higher prediction accuracy than the order imbalance information measured at a later time of day. Fifth, the trading performances of the day trading strategies using the prediction results of the classification algorithms on the price up and down trends were higher than that of the benchmark trading strategy. Sixth, except for the K-Nearest Neighbor algorithm, all investment performances using the classification algorithms showed average higher total profits than that of the benchmark strategy. Seventh, the trading performances using the predictive results of the Logical Regression, Random Forest, Support Vector Machines, and XGBoost algorithms showed higher results than the benchmark strategy in the Sharpe Ratio, which evaluates both profitability and risk. This study has an academic difference from existing studies in that it documented the economic value of the total buy & sell order volume information among the Limit Order Book information. The empirical results of this study are also valuable to the market participants from a trading perspective. In future studies, it is necessary to improve the performance of the trading strategy using more accurate price prediction results by expanding to deep learning models which are actively being studied for predicting stock prices recently.

Classification by feedback structure and partitioning into acyclic subgraphs for a cyclic workflow graph

  • Choi, Yong-Sun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.718-721
    • /
    • 2004
  • This paper introduces a novel method of partitioning a cyclic workflow graph into the subgraphs of acyclic flows. The way of iterative classification of nodes according to feedback structures and deriving subgraphs of acyclic flows is described with illustrative examples. The proposed method allows a cyclic workflow model to be analyzed further, if necessary, with several smaller subflows, which are all acyclic.

  • PDF

A Study on the Implementation of LCD Defect Inspection Algorithm (LCD 결함검사 알고리즘에 관한 연구)

  • 전유혁;김규태;김은수
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.637-640
    • /
    • 1999
  • In this Paper we show the LCD simulator for defect inspection using image processing algorithm and neural network. The defect inspection algorithm of the LCD consists of preprocessing, feature extraction and defect classification. Preprocess removes noise from LCD image, using morphology operator and neural network is used for the defect classification. Sample images with scratch, pinhole, and spot from real LCD color filter image are used. The proposed algorithms show that defect detected and classified in the ratio of 92.3% and 94.6 respectively.

  • PDF

Robust Variable Selection in Classification Tree

  • Jang Jeong Yee;Jeong Kwang Mo
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2001.11a
    • /
    • pp.89-94
    • /
    • 2001
  • In this study we focus on variable selection in decision tree growing structure. Some of the splitting rules and variable selection algorithms are discussed. We propose a competitive variable selection method based on Kruskal-Wallis test, which is a nonparametric version of ANOVA F-test. Through a Monte Carlo study we note that CART has serious bias in variable selection towards categorical variables having many values, and also QUEST using F-test is not so powerful to select informative variables under heavy tailed distributions.

  • PDF

Evolution of the Behavioral Knowledge for a Virtual Robot

  • Hwang Su-Chul;Cho Kyung-Dal
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.4
    • /
    • pp.302-309
    • /
    • 2005
  • We have studied a model and application that evolves the behavioral knowledge of a virtual robot. The knowledge is represented in classification rules and a neural network, and is learned by a genetic algorithm. The model consists of a virtual robot with behavior knowledge, an environment that it moves in, and an evolution performer that includes a genetic algorithm. We have also applied our model to an environment where the robots gather food into a nest. When comparing our model with the conventional method on various test cases, our model showed superior overall learning.

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

  • 김대순;김환용
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.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

Korean Traditional Music Genre Classification Using Sample and MIDI Phrases

  • Lee, JongSeol;Lee, MyeongChun;Jang, Dalwon;Yoon, Kyoungro
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1869-1886
    • /
    • 2018
  • This paper proposes a MIDI- and audio-based music genre classification method for Korean traditional music. There are many traditional instruments in Korea, and most of the traditional songs played using the instruments have similar patterns and rhythms. Although music information processing such as music genre classification and audio melody extraction have been studied, most studies have focused on pop, jazz, rock, and other universal genres. There are few studies on Korean traditional music because of the lack of datasets. This paper analyzes raw audio and MIDI phrases in Korean traditional music, performed using Korean traditional musical instruments. The classified samples and MIDI, based on our classification system, will be used to construct a database or to implement our Kontakt-based instrument library. Thus, we can construct a management system for a Korean traditional music library using this classification system. Appropriate feature sets for raw audio and MIDI phrases are proposed and the classification results-based on machine learning algorithms such as support vector machine, multi-layer perception, decision tree, and random forest-are outlined in this paper.

Hierarchical Binary Search Tree (HBST) for Packet Classification (패킷 분류를 위한 계층 이진 검색 트리)

  • Chu, Ha-Neul;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3B
    • /
    • pp.143-152
    • /
    • 2007
  • In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.