Open Access Open Access  Restricted Access Subscription Access

Text Stream Mining Using Suffix Trees


Affiliations
1 RGIT, Bangalore, India
 

Information explosion has resulted in the need for more advanced methods for managing the information. Text stream mining, is very important as people and organizations are trying to process and understand as much of information as possible. Generalised suffix tree is a data structure which is capable of solving a number of text stream mining tasks like detecting changes in the text stream, identifying reuse of text and detecting events by identifying when the frequencies of phrases change in a statistically significant way. An efficient method with polynomial time complexity that uses suffix trees to analyse streams of data in an online setting is discussed.

Keywords

Data Stream, Tree, Mining, N-Grams.
User
Notifications
Font Size

Abstract Views: 136

PDF Views: 0




  • Text Stream Mining Using Suffix Trees

Abstract Views: 136  |  PDF Views: 0

Authors

Pamela Vinitha
RGIT, Bangalore, India
Kusum Rajput
RGIT, Bangalore, India
N. Veda
RGIT, Bangalore, India

Abstract


Information explosion has resulted in the need for more advanced methods for managing the information. Text stream mining, is very important as people and organizations are trying to process and understand as much of information as possible. Generalised suffix tree is a data structure which is capable of solving a number of text stream mining tasks like detecting changes in the text stream, identifying reuse of text and detecting events by identifying when the frequencies of phrases change in a statistically significant way. An efficient method with polynomial time complexity that uses suffix trees to analyse streams of data in an online setting is discussed.

Keywords


Data Stream, Tree, Mining, N-Grams.