METHOD OF MAINTAINING RECENT FREQUENT PATTERN BASED ON DAMPED WINDOW AND APPROXIMATION PRUNING IN STREAM ENVIRONMENT, RECENT FREQUENT PATTERN MAINTENANCE SERVER PERFORMING THE SAME AND STORAGE MEDIUM STORING THE SAME

The present invention relates to a method for maintaining a latest frequent pattern, capable of maintaining and managing only the latest frequent item by using one tree. The method comprises the following steps: collecting transactions based on the size of a first batch; mining at least one first fr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: RYANG, HEUNG MO, LEE, GANG IN, KIM, DONG GYU, YUN, UN IL
Format: Patent
Sprache:eng ; kor
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The present invention relates to a method for maintaining a latest frequent pattern, capable of maintaining and managing only the latest frequent item by using one tree. The method comprises the following steps: collecting transactions based on the size of a first batch; mining at least one first frequent item when the transactions are collected as much as the size of the first batch, and generating a tree by using each first frequent item as a node; collecting transactions based on the size of a second batch; and mining at least one second frequent item when the transactions are collected as much as the size of the second batch, and adding the second frequent items to the tree by using each second frequent item as a node. 최신 빈발 패턴 유지 방법은 제1 배치의 크기를 기초로 트랜잭션을 수집하는 단계, 상기 트랜잭션이 상기 제1 배치의 크기만큼 수집된 경우에는 적어도 하나의 제1 빈발 항목을 마이닝하고 상기 적어도 하나의 제1 빈발 항목 각각을 노드로 하여 트리를 생성하는 단계, 제2 배치의 크기를 기초로 트랜잭션을 수집하는 단계 및 상기 트랜잭션이 상기 제2 배치의 크기만큼 수집된 경우에는 적어도 하나의 제2 빈발 항목을 마이닝하고 상기 적어도 하나의 제2 빈발 항목 각각을 노드로 하여 상기 트리에 추가하는 단계를 포함한다.