On-Line New Event Detection Using Minimal New Sets

dc.contributor.authorGudjonsson, Örn
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T14:27:22Z
dc.date.available2019-07-03T14:27:22Z
dc.date.issued2016
dc.description.abstractOn-line New Event Detection can be used to monitor multiple news streams and determine when a new newsworthy event that might warrant further attention occurs, thus helping the user not to miss important information while helping him sift through the vast amount of information available. In this thesis we explore a novel approach for On-line New Event Detection based on computing minimal new sets of small sizes from new stream documents with regard to previously seen documents. We present an algorithm that outputs sets of words likely to be indicative of new events which users easily can browse through and detail several different approaches to select the sets most likely to be informative of new events. In addition we examine the practicality of our approaches and compare them to the most prominent current techniques.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/248911
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleOn-Line New Event Detection Using Minimal New Sets
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Hämtar...
Bild (thumbnail)
Namn:
248911.pdf
Storlek:
514.43 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext