• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2012

In this paper, we propose a document summarization method using the pseudo relevance feedback and the term weighting based on semantic features. The proposed method can minimize the user intervention to use the pseudo relevance feedback. It also can improve the quality of document summaries because the inherent semantic of the sentence set are well reflected by term weighting derived from semantic feature. In addition, it uses the semantic feature of term weighting and the expanded query to reduce the semantic gap between the user's requirement and the result of proposed method. The experimental results demonstrate that the proposed method achieves better performant than other methods without term weighting.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.255-264
• /
• 2008

This paper proposes a novel method using K-means and Non-negative matrix factorization (NMF) for topic -based multi-document summarization. NMF decomposes weighted term by sentence matrix into two sparse non-negative matrices: semantic feature matrix and semantic variable matrix. Obtained semantic features are comprehensible intuitively. Weighted similarity between topic and semantic features can prevent meaningless sentences that are similar to a topic from being selected. K-means clustering removes noises from sentences so that biased semantics of documents are not reflected to summaries. Besides, coherence of document summaries can be enhanced by arranging selected sentences in the order of their ranks. The experimental results show that the proposed method achieves better performance than other methods.

• Information and Communications Magazine
• /
• v.13 no.5
• /
• pp.102-108
• /
• 1996

• Journal of the KSME
• /
• v.29 no.4
• /
• pp.394-402
• /
• 1989

열전달 분야 중에서도 대류열전달에 관련된 수치해석적 연구가 현재 국제적으로 많은 연구의 대상이 되고 있으므로 이번 기회에 국내에서 수치적 방법을 이용한 대류열전달 분야의 연구동 향을 간략히 기술하고자 한다. 대류열전달 분야를 소분류하는 방법에는 여러 가지가 있겠으나 이번 조사에서는 "자연대류 열전달", "강제대류 열전달" 그리고 "상변화 열전달"의 세 가지로 분 류하였으며 위의 분류에 명확히 속하지 않는 것이라고 유사성을 참고하여 분류하였다. 상기 각 분야에서의 기술 순서는 대략적으로 발표년도 순서를 따랐다. 본 연구동향의 조사에서는 국내 학술 문헌중 "대한기계학회논문집"을 중심으로 하여 이외에 관련된 학술지로서 "공기조화. 냉동 공학", "태양에너지"등에 수록된 논문을 발췌 요약하였다.uot;공기조화. 냉동 공학", "태양에너지"등에 수록된 논문을 발췌 요약하였다.된 논문을 발췌 요약하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.923-932
• /
• 1997

In this paper, we propose a two-level hybrid signature file method(THM) to dffciently deal with large txt databases that use a term discrimination concept.In addition, we apply Yoo's clustering scheme to the two-level hybeid signature file method. The clustering schme groups similar signatures together according to the similarity of the highly discriminatiory tems so that we may achive better performance on retrival. The space-time ana-lyhtical model of the proposed two-level hybrid method is provided. Based on the analytical model and experiments, we compare it with the exsting methods, i.e. the bit-sliced method(BM), the-level method(TM), and the hybrid method(HM). As a result, we show that THM achives the best retrival performance in a large database with 100,000 records when the mumber fo matching records is less than 160.

• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.357-365
• /
• 2010

Personalized web search engine provides personalized results to users by query expansion, re-ranking or other methods representing user's intention. The personalized result page includes URL, page title and small text fragment of each web document. which is known as snippet. The snippet is the summary of the document which includes the keywords issued by either user or search engine itself. Users can verify the relevancy of the whole document using only the snippet, easily. The document summary (snippet) is an important information which makes users determine whether or not to click the link to the whole document. Hence, if a search engine generates personalized document summaries, it can provide a more satisfactory search results to users. In this paper, we propose a personalized document summary system for personalized web search engines. The proposed system provides increased degree of satisfaction to users with marginal overhead.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.710-718
• /
• 2017

As graphs are becoming increasingly large, the costs for storing and managing data are increasing continuously. Shortest path discovery over a large graph requires long running time due to frequent disk I/Os and high complexity of the graph data. Recently, graph summarization techniques have been studied, which reduce the size of graph data and disk I/Os by representing highly dense subgraphs as a single super-node. Decompressing should be minimized for efficient shortest path discovery over the summarized graph. In this paper, we analyze the decompression performance of a summarized graph and propose an approximate technique that discovers the shortest path quickly with a minimum error ratio. We also propose an exact technique that efficiently discovered the shortest path by exploiting an index built on paths containing super-nodes. In our experiments, we showed that the proposed technique based on the summarized graph can reduce the running time by up to 70% compared with the existing techniques performed on the original graph.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2607-2613
• /
• 2012

The results of inherent knowledge based generic summarization are influenced by the composition of sentence in document set. In order to resolve the problem, this papser propses a new generic document summarization which uses clustering of semantic feature of document and coherence of document cluster. The proposed method clusters sentences using semantic feature deriving from NMF(non-negative matrix factorization), which it can classify document topic group because inherent structure of document are well represented by the sentence cluster. In addition, the method can improve the quality of summarization because the importance sentences are extracted by using coherence of sentence cluster and the cluster refinement by re-cluster. The experimental results demonstrate appling the proposed method to generic summarization achieves better performance than generic document summarization methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.741-747
• /
• 2010

These days many meeting minutes of various organizations are publicly available and the interest in these documents by people is increasing. However, it is time-consuming and tedious to read and understand whole documents even if the documents can be accessed easily. In addition, what most people want from meeting minutes is to catch the main issues of the meeting and understand its contexts rather than to know whole discussions of the meetings. This paper proposes a novel method for summarizing documents considering the characteristics of the meeting minutes. It first extracts the sentences which are addressing the main issues. For each issues expressed in the extracted sentences, the sentences related with the issue are then extracted in the next step. Then, by transforming the extracted sentences into a tree-structure form, the results of the proposed method can be understood better than existing methods. In the experiments, the proposed method shows remarkable improvement in performance and this result implies that the proposed method is plausible for summarizing meeting minutes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.656-662
• /
• 2012

In this paper, we describe a new summarizing method based on a graph-based and a sense-based analysis. In the graph-based analysis, we convert sentences in a document into word vectors and calculate the similarity between each sentence using LSA. We reflect this similarity of sentences and the rarity scores of words in sentences to define weights of edges in the graph. Meanwhile, in the sense-based analysis, in order to determine the sense of words, subjectivity or objectivity, we built a database which is extended from the golden standards using Wordnet. We calculate the subjectivity of sentences from the sense of words, and select more subjective sentences. Lastly, we combine the results of these two methods. We evaluate the performance of the proposed method using classification games, which are usually used to measure the performances of summarization methods. We compare our method with the MS-Word auto-summarization, and verify the effectiveness of ours.