• 대한예방한의학회지
• /
• 제20권1호
• /
• pp.125-144
• /
• 2016

Objectives : About 13% of the medicines used by traditional korean medicines(TKM), are called animal medicines and are derived from non-herbal sources such as animals and insects. However, the clinical use of these preparations from animal medicines is often based on tradition and belief, rather than on evidence of toxicity and efficacy. As a result, animal medicines containing toxin have caused serious problems from injecting patients with venom. Here, various venoms frequently used as TKM were reviewed in terms of their instinct toxity and tried to estimate their safety classification. Methods : The estimation of safety classification was based on human equivalent dose(HED)-based MOS (margin of safety) and clinical dose applied for patients. Results and Conclusions : Except that of snake venom due to no clinical dose, they were evaluated as class 3 for bee venom, class 4 for cantharidin, toxin from blister beetle, and class 1 for venom from scolopendrid. In conclusion, animal medicines showed a wide range of safety classification from class 1 to class 4. This wide range is estimated to result from extremely limited applications of each venom for patients because of their strong toxicity. However, it should be cautious for application in clinics since animal medicines can produce anaphylactic reactions particularly after veinous administration even with a tiny amount of venom.

• 간호행정학회지
• /
• 제20권5호
• /
• pp.545-557
• /
• 2014

Purpose: The purpose of this study was to develop a patient classification system based on nursing care intensity for patients with acute stroke-related symptoms and verify its validity and reliability. Methods: Data were collected between November, 2013 and February, 2014. The verification for content validity of the patient classification system was conducted by a group of seven professionals. Both interrater reliability and concurrent validity were verified at stroke units in tertiary hospitals. Results: The intensive nursing care for acute stroke patients consisted of 14 classified domains and 56 classified contents by adding 'neurological assessment and observation' and 'respiratory care': 'hygiene', 'nutrition', 'elimination', 'mobility and exercise', 'education or counselling', 'emotional support', 'communication', 'treatment and examination', 'medication', 'assessment and observation', 'neurological assessment and observation', 'respiratory care', 'coordination between departments', and 'discharge or transfer care'. Each domain was classified into four levels such as Class I, Class II, Class III, and Class IV. Conclusion: The results show that this patient classification system has satisfactory validity for content and concurrent and verified reliability and can be used to accurately estimate the demand for nursing care for patients in stroke units.

• 대한원격탐사학회지
• /
• 제24권1호
• /
• pp.57-64
• /
• 2008

In the previous study, the Haar wavelet was used as the sole basis function for the 3D discrete wavelet transform because the number of bands is too small to decompose a remotely sensed image in band direction with other basis functions. However, it is possible to use other basis functions for wavelet decomposition in horizontal and vertical directions because wavelet decomposition is independently performed in each direction. This study aims to classify a high spatial resolution image with the six types of basis function including the Haar function and to compare those results. The other wavelets are more helpful to classify high resolution imagery than the Haar wavelet. In overall accuracy, the Coif4 wavelet has the best result. The improvement of classification accuracy is different depending on the type of class and the type of wavelet. Using the basis functions with long length could be effective for improving accuracy in classification, especially for the classes of small area. This study is expected to be used as fundamental information for selecting optimal basis function according to the data properties in the 3D DWT based image classification.

• 간호행정학회지
• /
• 제8권2호
• /
• pp.309-321
• /
• 2002

Purpose: A cost analysis for nursing services in operative nursing unit, emergency nursing unit, and ambulatory nursing unit was performed using patient classification system by nursing intensity in order to determine an appropriate nursing fee schedule. Method: The data were collected from 4 secondary hospitals and 5 tertiary hospitals from November 14th 2000 to January 15th 2001. The study was conducted through four phases as follows: 1) Nursing hours of each nursing service in special nursing units were measured using three kinds of patient classification systems by nursing intensity. 2) The nursing cost of nursing services in operative nursing unit, emergency nursing unit, and ambulatory nursing units was estimated based on patient classification system by nursing intensity. Results: As a result, nursing hours by nursing intensity of each special nursing unit were measured, and every nursing cost by nursing intensity in operation room and emergency room was estimated, meanwhile, the cost of nursing services in ambulatory care units was estimated only per visit as shown in chapter 4. Conclusion: Future research on nursing cost should be extended to other special nursing units such as various intensive nursing care units, delivery room, and so on. In addition, the patient classification system should be refined for its appropriateness to apply all levels of medical institutions.

• 한국통신학회논문지
• /
• 제34권11B호
• /
• pp.1234-1244
• /
• 2009

오늘날의 네트워크에서는 다양한 응용의 등장으로 인해 트래픽이 복잡 다양해지고 있다. 이러한 상황 속에서 트래픽의 응용 별 분류에 대한 중요성은 날이 갈수록 증가하고 있다. 트래픽의 응용 별 분류에 대한 요구에 따라 기존에도 많은 연구가 이루어졌었다. 포트 기반의 분류, 페이로드 기반의 분류, 머신러닝 기반의 분류 방법들이 제안되었는데 아직 트래픽을 완벽하게 분류해내는 방법론은 개발되지 않은 실정이다. 최근 연구 중에는 플로우의 통계 정보를 이용한 방법론이 많이 연구되고 있다. 본 논문에서는 통계 시그니쳐를 통한 응용 트래픽 분류 방법론을 제안하고자 한다. 플로우 중 첫 N개의 패킷의 페이로드 크기와 방향을 이용하여 통계 시그니쳐를 생성하고, 이를 이용하여 응용 트래픽을 분류한다. 그리고 검증 시스템을 통해 본 분류 방법론이 높은 정확도의 분류 방법론이라는 것을 보인다.

• 제어로봇시스템학회논문지
• /
• 제21권1호
• /
• pp.59-64
• /
• 2015

In this paper, we found the usefulness of the deep belief network (DBN) in the fields of brain-computer interface (BCI), especially in relation to imagined speech. In recent years, the growth of interest in the BCI field has led to the development of a number of useful applications, such as robot control, game interfaces, exoskeleton limbs, and so on. However, while imagined speech, which could be used for communication or military purpose devices, is one of the most exciting BCI applications, there are some problems in implementing the system. In the previous paper, we already handled some of the issues of imagined speech when using the International Phonetic Alphabet (IPA), although it required complementation for multi class classification problems. In view of this point, this paper could provide a suitable solution for vowel classification for imagined speech. We used the DBN algorithm, which is known as a deep learning algorithm for multi-class vowel classification, and selected four vowel pronunciations:, /a/, /i/, /o/, /u/ from IPA. For the experiment, we obtained the required 32 channel raw electroencephalogram (EEG) data from three male subjects, and electrodes were placed on the scalp of the frontal lobe and both temporal lobes which are related to thinking and verbal function. Eigenvalues of the covariance matrix of the EEG data were used as the feature vector of each vowel. In the analysis, we provided the classification results of the back propagation artificial neural network (BP-ANN) for making a comparison with DBN. As a result, the classification results from the BP-ANN were 52.04%, and the DBN was 87.96%. This means the DBN showed 35.92% better classification results in multi class imagined speech classification. In addition, the DBN spent much less time in whole computation time. In conclusion, the DBN algorithm is efficient in BCI system implementation.

• 한국통신학회논문지
• /
• 제14권4호
• /
• pp.348-359
• /
• 1989

본 논문은 [1]와 [2]에 의해 제안된 multitree 형상 인식 기법의 성능 개선에 관한 논문이다. Multitree 형상 인식 기법의 기본적인 생각은, Classifier 설계과정에서 각 특징별로 Binary Decision Tree 를 구성하고, 이들의 탐색 순서를 결정하며, 인식 과정에서는 앞에서 정한 탐색 순서에 의거하여, BDT(Binary Decision Tree)를 탐색해 나간다는 것이다. 이때 BDT를 추가하여 탐색하기 전에 그때까지 얻은 정보를 이용하여 입력 물체를 인식할 수 있는지에 대한 여부를 결정하며, 인식이 가능한 경우 BDT의 탐색을 멈추고, 인식이 불가능한 경우 BDT의 탐색을 계속해 나간다. 이 방법은 BDT를 각 특징별로 만들기 때문에 새로운 특징의 삭제나 첨가가 상당히 용이하며 인식에 사용되는 특징의 갯수가 감소하게 된다. 따라서 이 알고리즘은 특징의 수가 많거나 class수가 많을 경우 쉽게 이용될 수 있다. 본 논문은 각 특징에서 구한 근사화된 확률 분포로부터 입력 특징값에 대한 확률값을 구해 인식에 이용하였으며, 이 값을 이용한ㄴ 여러가지 인식 방법을 제안하였다. 그리고 Branch and Bound 방법을 사용하여 특징의 선택 순서와 탐색 범위를 구하였다. 위에서 제안한 것들을 실험한 결과 기존의 multitree형상 인식 기법보다 본 논문에서 제안한 기법의 성능이 향상되었다.

• 전기학회논문지
• /
• 제57권6호
• /
• pp.1058-1062
• /
• 2008

In clinical decision support system(CDSS), unlike rule-based expert method, appropriate data-driven machine learning method can easily provide the information of individual feature(clinical test) for disease classification. However, currently developed methods focus on the improvement of the classification accuracy for diagnosis. With the analysis of feature importance in classification, one may infer the novel clinical test sets which highly differentiate the specific diseases or disease states. In this background, we introduce a novel CDSS that integrate a classifier and feature selection module together. Random forest algorithm is applied for the classifier and the feature importance measure. The system selects the significant clinical tests discriminating the diseases by examining the classification error during backward elimination of the features. The superior performance of random forest algorithm in clinical classification was assessed against artificial neural network and decision tree algorithm by using breast cancer, diabetes and heart disease data in UCI Machine Learning Repository. The test with the same data sets shows that the proposed system can successfully select the significant clinical test set for each disease.

• 간호행정학회지
• /
• 제11권2호
• /
• pp.209-218
• /
• 2005

Purpose: This study was to setup the basis on hospital and national nursing manpower estimation accurately according to apply patient classification system of Song's study to China hospital system. Method: This study was surveyed to 964 patients at surgical and medical ward on Yanbian University Hospital in China from 17th to 31th January, 2005. Results: There was study results to test hypotheses for estimating optimal nursing manpower as follows. First, a trimodel classification scheme was developed which suggested three categories of patients as minimal care(category 1), moderate care(category 2), intensive care(category 3). Second, there was not significant difference with nursing time by sex. Third, there was not significant difference with nursing time by medical wards. Fourth, there was not significant difference with average nursing care time for each category of patients. Category 1 was estimated to spend average 19.59minutes for patients, Category 2 was about 35.68 minutes, Category 3 was 72.07minutes respectively. Total nursing hours was 62,610 minutes. Conclusion: Patient classification system of Song's study is validity for optimal nursing manpower of hospital in China.

• Journal of Information Processing Systems
• /
• 제17권1호
• /
• pp.107-123
• /
• 2021

In an online shopping site or offline store, products purchased by each customer over time form the purchase history of the customer. Also, in most retailers, products have a product taxonomy, which represents a hierarchical classification of products. Considering the product taxonomy, the lower the level of the category to which two products both belong, the more similar the two products. However, there has been little work on similarity measures for sequences considering a hierarchical classification of elements. In this paper, we propose new similarity measures for purchase histories considering not only the purchase order of products but also the hierarchical classification of products. Unlike the existing methods, where the similarity between two elements in sequences is only 0 or 1 depending on whether two elements are the same or not, the proposed method can assign any real number between 0 and 1 considering the hierarchical classification of elements. We apply this idea to extend three existing representative similarity measures for sequences. We also propose an efficient computation method for the proposed similarity measures. Through various experiments, we show that the proposed method can measure the similarity between purchase histories very effectively and efficiently.