FREQT: An implementation of FREQT
FREQT: An implementation of FREQT (FREQuent Tree miner) $Id: index.html,v 1.1 2003/09/07 10:10:02 taku-ku Exp $; Introduction The algorithm FREQT (FREQuent Tree miner), independently introduced by Asai[1] and Zaki[2], efficiently extracts frequent ordered-sub-trees from a set of ordered-trees (forest database). Frequent means that a sub-tree occurs in no less than N trees, where N is a user given
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
CSDL | IEEE Computer Society
CiteSeerX
CSDL | IEEE Computer Society
