Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01sn00b109c
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Narayanan, Arvind | - |
dc.contributor.author | Zhao, Alexander | - |
dc.date.accessioned | 2015-06-26T18:19:01Z | - |
dc.date.available | 2015-06-26T18:19:01Z | - |
dc.date.created | 2015-04-30 | - |
dc.date.issued | 2015-06-26 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01sn00b109c | - |
dc.description.abstract | Keeping up with research and staying at the forefront of one's field is both a crucial and difficult task for researchers. This thesis describes a tool designed to tackle this problem by aggregating and classifying research blogs, which are often more accessible to both readers and writers than formal papers. We build a corpus of over 10,000 research blogs by crawling through blogroll links. To identify communities of related blogs, we explore methods such as clustering algorithms, topic modeling, and network analysis. Ultimately, we group blogs into communities using modularity maximization on a network augmented by semantic similarity scores. Finally, we propose a ranking system for identifying authorities within communities. Comparing the communities identified by this tool with an existing blog aggregator reveals great similarities and demonstrates the potential of this tool for use on a large collection of research blogs. | en_US |
dc.format.extent | 53 pages | en_US |
dc.language.iso | en_US | en_US |
dc.title | Aggregating, Classifying, and Ranking Research Blogs | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2015 | en_US |
pu.department | Computer Science | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
Appears in Collections: | Computer Science, 1988-2020 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
PUTheses2015-Zhao_Alexander.pdf | 2.16 MB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.