<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Qom</PublisherName>
				<JournalTitle>Journal of Engineering Management and Soft Computing</JournalTitle>
				<Issn>3116-0158</Issn>
				<Volume>6</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>09</Month>
					<Day>22</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Proposed Method for Note Detection and Automatic Identification of the Melody Models (Gusheh) in Iranian Traditional Music with Micro Approach</ArticleTitle>
<VernacularTitle>-روش پیشنهادی برای شناسایی خودکار گوشه‌ها در ردیف موسیقی سنتی ایرانی با رویکرد میکرو</VernacularTitle>
			<FirstPage>113</FirstPage>
			<LastPage>138</LastPage>
			<ELocationID EIdType="pii">1268</ELocationID>
			
<ELocationID EIdType="doi">10.22091/jemsc.2018.1268</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Amir</FirstName>
					<LastName>Vafaeian</LastName>
<Affiliation>Knowledge and Information Studies, Kharazmi University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Keivan</FirstName>
					<LastName>Borna</LastName>
<Affiliation>Assistant Prof., Computer Sciences, Faculty of Mathematical Sciences and Computer, Kharazmi University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hamed</FirstName>
					<LastName>Sajedi</LastName>
<Affiliation>Assistant Prof., Electronic Engineering, Faculty of Engineering, Shahed University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Dariush</FirstName>
					<LastName>Alimohammadi</LastName>
<Affiliation>Assistant Prof., Knowledge and Information Studies, Faculty of Psychology and Education, Kharazmi University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Pouya</FirstName>
					<LastName>Sarai</LastName>
<Affiliation>5.	Assistant Prof., Music Department, Faculty of Art, Islamic Azad University Central Tehran Branch, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>03</Month>
					<Day>15</Day>
				</PubDate>
			</History>
		<Abstract>One of the most common problems with computer networks is the amount of information in these networks. Meanwhile searching and getting inform about content of textual document, as the most widespread forms of information on such networks, is difficult and sometimes impossible. The goal of multi-document textual summarization is to produce a pre-defined length summary from input textual documents while maximizing documents’ content coverage. This paper presents a new approach for textual document summarization based on paraphrasing and textual entailment relations and formulating the problem as an optimization problem. In this approach the sentences of input documents are clustered according to paraphrasing relation and then the entailment score and final score of a fraction of the header sentences of clusters which have the best score according to the user query is calculated. Finally, the optimization problem is solved via greedy and dynamic programming approaches and while selecting the best sentences, the final summary is generated. The results of implementing the proposed system on standard datasets and evaluation via ROUGE system show that the proposed system outperforms the state-of-the-art systems at least by 2.5% in average.</Abstract>
<ArchiveCopySource DocType="pdf">https://jemsc.qom.ac.ir/article_1268_9ef849dfdbd07c11a6361504799c29e2.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
