Bursty and Hierarchical Structure in Streams.

Add to your list(s) Download to your calendar using vCal

• Philip Sterne (University of Cambridge)
• Friday 28 August 2009, 11:00-12:00
• TCM Seminar Room, Cavendish Laboratory, Department of Physics.

If you have a question about this talk, please contact Philip Sterne.

The high-level idea is to analyze a stream of documents and find features whose behavior is `bursty’: they occur with high intensity over a limited period of time. The analysis uses a probabilistic automaton whose states correspond to the frequencies of individual words. For each word separately, one imagines a copy of the automaton generating occurrences of the word, and computes its most likely state sequence over the course of the stream. State transitions correspond to points in time around which the frequency of the word changes significantly—that is, to the beginning or end of a `burst’ in the usage of the word. The full details of all this are given in the paper here (also have a look at some of the results )

This talk is part of the Machine Learning Journal Club series.

This talk is included in these lists:

• Cambridge talks
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Journal Clubs
• Inference Group Summary
• Interested Talks
• ML
• Machine Learning Journal Club
• Machine Learning Summary
• Quantum Matter Journal Club
• TCM Seminar Room, Cavendish Laboratory, Department of Physics
• TQS Journal Clubs
• rp587
• yk373's list

Note that ex-directory lists are not shown.