• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.11
• /
• pp.758-764
• /
• 2018

Digital documents such as patents, scholarly papers and research reports have author keywords which summarize the topics of documents. Different documents are likely to describe the same topic if they share the same keywords. Document clustering aims at clustering documents to similar topics with an unsupervised learning method. However, it is difficult to apply to a large amount of documents event though the document clustering is utilized to in various data analysis due to computational complexity. In this case, we can cluster and connect massive documents using keywords efficiently. Existing bottom-up hierarchical clustering requires huge computation and time complexity for clustering a large number of keywords. This paper proposes an inverted index based bottom-up clustering for keywords and analyzes the results of clustering with massive keywords extracted from scholarly papers and research reports.

• Journal of the Korean Society for Library and Information Science
• /
• v.43 no.3
• /
• pp.399-416
• /
• 2009

In this study, clustering methods with related tags were discussed for improving search and exploration in the tag space. The experiments were performed on 10 Delicious tags and the strongly-related tags extracted by each 300 documents, and hierarchical and non-hierarchical clustering methods were carried out based on the tag co-occurrences. To evaluate the experimental results, cluster relevance was measured. Results showed that Ward's method with cosine coefficient, which shows good performance to term clustering, was best performed with consistent clustering tendency. Furthermore, it was analyzed that cluster membership among related tags is based on users' tagging purposes or interest and can disambiguate word sense. Therefore, tag clusters would be helpful for improving search and exploration in the tag space.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.9
• /
• pp.2061-2065
• /
• 2009

Two simple algorithm modifications are made to the THRASH data retrieval program with the aim of improving analysis speed for complex Fourier transform ion cyclotron resonance (FTICR) mass spectra. Instead of calculating the least-squares fit for every charge state in the backup charge state determination algorithm, only some charge states are pre-selected based on the plausibility values obtained from the FT/Patterson analysis. Second, a modification is made to skip figure-of-merit (FOM) calculations in the central m/z region between two neighboring peaks in isotopic cluster distributions, in which signal intensities are negligible. These combined modifications result in a significant improvement in the analysis speed, which reduces analysis time as much as 50% for ubiquitin (8.6 kDa, 76 amino acids) FTICR MS and MS/MS spectra at the reliability (RL) value = 0.90 and five pre-selected charge states with minimal decreases in data analysis quality (Table 3).

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.399-404
• /
• 2010

In this paper, we propose a method for precision improvement based on core clusters and term proximity. The method is composed by three steps. The initial retrieval documents are clustered based on query term combination, which occurred in the document. Core clusters are selected by using proximity between query terms. Then, the documents in core clusters are reranked based on context information of query. On TREC AP test collection, experimental results in precision at the top documents(P@100) show that the proposed method improved 11.2% over the language model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.294-297
• /
• 2012

본 논문에서는 컬러 영상의 검색을 위하여 영상을 색상 정보에 기반한 pixel layer (cluster)의 집합체로 모델링하고, 두 layer 간의 유사도를 각 layer 를 이루는 pixel 들의 색상 분포에 따른 공간적 분포를 이용하여 측정하는 기법을 제안한다. 먼저 pixel layering 단계에서는 HSV 색 공간에서 mean-shift clustering 알고리즘을 통해 초기 layer 들을 얻고, 비슷한 색상의 layer 들은 합쳐 영상의 soft segmentation 과 유사한 결과를 얻는다. 비교할 두 영상에서 pixel layering 을 한 후, 각 layer 를 이진화된 공간분포 지도로 형성하고 그 차이를 비교함으로써 유사도를 측정한다. 이 때, 사용하는 가중치로서 HSV 색 공간 분포의 비슷한 정도를 정의하는데, 이는 HSV 색 공간을 XYZ 의 3 차원 좌표로 설정하고, overlap 되는 pixel 수로 정의하였다. 본 논문에서 제안한 pixel layer 들 간의 색상 공간 분포에 따른 공간적 분포를 이용한 영상 검색 기법은 MPEG-7 에서 정의한 대표색상 기반의 영상 검색보다 우수한 성능을 보여주었다.

• Journal of Information Science Theory and Practice
• /
• v.8 no.2
• /
• pp.6-17
• /
• 2020

Word similarity is often measured to enhance system performance in the information retrieval field and other related areas. This paper reports on an experimental comparison of values for word similarity measures that were computed based on 50 intentionally selected words from a Reuters corpus. There were three targets, including (1) co-occurrence-based similarity measures (for which a co-occurrence frequency is counted as the number of documents or sentences), (2) context-based distributional similarity measures obtained from a latent Dirichlet allocation (LDA), nonnegative matrix factorization (NMF), and Word2Vec algorithm, and (3) similarity measures computed from the tf-idf weights of each word according to a vector space model (VSM). Here, a Pearson correlation coefficient for a pair of VSM-based similarity measures and co-occurrence-based similarity measures according to the number of documents was highest. Group-average agglomerative hierarchical clustering was also applied to similarity matrices computed by individual measures. An evaluation of the cluster sets according to an answer set revealed that VSM- and LDA-based similarity measures performed best.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.127-136
• /
• 2010

With rapid growth of information and computer communication technologies, the numbers of digital documents including multimedia data have been recently exploded. In particular, news video database and news video mining have became the subject of extensive research, to develop effective and efficient tools for manipulation and analysis of news videos, because of their information richness. However, many research focus on browsing, retrieval and summarization of news videos. Up to date, it is a relatively early state to discover and to analyse the plentiful latent semantic knowledge from news videos. In this paper, we propose the news video mining system based on multi-modal approach and text mining, which uses the visual-textual information of news video clips and their scripts. The proposed system systematically constructs a taxonomy of news video stories in automatic manner with hierarchical clustering algorithm which is one of text mining methods. Then, it multilaterally analyzes the topics of news video stories by means of time-cluster trend graph, weighted cluster growth index, and network analysis. To clarify the validity of our approach, we analyzed the news videos on "The Second Summit of South and North Korea in 2007".

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• Journal of the Korean Society for information Management
• /
• v.19 no.3
• /
• pp.5-30
• /
• 2002

In this paper, classification feature is selected with focus of musical content, note sequences pattern, and measures similarity between note sequences followed by constructing clusters by similar note sequences, which is easier for users to search by showing the similar note sequences with the search result in the CBMR system. Experimental document was $\ulcorner$A Dictionary of Musical Themes$\lrcorner$, the index of theme bar focused on classical music and obtained kern-type file. Humdrum Toolkit version 1.0 was used as note sequences treat tool. The hierarchical clustering method is by stages focused on four-type similarity matrices by whether the note sequences segmentation or not and where the starting point is. For the measurement of the result, WACS standard is used in the case of being manual classification and in the case of the note sequences starling from any point in the note sequences, there is used common feature pattern distribution in the cluster obtained from the clustering result. According to the result, clustering with segmented feature unconnected with the starting point Is higher with distinct difference compared with clustering with non-segmented feature.

• The KIPS Transactions:PartD
• /
• v.18D no.2
• /
• pp.133-142
• /
• 2011

To ensure the successful employment of semantic web services, it is essential that they rely on the use of high quality ontologies. However, building such ontologies is difficult and costly, thus hampering web service deployment. This study automatically builds ontologies from WSDL documents and their underlying semantics, and presents discovery methods of similar web service operations using these ontologies. The key ingredient is techniques that cluster parameters in the collection of web services into semantically meaningful concepts, and capture the hierarchical relationships between the words contained in the tag. We implement an operation retrieval system for web services. This system finds out a ranked set of similar operations using a novel similarity measurement method, and selects the most optimal operation which satisfies user's requirements. It can be directly used for the web services composition.