본문 바로가기
  • Home

Subgroup Discovery Method with Internal Disjunctive Expression

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2017, 22(1), pp.23-32
  • DOI : 10.9708/jksci.2017.22.01.023
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : October 11, 2016
  • Accepted : December 27, 2016
  • Published : January 31, 2017

Seyoung Kim 1 RYU, KWANG RYEL 1

1부산대학교

Accredited

ABSTRACT

We can obtain useful knowledge from data by using a subgroup discovery algorithm. Subgroup discovery is a rule model learning method that finds data subgroups containing specific information from data and expresses them in a rule form. Subgroups are meaningful as they account for a high percentage of total data and tend to differ significantly from the overall data. Subgroup is expressed with conjunction of only literals previously. So, the scope of the rules that can be derived from the learning process is limited. In this paper, we propose a method to increase expressiveness of rules through internal disjunctive representation of attribute values. Also, we analyze the characteristics of existing subgroup discovery algorithms and propose an improved algorithm that complements their defects and takes advantage of them. Experiments are conducted with the traffic accident data given from Busan metropolitan city. The results shows that performance of the proposed method is better than that of existing methods. Rule set learned by proposed method has interesting and general rules more.

Citation status

* References for papers published after 2023 are currently being built.