• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.919-927
• /
• 2010

Since the performance of mobile devices is recently improved, the requirement of information retrieval is increased in the mobile devices as well as PCs. If a mobile device with small memory uses a tradition language analysis tool to extract nouns from korean texts, it will impose a burden of analysing language. As a result, the need for the language analysis tools adequate to the mobile devices is increasing. Therefore, this paper proposes a new method for noun extraction using post-noun morpheme sequences and noun patterns from a large corpus. The proposed noun extractor has only the dictionary capacity of 146KB and its performance shows 0.86 $F_1$-measure; the capacity of noun dictionary corresponds to only the 4% capacity of the existing noun extractor with a POS tagger. In addition, it easily extract nouns for unknown word because its dependence for noun dictionaries is low.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2006

In document clustering methods, the k-means algorithm and the Hierarchical Alglomerative Clustering(HAC) are often used. The k-means algorithm has the advantage of a processing time and HAC has also the advantage of a precision of classification. But both methods have mutual drawbacks, a slow processing time and a low quality of classification for the k-means algorithm and the HAC, respectively. Also both methods have the serious problem which is to compute a document similarity whenever new document is inserted into a cluster. A main property of web resource is to accumulate an information by adding new documents frequently. Therefore, we propose a new method of transitive closure tree based on the HAC method which can improve a processing time for a document clustering, and also propose a superior incremental clustering method for an insertion of a new document and a deletion of a document contained in a cluster. The proposed method is compared with those existing algorithms on the basis of a pre챠sion, a recall, a F-Measure, and a processing time and we present the experimental results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2380-2388
• /
• 2015

A hardware implementation of MOD(moving object detection) algorithm using EGML(effective Gaussian mixture learning)- based background subtraction to detect moving objects in video is described. Some approximations of EGML calculations are applied to reduce hardware complexity, and pipelining technique is adopted to improve operating speed. The MOD processor designed in Verilog-HDL has been verified by FPGA-in-the-loop verification using MATLAB/Simulink. The MOD processor has 2,218 slices on the Virtex5-XC5VSX95T FPGA device and its throughput is 102 MSamples/s at 102 MHz clock frequency. Evaluation results of the MOD processor for 12 images in the IEEE CDW-2012 dataset show that the average recall value is 0.7631, the average precision value is 0.7778 and the average F-measure value is 0.7535.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.229-236
• /
• 2003

Named entity recognition is the process indispensable to question answering and information extraction systems. This paper presents an HMM based named entity (m) recognition method using the construction principles of compound words. In Korean, many named entities can be decomposed into more than one word. Moreover, there are contextual relationships among nouns in an NE, and among an NE and its surrounding words. In this paper, we classify words into a word as an NE in itself, a word in an NE, and/or a word adjacent to an n, and train an HMM based on NE-related word types and parts of speech. Proposed named entity recognition (NER) system uses trigram model of HMM for considering variable length of NEs. However, the trigram model of HMM has a serious data sparseness problem. In order to solve the problem, we use multi-level back-offs. Experimental results show that our NER system can achieve an F-measure of 87.6% in the economic articles.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.62-69
• /
• 2009

The purpose of document summarization is to provide easy and quick understanding of documents by extracting summarized information from the documents produced by various application programs. In this paper, we propose a document summarization method that creates and analyzes a connection graph representing the similarity of keyword lists of sentences in a document taking into account the mean length(the number of keywords) of sentences of the document. We implemented a system that automatically generate a summary from a document using the proposed method. To evaluate the performance of the method, we used a set of 20 documents associated with their correct summaries and measured the precision, the recall and the F-measure. The experiment results show that the proposed method is more efficient compared with the existing methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.313-318
• /
• 2016

The recommendation service is changing from client-server based internet service to social networking. Especially in recent years, it is serving recommendations with personalization to users through crowdsourcing and social networking. The social networking based systems can be classified depending on methods of providing recommendation services and purposes by using memory and model based collaborative filtering. In this study, we proposed the social network based sensibility design recommendation using associative user. The proposed method makes {user - associative design} matrix through the social network and recommends sensibility design using the memory based collaborative filtering. For the performance evaluation of the proposed method, recall and precision verification are conducted. F-measure based on recommendation of social networking is used for the verification of accuracy.

• Annual Conference on Human and Language Technology
• /
• 2004.10d
• /
• pp.53-61
• /
• 2004

일반적으로 중국어의 명사구는 기본명사구(base noun phrase), 최장명사구(maximal noun phrase) 등으로 분류된다. 최장명사구에 대한 정확한 식별은 문장의 전체적인 구조를 파악하고 정확한 구문 트리(parse tree)를 찾아내는데 중요한 역할을 한다. 본 논문은 두 단계 학습모델을 이용하여 최장명사구 자동식별을 진행한다. 먼저 기본명사구, 기본동사구, 기본형용사구, 기본부사구, 기본수량사구, 기본단문구, 기본전치사구, 기본방향사구 등 8가지 기본구를 식별한다. 다음 기본구의 중심어(head)를 추출해 내고 이 정보를 이용하여 최장명사구의 식별을 진행한다. 본 논문에서 제안하는 방법은 기존의 단어레벨의 접근방법과는 달리구레벨에서 학습을 진행하기 때문에 주변문맥의 정보를 많이 고려해야 하는 최장명사구 식별에 있어서 아주 효과적인 접근방법이다. 후처리 작업을 하지 않고 기본구의 식별에서 25개 기본구 태그의 평균 F-measure가 96%, 평균길이가 7인 최장명사구의 식별에서 4개 태그의 평균 F-measure가 92.5%로 좋은 성능을 보여주었다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2013

In this paper, we propose a hybrid music recommendation system combining users' listening habits and tag information in a social music site. Most of commercial music recommendation systems recommend music items based on the number of plays and explicit ratings of a song. However, the approach has some difficulties in recommending new items with only a few ratings or recommending items to new users with little information. To resolve the problem, we use tag information which is generated by collaborative tagging. According to the meaning of tags, a weighted value is assigned as the score of a tag of an music item. By combining the score of tags and the number of plays, user profiles are created and collaborative filtering algorithm is executed. For performance evaluation, precision, recall, and F-measure are calculated using the listening habit-based recommendation, the tag score-based recommendation, and the hybrid recommendation, respectively. Our experiments show that the hybrid recommendation system outperforms the other two approaches.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.4
• /
• pp.301-319
• /
• 2017

The task of author name disambiguation involves identifying an author with different names or different authors with the same name. The author name disambiguation is important for correctly assessing authors' research achievements and finding experts in given areas as well as for the effective operation of scholarly information services such as citation indexes. In the study, we performed error correction and normalization of data and applied rules-based author name disambiguation to compare with baseline machine learning disambiguation in order to see if human intervention could improve the machine learning performance. The improvement of over 0.1 in F-measure by the corrected and normalized email-based author name disambiguation over machine learning demonstrates the potential of human pattern identification and inference, which enabled data correction and normalization process as well as the formation of the rule-based diambiguation, to complement the machine learning's weaknesses to improve the author name disambiguation results.