• 제목/요약/키워드: classification model

Search Result 4,124, Processing Time 0.027 seconds

A Study on the Deep Learning-based Tree Species Classification by using High-resolution Orthophoto Images (고해상도 정사영상을 이용한 딥러닝 기반의 산림수종 분류에 관한 연구)

  • JANG, Kwangmin
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.24 no.3
    • /
    • pp.1-9
    • /
    • 2021
  • In this study, we evaluated the accuracy of deep learning-based tree species classification model trained by using high-resolution images. We selected five species classed, i.e., pine, birch, larch, korean pine, mongolian oak for classification. We created 5,000 datasets using high-resolution orthophoto and forest type map. CNN deep learning model is used to tree species classification. We divided training data, verification data, and test data by a 5:3:2 ratio of the datasets and used it for the learning and evaluation of the model. The overall accuracy of the model was 89%. The accuracy of each species were pine 95%, birch 89%, larch 80%, korean pine 86% and mongolian oak 98%.

ConvXGB: A new deep learning model for classification problems based on CNN and XGBoost

  • Thongsuwan, Setthanun;Jaiyen, Saichon;Padcharoen, Anantachai;Agarwal, Praveen
    • Nuclear Engineering and Technology
    • /
    • v.53 no.2
    • /
    • pp.522-531
    • /
    • 2021
  • We describe a new deep learning model - Convolutional eXtreme Gradient Boosting (ConvXGB) for classification problems based on convolutional neural nets and Chen et al.'s XGBoost. As well as image data, ConvXGB also supports the general classification problems, with a data preprocessing module. ConvXGB consists of several stacked convolutional layers to learn the features of the input and is able to learn features automatically, followed by XGBoost in the last layer for predicting the class labels. The ConvXGB model is simplified by reducing the number of parameters under appropriate conditions, since it is not necessary re-adjust the weight values in a back propagation cycle. Experiments on several data sets from UCL Repository, including images and general data sets, showed that our model handled the classification problems, for all the tested data sets, slightly better than CNN and XGBoost alone and was sometimes significantly better.

Metabolic Diseases Classification Models according to Food Consumption using Machine Learning (머신러닝을 활용한 식품소비에 따른 대사성 질환 분류 모델)

  • Hong, Jun Ho;Lee, Kyung Hee;Lee, Hye Rim;Cheong, Hwan Suk;Cho, Wan-Sup
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.3
    • /
    • pp.354-360
    • /
    • 2022
  • Metabolic disease is a disease with a prevalence of 26% in Korean, and has three of the five states of abdominal obesity, hypertension, hunger glycemic disorder, high neutral fat, and low HDL cholesterol at the same time. This paper links the consumer panel data of the Rural Development Agency(RDA) and the medical care data of the National Health Insurance Service(NHIS) to generate a classification model that can be divided into a metabolic disease group and a control group through food consumption characteristics, and attempts to compare the differences. Many existing domestic and foreign studies related to metabolic diseases and food consumption characteristics are disease correlation studies of specific food groups and specific ingredients, and this paper is logistic considering all food groups included in the general diet. We created a classification model using regression, a decision tree-based classification model, and a classification model using XGBoost. Of the three models, the high-precision model is the XGBoost classification model, but the accuracy was not high at less than 0.7. As a future study, it is necessary to extend the observation period for food consumption in the patient group to more than 5 years and to study the metabolic disease classification model after converting the food consumed into nutritional characteristics.

A Study on the Classification Scheme of the Internet Search Engine (인터넷 탐색엔진에 관한 연구)

  • 김영보
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.8 no.1
    • /
    • pp.197-227
    • /
    • 1997
  • The main purpose of this study is ① to settle and to analyze the classification of the Internet Search Engine comparitively, and ② to build the compatible model of Internet Search Engine classification in order to seek information on the Internet resources. specially in the branch of the Computers and Internet areas. For this study, four Internet Search Engine (Excite, 1-Detect, Simmany, Yahoo Korea!), Inspec Classification and two distionaries were used. The major findings and result of analysis are summarized as follows : 1. The basis of the classification is the scope of topics, the system logic, the clearness, the efficiency. 2. The scope of topics is analyzed comparitively by the number of items from each Search Engine. In the result, Excite is the most superior of the four 3. The system logic is analyzed comparitively by the casuality balance and consistency of the items from each Search Engine. In the result, Excite is the most superior of the four 4. The clearness is analyzed comparitively by the clearness and accuracy of items, the recognition of the searchers. In the result, Excite is the most superior of the four. 5 The efficiency is analyzed comparitively by the exactness of indexing and decreasing the effort of the searchers. In the result, Yahoo Korea! is the most superior of the four. 6 The compatible model of Internet Search Engine classification is estavlished to uplift the scope of topics, the system logic, the clearness, and the efficiency. The model divides the area mainly based upon the topics and resources using‘bookmark’and‘shadow’concept.

  • PDF

An Analysis of the Application Framework of the Business Reference Model to Records Classification Schemes in Korean Central Government Agencies (기록분류를 위한 정부기능분류체계의 적용 구조 및 운용 분석 - 중앙행정기관을 중심으로 -)

  • Seol, Moon-Won
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.24 no.4
    • /
    • pp.23-51
    • /
    • 2013
  • The purpose of the study is to examine the potentialities and limits of Business Reference Model (BRM) as records classification schemes in Korean central state institutions. The analysis is based on the data collected through focus group interviews of three times, in which six records professionals from central government agencies participate. This paper begins with inquiring the framework of records classification based BRM, required by Public Records Management Act. It explores the types of benefit of BRM application to government records classification. Based on the collected data from the interviews, it investigates how records are aggregated, and how transaction level (Danwi-Gwaje) of BRM is applied in the course of records aggregation.

A Domain Action Classification Model Using Conditional Random Fields (Conditional Random Fields를 이용한 영역 행위 분류 모델)

  • Kim, Hark-Soo
    • Korean Journal of Cognitive Science
    • /
    • v.18 no.1
    • /
    • pp.1-14
    • /
    • 2007
  • In a goal-oriented dialogue, speakers' intentions can be represented by domain actions that consist of pairs of a speech act and a concept sequence. Therefore, if we plan to implement an intelligent dialogue system, it is very important to correctly infer the domain actions from surface utterances. In this paper, we propose a statistical model to determine speech acts and concept sequences using conditional random fields at the same time. To avoid biased learning problems, the proposed model uses low-level linguistic features such as lexicals and parts-of-speech. Then, it filters out uninformative features using the chi-square statistic. In the experiments in a schedule arrangement domain, the proposed system showed good performances (the precision of 93.0% on speech act classification and the precision of 90.2% on concept sequence classification).

  • PDF

Object Classification based on Weakly Supervised E2LSH and Saliency map Weighting

  • Zhao, Yongwei;Li, Bicheng;Liu, Xin;Ke, Shengcai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.364-380
    • /
    • 2016
  • The most popular approach in object classification is based on the bag of visual-words model, which has several fundamental problems that restricting the performance of this method, such as low time efficiency, the synonym and polysemy of visual words, and the lack of spatial information between visual words. In view of this, an object classification based on weakly supervised E2LSH and saliency map weighting is proposed. Firstly, E2LSH (Exact Euclidean Locality Sensitive Hashing) is employed to generate a group of weakly randomized visual dictionary by clustering SIFT features of the training dataset, and the selecting process of hash functions is effectively supervised inspired by the random forest ideas to reduce the randomcity of E2LSH. Secondly, graph-based visual saliency (GBVS) algorithm is applied to detect the saliency map of different images and weight the visual words according to the saliency prior. Finally, saliency map weighted visual language model is carried out to accomplish object classification. Experimental results datasets of Pascal 2007 and Caltech-256 indicate that the distinguishability of objects is effectively improved and our method is superior to the state-of-the-art object classification methods.

Topic Extraction and Classification Method Based on Comment Sets

  • Tan, Xiaodong
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.329-342
    • /
    • 2020
  • In recent years, emotional text classification is one of the essential research contents in the field of natural language processing. It has been widely used in the sentiment analysis of commodities like hotels, and other commentary corpus. This paper proposes an improved W-LDA (weighted latent Dirichlet allocation) topic model to improve the shortcomings of traditional LDA topic models. In the process of the topic of word sampling and its word distribution expectation calculation of the Gibbs of the W-LDA topic model. An average weighted value is adopted to avoid topic-related words from being submerged by high-frequency words, to improve the distinction of the topic. It further integrates the highest classification of the algorithm of support vector machine based on the extracted high-quality document-topic distribution and topic-word vectors. Finally, an efficient integration method is constructed for the analysis and extraction of emotional words, topic distribution calculations, and sentiment classification. Through tests on real teaching evaluation data and test set of public comment set, the results show that the method proposed in the paper has distinct advantages compared with other two typical algorithms in terms of subject differentiation, classification precision, and F1-measure.

Design of Distributed Processing Framework Based on H-RTGL One-class Classifier for Big Data (빅데이터를 위한 H-RTGL 기반 단일 분류기 분산 처리 프레임워크 설계)

  • Kim, Do Gyun;Choi, Jin Young
    • Journal of Korean Society for Quality Management
    • /
    • v.48 no.4
    • /
    • pp.553-566
    • /
    • 2020
  • Purpose: The purpose of this study was to design a framework for generating one-class classification algorithm based on Hyper-Rectangle(H-RTGL) in a distributed environment connected by network. Methods: At first, we devised one-class classifier based on H-RTGL which can be performed by distributed computing nodes considering model and data parallelism. Then, we also designed facilitating components for execution of distributed processing. In the end, we validate both effectiveness and efficiency of the classifier obtained from the proposed framework by a numerical experiment using data set obtained from UCI machine learning repository. Results: We designed distributed processing framework capable of one-class classification based on H-RTGL in distributed environment consisting of physically separated computing nodes. It includes components for implementation of model and data parallelism, which enables distributed generation of classifier. From a numerical experiment, we could observe that there was no significant change of classification performance assessed by statistical test and elapsed time was reduced due to application of distributed processing in dataset with considerable size. Conclusion: Based on such result, we can conclude that application of distributed processing for generating classifier can preserve classification performance and it can improve the efficiency of classification algorithms. In addition, we suggested an idea for future research directions of this paper as well as limitation of our work.

Classification of Plants into Families based on Leaf Texture

  • TREY, Zacrada Francoise;GOORE, Bi Tra;BAGUI, K. Olivier;TIEBRE, Marie Solange
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.2
    • /
    • pp.205-211
    • /
    • 2021
  • Plants are important for humanity. They intervene in several areas of human life: medicine, nutrition, cosmetics, decoration, etc. The large number of varieties of these plants requires an efficient solution to identify them for proper use. The ease of recognition of these plants undoubtedly depends on the classification of these species into family; however, finding the relevant characteristics to achieve better automatic classification is still a huge challenge for researchers in the field. In this paper, we have developed a new automatic plant classification technique based on artificial neural networks. Our model uses leaf texture characteristics as parameters for plant family identification. The results of our model gave a perfect classification of three plant families of the Ivorian flora, with a determination coefficient (R2) of 0.99; an error rate (RMSE) of 1.348e-14, a sensitivity of 84.85%, a specificity of 100%, a precision of 100% and an accuracy (Accuracy) of 100%. The same technique was applied on Flavia: the international basis of plants and showed a perfect identification regression (R2) of 0.98, an error rate (RMSE) of 1.136e-14, a sensitivity of 84.85%, a specificity of 100%, a precision of 100% and a trueness (Accuracy) of 100%. These results show that our technique is efficient and can guide the botanist to establish a model for many plants to avoid identification problems.