Show simple item record

dc.contributor.authorGad, Samah
dc.date.accessioned2014-04-09T18:27:23Z
dc.date.available2014-04-09T18:27:23Z
dc.date.issued2014-04-09
dc.identifier.urihttp://hdl.handle.net/10919/47101
dc.description.abstractWe developed a dynamic temporal segmentation algorithm that wraps around topic modeling algorithms for the purpose of identifying change points where significant shifts in topics occur. The main task of the segmentation algorithm is to automatically partition the total time period defined by the documents in the collection such that segment boundaries indicate important periods of temporal evolution and re-organization. The algorithm moves across the data by time and evaluates two adjacent windows, assuming a given segmentation granularity (e.g., discrete days, weeks, or months). This granularity varies from one application to another and is decided by domain experts. We evaluate adjacent windows by comparing their underlying topic distributions and quantifying common terms and their probabilities. We chose to quantify common terms based on the overlap between them. The overlap can be captured using a contingency table.en_US
dc.description.sponsorshipNEH Office of Digital Humanities Digging into Data Programen_US
dc.language.isoen_USen_US
dc.titleSegmentation Algorithmen_US
dc.typeSoftwareen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record