{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/3759"},"canonical_url":"https://search.dev.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/3759","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Semi-extractive multi-document summarization","abstract":"In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary.","abstract_html":"In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary.","abstract_has_math":false,"creators":["Ghiyafeh Davoodi, Fatemeh","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Chali, Yllias"],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-08-21T16:45:58Z","subjects":["greedy algorithm","knapsack","maximum coverage","multi-document","summarization"],"languages":["en_CA"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/3759"],"render_values":[{"text":"hdl:10133/3759","href":null,"code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/10133/3759","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F3759","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Chali, Yllias"]},{"key":"dc:creator","label":"Author","values":["Ghiyafeh Davoodi, Fatemeh","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-10-02T20:21:39Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-10-02T20:21:39Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["greedy algorithm","knapsack","maximum coverage","multi-document","summarization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/3759"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/3759"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary."]},{"key":"dc:description.other","label":"Dc Description Other","values":["In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary."]},{"key":"dc:title","label":"Title","values":["Semi-extractive multi-document summarization"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Chali, Yllias"],"dc:creator":["Ghiyafeh Davoodi, Fatemeh","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2015-10-02T20:21:39Z"],"dc:date.available":["2015-10-02T20:21:39Z"],"dc:date.issued":["2015"],"dc:description.abstract":["In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary."],"dc:description.other":["In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to detect important sentences including Coverage, rewards sentences in regards to their representative level of the whole document, Relevance, focuses to select sentences that related to the given query, and Compression, rewards concise sentences. To generate a summary, I apply an efficient and scalable greedy algorithm. The algorithm has a near optimal solution when its scoring functions are monotone non-decreasing and submodular. I use DUC 2007 dataset to evaluate our proposed method. Investigating the results using ROUGE package shows improvement over two closely related works. The experimental results illustrates that integrating compression in the MCKP-based model, applying semantic similarity measures to detect Relevance measure and also defining all scoring functions as a monotone submodular function result in having a better performance in generating a summary."],"dc:identifier":["hdl:10133/3759"],"dc:identifier.uri":["https://hdl.handle.net/10133/3759"],"dc:language.iso":["en_CA"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:subject":["greedy algorithm","knapsack","maximum coverage","multi-document","summarization"],"dc:title":["Semi-extractive multi-document summarization"],"dc:type":["Thesis"]},"updated_at":"2026-08-21T16:45:58Z"}