期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：1
页码：295-296
语种：English
出版社：Ayushmaan Technologies
摘要：Large amount of information is available on internet. The information available on internet is in unstructured manner, retrieving relevant documents containing the required information is difficult. Due to huge amount of data, query-specific document summarization has become an important problem. It is difficult task for the user to go through all these documents, as the number of documents available on particular topic will be more. It will be helpful for the user if query specific document summery is generated. Comparing different clustering algorithms those provide better result for summarization. Based on this we provide input as one query and get all the documents related to that and on these document different clustering algorithm are used to get results of each Algorithm. Then comparing each result with each other in terms of speed, memory, and quality of summary. After comparison we can decide which algorithm is better for summarization. So it will help to find the better query dependent clustering algorithm for text document summarization.
