• Title/Summary/Keyword: 분류화

Search Result 4,781, Processing Time 0.029 seconds

The Work on Harmonization of Classification and Labelling in OECD (OECD의 화학물질 분류체계 통일화 방향)

  • 김필제
    • Environmental Analysis Health and Toxicology
    • /
    • v.12 no.1_2
    • /
    • pp.21-26
    • /
    • 1997
  • 서론 : 1991년 OECD 화학물질그룹 및 관리위원회(CGMC)합동회의에서는 OECD가 화학물질의 분류와 표시제도의 국제적 통일화 활동에 참여하기로 결정하였고, EC, 스웨덴, 미국 등을 주축으로 정보교환소를 설치하여 급성경구 독성 및 환경에 위험한 물질의 통일화 업무를 개시하였다. (생략)

  • PDF

Travel Time Prediction Algorithm for Trajectory data by using Rule-Based Classification on MapReduce (맵리듀스 환경에서 규칙 기반 분류화를 이용한 궤적 데이터 주행 시간 예측 알고리즘)

  • Kim, JaeWon;Lee, HyunJo;Chang, JaeWoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.798-801
    • /
    • 2014
  • 여행 정보 시스템(ATIS), 교통 관리 시스템 (ITS) 등 궤적 기반 서비스에서, 서비스 품질을 향상시키기 위해서는 주어진 궤적 질의에 대한 정확한 주행시간을 예측하는 것이 필수적이다. 이를 위한 대표적인 공간 데이터 분석 기법으로는 데이터 분류에서 높은 정확도를 보장하는 규칙 기반 분류화 기법이 존재한다. 그러나 기존 규칙 기반 분류화 기법은 단일 컴퓨터 환경만을 고려하기 때문에, 대용량 공간 데이터 처리에 적합하지 않은 문제점이 존재한다. 이를 해결하기 위해, 본 연구에서는 맵리듀스 환경에서 규칙 기반 분류화를 이용한 궤적 데이터 주행 시간 예측 알고리즘을 개발하고자 한다. 제안하는 알고리즘은 첫째, 맵리듀스를 이용하여 대용량 공간 데이터를 병렬적으로 분석함으로써, 활용도 높은 궤적 데이터 규칙을 생성한다. 이를 통해 대용량 공간 데이터 기반의 규칙 생성 시간을 감소시킨다. 둘째, 그리드 구조 기반의 지도 데이터 분할을 통해, 사용자 질의처리 시 탐색 성능을 향상시킨다. 즉, 주행 시간 예측을 위한 규칙 그룹을 탐색 시 질의를 포함하는 그리드 셀만을 탐색하기 때문에, 질의처리 성능이 향상된다. 마지막으로 맵리듀스 구조에 적합한 질의처리 알고리즘을 설계하여, 효율적인 병렬 질의처리를 지원한다. 이를 위해 맵 함수에서는 선정된 그리드 셀에 대해, 질의에 포함된 도로 구간에서의 주행 시간을 병렬적으로 측정한다. 아울러 리듀스 함수에서는 출발 시간 및 구간별 주행 시간을 바탕으로 맵 함수의 결과를 병합함으로써, 최종 결과를 생성한다. 이를 통해 공간 빅데이터 분석을 통한 주행 시간 예측 기법의 처리 시간 및 결과 정확도를 향상시킨다.

Text Categorization Using TextRank Algorithm (TextRank 알고리즘을 이용한 문서 범주화)

  • Bae, Won-Sik;Cha, Jeong-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.110-114
    • /
    • 2010
  • We describe a new method for text categorization using TextRank algorithm. Text categorization is a problem that over one pre-defined categories are assigned to a text document. TextRank algorithm is a graph-based ranking algorithm. If we consider that each word is a vertex, and co-occurrence of two adjacent words is a edge, we can get a graph from a document. After that, we find important words using TextRank algorithm from the graph and make feature which are pairs of words which are each important word and a word adjacent to the important word. We use classifiers: SVM, Na$\ddot{i}$ve Bayesian classifier, Maximum Entropy Model, and k-NN classifier. We use non-cross-posted version of 20 Newsgroups data set. In consequence, we had an improved performance in whole classifiers, and the result tells that is a possibility of TextRank algorithm in text categorization.

KOMPSAT-3A Urban Classification Using Machine Learning Algorithm - Focusing on Yang-jae in Seoul - (기계학습 기법에 따른 KOMPSAT-3A 시가화 영상 분류 - 서울시 양재 지역을 중심으로 -)

  • Youn, Hyoungjin;Jeong, Jongchul
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.6_2
    • /
    • pp.1567-1577
    • /
    • 2020
  • Urban land cover classification is role in urban planning and management. So, it's important to improve classification accuracy on urban location. In this paper, machine learning model, Support Vector Machine (SVM) and Artificial Neural Network (ANN) are proposed for urban land cover classification based on high resolution satellite imagery (KOMPSAT-3A). Satellite image was trained based on 25 m rectangle grid to create training data, and training models used for classifying test area. During the validation process, we presented confusion matrix for each result with 250 Ground Truth Points (GTP). Of the four SVM kernels and the two activation functions ANN, the SVM Polynomial kernel model had the highest accuracy of 86%. In the process of comparing the SVM and ANN using GTP, the SVM model was more effective than the ANN model for KOMPSAT-3A classification. Among the four classes (building, road, vegetation, and bare-soil), building class showed the lowest classification accuracy due to the shadow caused by the high rise building.

Coarse-to-fine Classifier Ensemble Selection using Clustering and Genetic Algorithms (군집화와 유전 알고리즘을 이용한 거친-섬세한 분류기 앙상블 선택)

  • Kim, Young-Won;Oh, Il-Seok
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.9
    • /
    • pp.857-868
    • /
    • 2007
  • The good classifier ensemble should have a high complementarity among classifiers in order to produce a high recognition rate and its size is small in order to be efficient. This paper proposes a classifier ensemble selection algorithm with coarse-to-fine stages. for the algorithm to be successful, the original classifier pool should be sufficiently diverse. This paper produces a large classifier pool by combining several different classification algorithms and lots of feature subsets. The aim of the coarse selection is to reduce the size of classifier pool with little sacrifice of recognition performance. The fine selection finds near-optimal ensemble using genetic algorithms. A hybrid genetic algorithm with improved searching capability is also proposed. The experimentation uses the worldwide handwritten numeral databases. The results showed that the proposed algorithm is superior to the conventional ones.

Analyzing Spurious Contextualization of Korean Contrastive Sentence Representation from the Perspective of Linguistics (언어학 관점에서의 한국어 대조학습 기반 문장 임베딩의 허위 문맥화에 대한 고찰)

  • Yoo Hyun Jeong;Myeongsoo Han;Dong-Kyu Chae
    • Annual Conference on Human and Language Technology
    • /
    • 2023.10a
    • /
    • pp.468-473
    • /
    • 2023
  • 본 논문은 사전 학습 언어 모델의 특성인 이방성과 문맥화에 주목하여 이에 대한 분석 실험과 한국어 언어 모델만의 새로운 관점을 제안한다. 최근 진행된 영어 언어 모델 분석 연구에서 영감을 받아, 한국어 언어 모델에서도 대조학습을 통한 이방성과 문맥화의 변화를 보고하였으며, 다양한 모델에 대하여 토큰들을 문맥화 정도에 따라 분류하였다. 또한, 한국어의 언어학적 특성을 고려하여, 허위 문맥화를 완화할 수 있는 토큰을 문맥 중심어로, 문맥 중심어의 임베딩을 모방하는 토큰을 문맥 기능어로 분류하는 기준을 제안하였다. 간단한 적대적 데이터 증강 실험을 통하여 제안하는 분류 기준의 가능성을 확인하였으며, 본 논문이 향후 평가 벤치마크 및 데이터셋 제작, 나아가 한국어를 위한 강건한 학습 방법론에 기여하길 바란다.

  • PDF

Texture Classification Algorithm for Patch-based Image Processing (패치 기반 영상처리를 위한 텍스쳐 분류 알고리즘)

  • Yu, Seung Wan;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.146-154
    • /
    • 2014
  • The local binary pattern (LBP) scheme that is one of the texture classification methods normally uses the distribution of flat, edge and corner patterns. However, it cannot examine the edge direction and the pixel difference because it is a sort of binary pattern caused by thresholding. Furthermore, since it cannot consider the pixel distribution, it shows lower performance as the image size becomes larger. In order to solve this problem, we propose a sub-classification method using the edge direction distribution and eigen-matrix. The proposed sub-classification is applied to the particular texture patches which cannot be classified by LBP. First, we quantize the edge direction and compute its distribution. Second, we calculate the distribution of the largest value among eigenvalues derived from structure matrix. Simulation results show that the proposed method provides a higher classification performance of about 8 % than the existing method.

The New Criterion of Classification System for Data Linkage (자료 연계성을 고려한 차종 분류 기준의 제시)

  • Kim, Yun-Seob;Oh, Ju-Sam;Kim, Hyun-Seok
    • International Journal of Highway Engineering
    • /
    • v.7 no.4 s.26
    • /
    • pp.57-68
    • /
    • 2005
  • Vehicle classification system in Korea is operated by two different types depending on operating purpose and place. 8-category classification system operates in Expressway and Provincial road, and 11-category classification system operates in National highway. These different operations decrease the efficiency of practical use of gathering data. Therefore, this study proposes new-modified vehicle classification system for solving this problem. For classification, this study not only focuses on mechanic survey system which is based on vehicle specs, it's also focuses on the applicability of roadside survey. This proposed classification system considers the tendency to vary of vehicle types, and the compatibility with the other classification systems. This system might be the most suitable system for our present situation.

  • PDF

Performance Comparison of Blocking Artifact Reduction Using a Block Boundary Region Classification (블록 경계 영역 분류를 이용한 블록화 현상 제거 기법의 성능 비교)

  • 소현주;장익훈;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1921-1936
    • /
    • 1999
  • In this paper, we analyze the blocking artifact in block transform-coded images and propose a classification algorithm which classifies each horizontal and vertical block boundary into four regions of EQ, BA, EE, and AE according to the characteristics of the blocking artifact. We also compare the performance of several blocking artifact reduction methods which can reduce blocking artifact in block transform-coded images well. As the blocking artifact reduction methods, the LOT, Kim's wavelet transform-based method, Yang's POCS, Paek's POCS, and Jang's CM have been selected. Experimental results show that each horizontal and vertical block boundary classified by using the proposed classification algorithm yields different characteristics of discontinuities due to the blocking artifact according to the classified region. It is also shown that the blocking artifact reduction methods using wavelet transform yield better performance over the other methods.

  • PDF

Taxonomic study on the capitulum morphology of Korean Artemisia (Compositae) (한국산 쑥속(국화과)의 두상화서 형태에 의한 분류학적 연구)

  • Park, Myung Soon;Hong, Ki Nam;Eom, Jeong Ae;Chung, Gyu Young
    • Korean Journal of Plant Taxonomy
    • /
    • v.40 no.1
    • /
    • pp.27-42
    • /
    • 2010
  • This study was intended to investigate the capitulum morphology and to evaluate its taxonomic importance within the 23 taxa of Korean Artemisia L. The Korean Artemisia was classified into sterile subg. Dracunculus and fertile subg. Artemisia by the fertility of the disk florets, which is the traditional diagnostic character of subgenera. There are sections in subg. Artemisia: sect. Absinthium with a densely, sparsely hairy receptacle, and sect. Abrotanum and sect. Artemisia with a glabrous receptacle. However, A. fukudo and A. sacrorum belonging to sect. Abrotanum, and A. viridissima belonging to sect. Artemisia were observed to have sparsely hairy receptacles. Therefore, the presence of hair on a receptacle, which is now regarded as a key character distinguishing sections, has to be reevaluated. The whole shape and size of the capitulum, the characteristic of the stigma apex, the hair on the involucral bract, and the shape of the central or peripheral floret are thought to be the most valuable characters to consider in recognizing species.