Fast Frequent String Mining Using Suffix Arrays

I
ICDM
2005
Fifth IEEE International Conference on Data Mining (ICDM'05)
Abstract - Fast Frequent String Mining Using Suffix Arrays

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Johannes Fischer Articles by Volker Heun Articles by Stefan Kramer

Fifth IEEE International Conference on Data Mining (ICDM'05)

Houston, Texas

November 27-November 30

ISBN: 0-7695-2278-5

	ASCII Text	x
	Johannes Fischer, Volker Heun, Stefan Kramer, "Fast Frequent String Mining Using Suffix Arrays," Data Mining, IEEE International Conference on, pp. 609-612, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005.

	BibTex	x
	@article{ 10.1109/ICDM.2005.62, author = {Johannes Fischer and Volker Heun and Stefan Kramer}, title = {Fast Frequent String Mining Using Suffix Arrays}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2005}, issn = {1550-4786}, pages = {609-612}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.62}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Fast Frequent String Mining Using Suffix Arrays SN - 1550-4786 SP609 EP612 A1 - Johannes Fischer, A1 - Volker Heun, A1 - Stefan Kramer, PY - 2005 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Johannes Fischer, Universität München

Volker Heun, Universität München

Stefan Kramer, TU München

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.62

We present a method to mine strings that are frequent in one database and infrequent in another. The method uses suffix- and lcp-arrays that can be computed extremely fast and space efficiently, and further exhibit a good locality behavior. Experiments with several biologically relevant data sets show that our approach outperforms existing methods in terms of time and space.

Citation:

Johannes Fischer, Volker Heun, Stefan Kramer, "Fast Frequent String Mining Using Suffix Arrays," icdm, pp.609-612, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.