Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • ICADL 2018 Poster Proceedings
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • ICADL 2018 Poster Proceedings
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Mining algorithmic complexity in full-text scholarly documents

      Bakar, Abu; Safder, Iqra; Hassan, Saeed-Ul
      Thumbnail
      Files
      ICADL2018_paper_66.pdf
      84.63Kb
      DOI
       10.15663/ICADL.2018.66
      Find in your library  
      Citation
      Export citation
      Bakar, A., Safder, I., & Hassan, S.-U. (2018). Mining algorithmic complexity in full-text scholarly documents. In ICADL Poster Proceedings. Hamilton, New Zealand: The University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/12181
      Abstract
      Non-textual document elements (NTDE) like charts, diagrams, algorithms play an important role to present key information in scientific documents [1]. Recent advancements in information retrieval systems tap this information to answer more complex queries by mining text pertaining to non-textual document elements. However, linking between document elements and corresponding text can be non-trivial. For instance, linking text related to algorithmic complexity with consequent root algorithm could be challenging. These elements are sometime placed at the start or at the end of the page instead of following the flow of document text, and the discussion about these elements may or may not be on the same page. In recent years, quite a few attempts have been made to extract NTDE [2-3]. These techniques are actively applied for effective document summarization, to improve the existing IR systems. Generally, asymptotic notations are used to identify the complexity lines in full text. We mine the relevant complexities of algorithms from full text by comparing the metadata of algorithm with context of paragraph in which complexity related discussion is made by authors. In this paper, we presented a mechanism for identification of algorithmic complexity lines using regular expressions, algorithmic metadata compilation of algorithms, and linking complexity related textual lines to algorithmic metadata.
      Date
      2018
      Type
      Conference Contribution
      Publisher
      The University of Waikato
      Rights
      © 2018 copyright with the authors.
      Collections
      • ICADL 2018 Poster Proceedings [8]
      Show full item record  

      Usage

      Downloads, last 12 months
      85
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement