Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/8892
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSunaina-
dc.contributor.authorSowmya, Kamath S.-
dc.date.accessioned2020-03-30T10:22:58Z-
dc.date.available2020-03-30T10:22:58Z-
dc.date.issued2016-
dc.identifier.citationACM International Conference Proceeding Series, 2016, Vol.06-08-July-2016, , pp.-en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/8892-
dc.description.abstractReal time document summarization is a critical need nowadays, owing to the large volume of information available for our reading, and our inability to deal with this entirely due to limitations of time and resources. Oftentimes, information is available in multiple sources, offering multiple contexts and viewpoints on a single topic of interest. Automated multi-document summarization (MDS) techniques aim to address this problem. However, current techniques for automated MDS suffer from low precision and accuracy with reference to a given subject matter, when compared to those summaries prepared by humans and takes large time to create the summary when the input given is too huge. In this paper, we propose a hybrid MDS technique combining feature based algorithms and dynamic programming for generating a summary from multiple documents based on user provided query. Further, in real-world scenarios, Web search serves up a large number of URLs to users, and the work of making sense of these with reference to a particular query is left to the user. In this context, an efficient parallelized MDS technique based on Hadoop is also presented, for serving a concise summary of multiple Webpage contents for a given user query in reduced time duration. � 2016 ACM.en_US
dc.titleQuery-oriented unsupervised multi-document summarization on big dataen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.