Abstract

Linked Open Data (LOD) available on the web not only encodes heterogamous structural relationship between entities of various types but is also a source of textual information associated with these entities. Governments at various levels can benefit from this data while making certain policy decisions. The goal of this work is to provide semi-automated means to access information from open data sources that is relevant to the policy proposal in question. This paper reports investigation of the approaches for thematic analysis of policy documents, identification and summarization techniques of linked open dataset relevant to the topics of the policy documents. The key focus of the work carried out includes the identification of the functionality based on end user needs, development of a linked open data search strategy model and investigation of techniques required to realize the needed functionality specified in the model. As a background work we have identified the use of machine learning techniques to automatically determining the main themes or topics from within the policy document for generating the search terms for searching the open and linked open data repositories, investigated the use of various approaches for finding topic connectivity structure in the linked open data cloud, methodology for topic diversity based relevance ranking of datasets and summarization algorithms for generating the dataset summaries.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.