Material Detail

Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts

Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts

This video was recorded at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Bled 2009. We consider mining unusual patterns from text T. Unlike existing methods which assume probabilistic models and use simple estimation methods, we employ a set B of background text in addition to T and compositions w=xy of x and y as patterns. A string w is peculiar if there exist x and y such that w=xy, each of x and y is more frequent in B than in T, and conversely w=xy is more frequent in T. The frequency of xy in T is very small since x and y are infrequent in T, but xy is relatively abundant in T compared to xy in B. Despite these complex conditions for peculiar compositions, we develop a fast algorithm to find peculiar compositions... Show More

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts
Other materials like Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.
hidden