Presentation 2006-11-10
Fast Algorithms for inclusion check in a sequence set to extract maximal sequences
Hiroki ICIHKAWA, Koji IWANUMA, Hidetomo NABESHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we give three fast algorithms for forward/backward subsumption and frequency-counting of subsequences, in order to extract maximal frequent subsequences in a very-long single data-sequence. We use Agrawal's hash-tree data structure for containing huge number of sequences, and also give a new index-table structure for memorizing occurrence positions of elements in sequences. We conducted some experiments, and confirmed the good performances of the algorithms proposed here.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) maximal sequences / hash_tree / index_table / lossy_counting
Paper # AI2006-13
Date of Issue

Conference Information
Committee AI
Conference Date 2006/11/3(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fast Algorithms for inclusion check in a sequence set to extract maximal sequences
Sub Title (in English)
Keyword(1) maximal sequences
Keyword(2) hash_tree
Keyword(3) index_table
Keyword(4) lossy_counting
1st Author's Name Hiroki ICIHKAWA
1st Author's Affiliation Interdisciplinary graduate School of Medicine arid Engineering, University of Yamanashi()
2nd Author's Name Koji IWANUMA
2nd Author's Affiliation Interdisciplinary graduate School of Medicine arid Engineering, University of Yamanashi
3rd Author's Name Hidetomo NABESHIMA
3rd Author's Affiliation Interdisciplinary graduate School of Medicine arid Engineering, University of Yamanashi
Date 2006-11-10
Paper # AI2006-13
Volume (vol) vol.106
Number (no) 340
Page pp.pp.-
#Pages 6
Date of Issue