Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/74752
Title: Read all about it! : a research support tool for automatically finding relevant prior and related work and sequencing it for reading
Authors: Ellul, Luke (2019)
Keywords: Data mining
Web usage mining
Internet searching
Issue Date: 2019
Citation: Ellul, L. (2019). Read all about it!: a research support tool for automatically finding relevant prior and related work and sequencing it for reading (Bachelor's dissertation).
Abstract: This dissertation describes a research tool that automatically finds prior work associated with a research paper. A paper is inputted into the tool and by iterating through the references, the tool builds a dependency graph of papers and determines a progression in which they should be read. This ensures that subjects introduced in later papers but explained in earlier papers are understood by the user. The PageRank algorithm, along with the Katz Distance, vector-space models and other algorithms will rank each papers’ importance. Less important papers can be omitted from the timeline and a visualization will indicate to the user which papers are more important than others. Since no Gold Standard is available, this project is a proof of concept. However, an evaluation was conducted using a Silver Standard, where multiple dependency graphs of virtual papers were used as testing mediums for this project. The aim of this project is to make studying easier and more fun for academics. The research tool uses Google Scholar as its primary digital library, therefore, it has the potential to help many academics studying a wide variety of subjects.
Description: B.SC.ICT(HONS)ARTIFICIAL INTELLIGENCE
URI: https://www.um.edu.mt/library/oar/handle/123456789/74752
Appears in Collections:Dissertations - FacICT - 2019
Dissertations - FacICTAI - 2019

Files in This Item:
File Description SizeFormat 
Ellul Luke.pdf
  Restricted Access
1.73 MBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.