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
{{#tags}}- {{label}}
{{/tags}}