• Title/Summary/Keyword: $L_1$-데이터뎁스

Search Result 2, Processing Time 0.016 seconds

A comparison study of classification method based of SVM and data depth in microarray data (마이크로어레이 자료에서 서포트벡터머신과 데이터 뎁스를 이용한 분류방법의 비교연구)

  • Hwang, Jin-Soo;Kim, Jee-Yun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.2
    • /
    • pp.311-319
    • /
    • 2009
  • A robust L1 data depth was used in clustering and classification, so called DDclus and DDclass by Jornsten (2004). SVM-based classification works well in most of the situation but show some weakness in the presence of outliers. Proper gene selection is important in classification since there are so many redundant genes. Either by selecting appropriate genes or by gene clustering combined with classification method enhance the overall performance of classification. The performance of depth based method are evaluated among several SVM-based classification methods.

  • PDF

Comparison Studies of Classification Methods based on L1-Distance and L1-Data Depth (L1-거리와 L1-데이터뎁스를 이용한 분류방법의 비교연구)

  • Baek Soo-Jin;Hwang Jin-Soo;Kim Jean-Kyung
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.1
    • /
    • pp.183-193
    • /
    • 2006
  • We consider a new classification method(DnDclass) combining two classification rules based on $L_1$-distance(L1DISTclass) and $L_1$-data depth(L1DDclass). To investigate characteristics and to evaluate the performance of these classification methods, we use simulation data in various settings. Through this simulation study, we can confirm that the new method, DnDclass, performs relatively well in many cases.