Earticle

현재 위치 Home

International Journal of Database Theory and Application

간행물 정보
  • 자료유형
    학술지
  • 발행기관
    보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
  • pISSN
    2005-4270
  • 간기
    격월간
  • 수록기간
    2008 ~ 2016
  • 주제분류
    공학 > 컴퓨터학
  • 십진분류
    KDC 505 DDC 605
Vol.8 No.4 (32건)
No
31

ReliefF-based Multi-label Feature Selection

Yaping Cai, Ming Yang, Ming Yang, Hujun Yin

보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.8 No.4 2015.08 pp.307-318

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

In recent years, multi-label learning has been used to deal with data attributed to multiple labels simultaneously and has been increasingly applied to various applications. As many other machine learning tasks, multi-label learning also suffers from the curse of dimensionality; so extracting good features using multiple labels of the datasets becomes an important step prior to classification. In this paper, we study the problem of multi-label feature selection for classification and have proposed a method based on single label feature selection ReliefF, termed ML-ReliefF, to select discriminant features in order to boost multi-label classification accuracy. Compared to other multi-label feature selection methods that only consider the relationship between pairwise classes, the proposed method introduces the concept of label set to further consider the relationship among more than two labels, modifies the regulation of the nearest neighbors computation reflecting the influence between samples and multiple labels, and considers and adds the similarity between samples to reinforce the effect. With the classifier, ML-kNN, experiments on five different datasets show that the proposed method is effective in removing irrelevant or redundant features and the selected features are more discriminant for classification.

32

The Research and Application of a Big Data Storage Model

Na Liu, Jianfei Zhou

보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.8 No.4 2015.08 pp.319-330

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

In the big data environment, there are many new demands with data storage, the traditional data storage mode which based on relational database cannot meet these needs, many application systems tend to use NoSQL to solve the problem of big data storage. However, NoSQL gave up on the relationship between operation support, so that part of existing application system is difficult to use the simple way of transplantation. This thesis with reference to some typical existing big data storage scheme, we presents a big data compatible with relational storage model storage scheme, this scheme can not only meet the big data storage requirements, but also can support the most relational operation, so that the original system based on relational database can easily be ported to new storage schemes in.

 
1 2
페이지 저장