• 제목/요약/키워드: Classification Attributes

검색결과 303건 처리시간 0.026초

러프집합과 Granular Computing을 이용한 분류지식 발견 (Discovering classification knowledge using Rough Set and Granular Computing)

  • 최상철;이철희
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 추계학술대회 논문집 학회본부 D
    • /
    • pp.672-674
    • /
    • 2000
  • There are various ways in classification methodologies of data mining such as neural networks but the result should be explicit and understandable and the classification rules be short and clear. Rough set theory is a effective technique in extracting knowledge from incomplete and inconsistent information and makes an offer classification and approximation by various attributes with effect. This paper discusses granularity of knowledge for reasoning of uncertain concepts by using generalized rough set approximations based on hierarchical granulation structure and uses hierarchical classification methodology that is more effective technique for classification by applying core to upper level. The consistency rules with minimal attributes is discovered and applied to classifying real data.

  • PDF

신용평점화에서 벌점화를 이용한 절단값 선택 (Cutpoint Selection via Penalization in Credit Scoring)

  • 진슬기;김광래;박창이
    • 응용통계연구
    • /
    • 제25권2호
    • /
    • pp.261-267
    • /
    • 2012
  • 신용평점표(credit scorecard) 작성시 각 특성변수(characteristic variable)들을 몇 개의 속성(attribute)들로 나누고 각 속성에 적절한 가중치를 부여하게 된다. 이 과정을 성김화(coarse classi cation)라 한다. 특성변수들을 속성들로 나눌 때 그 기준이 되는 절단값(cutpoint)을 선택해야 한다. 본 논문에서는 벌점화(penalization) 기반의 절단값 선택법을 제안한다. 또한 여러가지 모의실험과 실제 신용자료의 분석을 통하여 제안된 방법과 기존의 절단값 선택법인 스플라인 분류 기계 (Koo 등, 2009)의 성능을 비교한다.

분류학습을 위한 연속 애트리뷰트의 이산화 방법에 관한 연구 (Discretization of Continuous-Valued Attributes for Classification Learning)

  • 이창환
    • 한국정보처리학회논문지
    • /
    • 제4권6호
    • /
    • pp.1541-1549
    • /
    • 1997
  • 대부분의 기계학습 방법들은 이산형의 데이타를 학습에 사용되는 데이타의 형식으로 요구하고 있다. 따라서 연속형 데이타의 경우는 기계학습 방법들을 적용하기 전에 그 데이타를 이산형으로 바꾸어 주는 과정이 필요하다. 이러한 이산화 과정은 그 중요성에 비하여 상대적으로 관련 연구가 미비한 수준이다. 따라서 이 논문은 정보이론을 사용하여 연속형 자료를 이산형의 형태로 변환시키는 새로운 방법을 제안하였다. 각 애트리뷰트의 값들이 목적 애트리뷰트에 제공하는 정보의 량을 엔트로피 함수의 일종인 Hellinger 변량을 이용하여 계산하였으며, 각 애트리뷰트마다 제공하는 정보의 손실을 최소화할 수 있는 이산화 경계선을 계산하였다. 본 논문이 제안한 방법의 성능을 ID3 와 신경망 알고리즘을 사용하여 기존의 이산화 방법들과 비교하였으며 거의 대부분 우수한 정확성을 보였다.

  • PDF

Tolerance Rough Set Approaches in the Classification of Multi-Attribute Data

  • Lee, Jaeik;Suh Kapsun;Suh, Yong-Soo
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
    • /
    • pp.419-423
    • /
    • 1997
  • This paper is concerned about the classification of objects together with muti-attributes such as remote sensing image data by using tolerance rough set. To produce more reliable relations from given attributes in the data, we define new similarity measures by using scaling. Our Method will be applied to classify multi-spectral image data.

  • PDF

A parallel tasks Scheduling heuristic in the Cloud with multiple attributes

  • Wang, Qin;Hou, Rongtao;Hao, Yongsheng;Wang, Yin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권1호
    • /
    • pp.287-307
    • /
    • 2018
  • There are two targets to schedule parallel jobs in the Cloud: (1) scheduling the jobs as many as possible, and (2) reducing the average execution time of the jobs. Most of previous work mainly focuses on the computing speed of resources without considering other attributes, such as bandwidth, memory and so on. Especially, past work does not consider the supply-demand condition from those attributes. Resources have different attributes, considering those attributes together makes the scheduling problem more difficult. This is the problem that we try to solve in this paper. First of all, we propose a new parallel job scheduling method based on a classification method of resources from different attributes, and then a scheduling method-CPLMT (Cloud parallel scheduling based on the lists of multiple attributes) is proposed for the parallel tasks. The classification method categories resources into different kinds according to the number of resources that satisfy the job from different attributes of the resource, such as the speed of the resource, memory and so on. Different kinds have different priorities in the scheduling. For the job that belongs to the same kinds, we propose CPLMT to schedule those jobs. Comparisons between our method, FIFO (First in first out), ASJS (Adaptive Scoring Job Scheduling), Fair and CMMS (Cloud-Minmin) are executed under different environments. The simulation results show that our proposed CPLMT not only reduces the number of unfinished jobs, but also reduces the average execution time.

라프셋 이론이 적용에 의한 ID3의 개선 (Improvement of ID3 Using Rough Sets)

  • 정홍;김두완;정환묵
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
    • /
    • pp.170-174
    • /
    • 1997
  • This paper studies a method for making more efficient classification rules in the ID3 using the rough set theory. Decision tree technique of the ID3 always uses all the attributes in a table of examples for making a new decision tree, but rough set technique can in advance eleminate dispensable attributes. And the former generates only one type of classification rules, but the latter generates all the possibles types of them. The rules generated by the rough set technique are the simplist from as proved by the rough set theory. Therefore, ID3, applying the rough set technique, can reduct the size of the table of examples, generate the simplist form of the classification rules, and also implement an effectie classification system.

  • PDF

가속도센서를 이용한 편마비성보행 평가 (Evaluation of Hemiplegic Gait Using Accelerometer)

  • 이준석;박수지;신항식
    • 전기학회논문지
    • /
    • 제66권11호
    • /
    • pp.1634-1640
    • /
    • 2017
  • The study aims to distinguish hemiplegic gait and normal gait using simple wearable device and classification algorithm. Thus, we developed a wearable system equipped three axis accelerometer and three axis gyroscope. The developed wearable system was verified by clinical experiment. In experiment, twenty one normal subjects and twenty one patients undergoing stroke treatment were participated. Based on the measured inertial signal, a random forest algorithm was used to classify hemiplegic gait. Four-fold cross validation was applied to ensure the reliability of the results. To select optimal attributes, we applied the forward search algorithm with 10 times of repetition, then selected five most frequently attributes were chosen as a final attribute. The results of this study showed that 95.2% of accuracy in hemiplegic gait and normal gait classification and 77.4% of accuracy in hemiplegic-side and normal gait classification.

Reservoir Characterization using 3-D Seismic Data in BlackGold Oilsands Lease, Alberta Canada

  • Lim, Bo-Sung;Song, Hoon-Young
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 한국지구물리탐사학회 2009년도 특별 심포지엄
    • /
    • pp.35-45
    • /
    • 2009
  • Reservoir Characterization (RC) using 3-D seismic attributes analysis can provide properties of the oil sand reservoirs, beyond seismic resolution. For example, distributions and temporal bed thicknesses of reservoirs could be characterized by Spectral Decomposition (SD) and additional seismic attributes such as wavelet classification. To extract physical properties of the reservoirs, we applied 3-D seismic attributes analysis to the oil sand reservoirs in McMurray formation, in BlackGold Oilsands Lease, Alberta Canada. Because of high viscosity of the bitumen, Enhanced Oil Recovery (EOR) technology will be necessarily applied to produce the bitumen in a steam chamber generated by Steam Assisted Gravity Drainage (SAGD). To optimize the application of SAGD, it is critical to identify the distributions and thicknesses of the channel sand reservoirs and shale barriers in the promising areas. By 3-D seismic attributes analysis, we could understand the expected paleo-channel and characteristics of the reservoirs. However, further seismic analysis (e.g., elastic impedance inversion and AVO inversion) as well as geological interpretations are still required to improve the resolution and quality of RC.

  • PDF

패션 AI의 학습 데이터 표준화를 위한 패션 아이템 이미지의 색채와 소재 속성 분류 체계 (Color & Texture Attribute Classification System of Fashion Item Image for Standardizing Learning Data in Fashion AI)

  • 박낭희;최윤미
    • 한국의류학회지
    • /
    • 제44권2호
    • /
    • pp.354-368
    • /
    • 2020
  • Accurate and versatile image data-sets are essential for fashion AI research and AI-based fashion businesses based on a systematic attribute classification system. This study constructs a color and texture attribute hierarchical classification system by collecting fashion item images and analyzing the metadata of fashion items described by consumers. Essential dimensions to explain color and texture attributes were extracted; in addition, attribute values for each dimension were constructed based on metadata and previous studies. This hierarchical classification system satisfies consistency, exclusiveness, inclusiveness, and flexibility. The image tagging to confirm the usefulness of the proposed classification system indicated that the contents of attributes of the same image differ depending on the annotator that require a clear standard for distinguishing differences between the properties. This classification system will improve the reliability of the training data for machine learning, by providing standardized criteria for tasks such as tagging and annotating of fashion items.

퍼지규칙 기반 시스템에서 불필요한 속성 감축에 의한 패턴분류 (Pattern classification on the basis of unnecessary attributes reduction in fuzzy rule-based systems)

  • 손창식;김두완
    • 인터넷정보학회논문지
    • /
    • 제8권3호
    • /
    • pp.109-118
    • /
    • 2007
  • 본 논문에서는 퍼지규칙 기반 시스템에서 규칙 내에 포함된 불완전한 속성을 제거하여 보다 간략화 된 규칙으로도 분류할 수 있는 방법을 제안하였다. 제안한 방법에서는 규칙 내에 포함된 불완전한 속성을 제거하기 위해 러프집합을 이용하였고 보다 명확한 분류를 위해 출력부 소속함수의 적합도가 최대인 속성들을 추출하였다. 또한 모의실험에서는 제안된 방법의 타당성을 검증하기 위해 rice taste data를 기반으로 규칙 감축 전 퍼지 max-product 결과와 규칙 감축 후 퍼지 max-product 결과를 비교하였다. 그 결과, 규칙 감축 전 max-product 결과와 규칙 감축 후 max-product 결과가 정확히 일치함을 볼 수 있었고, 보다 객관적인 검증을 위해 비퍼지화 된 실수 구간을 비교하였다.

  • PDF