• Title/Summary/Keyword: 헬링거 함수

Search Result 3, Processing Time 0.02 seconds

Signed Hellinger measure for directional association (연관성 방향을 고려한 부호 헬링거 측도의 제안)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.2
    • /
    • pp.353-362
    • /
    • 2016
  • By Wikipedia, data mining is the process of discovering patterns in a big data set involving methods at the intersection of association rule, decision tree, clustering, artificial intelligence, machine learning. and database systems. Association rule is a method for discovering interesting relations between items in large transactions by interestingness measures. Association rule interestingness measures play a major role within a knowledge discovery process in databases, and have been developed by many researchers. Among them, the Hellinger measure is a good association threshold considering the information content and the generality of a rule. But it has the drawback that it can not determine the direction of the association. In this paper we proposed a signed Hellinger measure to be able to interpret operationally, and we checked three conditions of association threshold. Furthermore, we investigated some aspects through a few examples. The results showed that the signed Hellinger measure was better than the Hellinger measure because the signed one was able to estimate the right direction of association.

An Information-Theoretic Method for Sequential Pattern Analysis (정보이론을 이용한 연속패턴생성방법)

  • 이창환;이소민
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10b
    • /
    • pp.124-126
    • /
    • 2001
  • 시차를 두고 발생한 사건속에서 잠재해있는 패턴을 발견하는 연속패턴(sequential pattern) 생성기술은 데이터 마이닝 분야에서 최근 관심을 모으고 있는 분야이다. 본 연구는 정보이론을 이용하여 데이터베이스로부터 연속패턴을 자동으로 발견하는 방법에 관한 내용이다. 본 연구에서 제시하는 방법은 기존의 방법과는 달리 테이블내의 모든 속성간의 연속패턴 관계를 탐지할 수 있으며 헬링거(Hellinger) 변량을 이용하여 발견된 연속패턴들의 중요도를 측정할 수 있다. 또한 헬링거 변량의 함수적인 특성을 분석하여 연속패턴 추출의 복잡도를 줄이기 위한 두 가지의 법칙이 제안되었다.

  • PDF

Learning Multidimensional Sequential Patterns Using Hellinger Entropy Function (Hellinger 엔트로피를 이용한 다차원 연속패턴의 생성방법)

  • Lee, Chang-Hwan
    • The KIPS Transactions:PartB
    • /
    • v.11B no.4
    • /
    • pp.477-484
    • /
    • 2004
  • The technique of sequential pattern mining means generating a set of inter-transaction patterns residing in time-dependent data. This paper proposes a new method for generating sequential patterns with the use of Hellinger measure. While the current methods are generating single dimensional sequential patterns within a single attribute, the proposed method is able to detect multi-dimensional patterns among different attributes. A number of heuristics, based on the characteristics of Hellinger measure, are proposed to reduce the computational complexity of the sequential pattern systems. Some experimental results are presented.