Presentation 2003/7/10
Finding Repetitive Patterns Using FET
Tetsuya NAKATOH, Sachio HIROKAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Data-Mining or Text-Mining, that is technique to extract non-obvious information from semi-structured texts, has been very important technologies when we handle expanding information in WWW. One of them is to discover patterns that appear in the data repetitively. Using the patterns, we can process the data and can extract from the data. To discover them, we can think about the naive method, i.e. the method of aligning data with that own shifted copy data, and compare them. However, when the size of the text is n, time complexity of this method becomes O(n^2), and it isn't efficient for big data. In this paper, we propose the technique to reduce time complexity of the method to O(n log n) using our string matching algorithm with mismatches.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Finding Repetitive Patterns / Mining / Semi-structured Text / String Matching with Mismatches / Search Engine / FET
Paper # DE2003-48
Date of Issue

Conference Information
Committee DE
Conference Date 2003/7/10(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 Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finding Repetitive Patterns Using FET
Sub Title (in English)
Keyword(1) Finding Repetitive Patterns
Keyword(2) Mining
Keyword(3) Semi-structured Text
Keyword(4) String Matching with Mismatches
Keyword(5) Search Engine
Keyword(6) FET
1st Author's Name Tetsuya NAKATOH
1st Author's Affiliation Computing and Communications Center, Kyushu University()
2nd Author's Name Sachio HIROKAWA
2nd Author's Affiliation Computing and Communications Center, Kyushu University
Date 2003/7/10
Paper # DE2003-48
Volume (vol) vol.103
Number (no) 191
Page pp.pp.-
#Pages 6
Date of Issue