Presentation 2013/10/30
An Algorithm for Finding Frequently Appearing Long String Patterns from Large Scale Databases
Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a new algorithm for solving frequent string mining problem with allowing approximate matches. The algorithm first computes the similarity between the strings in the database, and enumerate clusters generated by similarity. We then compute representative strings for each cluster, and the representatives are our frequent strings. Further, by taking majority votes, we extend the obtained representatives to obtain long frequent strings. The computational experiments we performed show the efficiency of both our model and algorithm; we were able to find many string patterns appearing many times in the data, and that were long but not particularly numerous. The computation time of our method is practically short, such as 20 minutes even for a genomic sequence of 100 millions of letters.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # Vol.2013-AL-145 No.2
Date of Issue

Conference Information
Committee CAS
Conference Date 2013/10/30(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 Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Algorithm for Finding Frequently Appearing Long String Patterns from Large Scale Databases
Sub Title (in English)
Keyword(1)
1st Author's Name Takeaki Uno
1st Author's Affiliation National Institute of Informatics()
2nd Author's Name Juzoh Umemori
2nd Author's Affiliation Fujita Health University
3rd Author's Name Tsuyoshi Koide
3rd Author's Affiliation National Institute of Genetics
Date 2013/10/30
Paper # Vol.2013-AL-145 No.2
Volume (vol) vol.113
Number (no) 278
Page pp.pp.-
#Pages 8
Date of Issue