• Title/Summary/Keyword: 검색키워드

Search Result 1,014, Processing Time 0.1 seconds

A Study on Structuring Method of Study Data Supporting Efficient Keyword Search (효율적인 키워드 검색을 지원하는 학습자료의 구조화 방법 연구)

  • Kim, Eun-Kyung;Choi, Jin-Oh
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.1063-1066
    • /
    • 2005
  • Most reading systems that supply various study data generally support keyword search. But the usual keyword matching techniques have a problem to require the exact keyword matching, and could not find similar field materials. Futhermore, testing materials have too little information to apply the keyword matching search. To solve these problems, this thesis proposes the method to extract the important keyword from study data and to construct the database automatically when the data are stored at the storage. And using prepared similar terminology database, we suggest the intelligent and efficient technique to find study materials.

  • PDF

An Efficient Index Structure for Semantic-based XML Keyword Search (의미 기반의 XML키워드 검색을 위한 효율적인 인덱스 구조)

  • Lee, Hyung-Dong;Kim, Sung-Jin;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.33 no.5
    • /
    • pp.513-525
    • /
    • 2006
  • Search results of XML keyword search are defined generally as the most specific elements containing all query keywords in the literature. The labels of XML elements and semantic information such as ontology, conceptual model, thesaurus, and so on, are used to improve the preciseness of the search results. This paper presents a hierarchical index for an efficient XML keyword query processing on the condition that returnable search concepts are defined and users' query concepts can be interpreted with the help of the semantic information. The hierarchical index separately stores the XML elements containing a keyword on the basis of the hierarchical relations of the concepts that the XML elements belong to, and makes it possible to obtain least common ancestors, which are candidates for the search results, with selectively reading the elements belonging to the concepts relevant to query concepts and without considering all the combinations of the elements having been read. This paper deals with how to organize the hierarchical index and how to process XML keyword queries with the index. In our experiment with the DBLP XML document and the XML documents in the INEX2003 test set, the hierarchical index worked well.

A Study on Semantic Annotation System for Multimedia File (멀티미디어 파일에 대한 시맨틱 어노테이션에 관한 연구)

  • Hwang, In-Moon;Yoo, Nam-Hyun;Song, Gil-Jong;Kim, Won-Jung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.301-305
    • /
    • 2007
  • 기존의 멀티미디어 자료들을 직접 분석하여 메타데이터를 부여하던 기존 연구들은 멀티미디어 파일에 부여된 키워드에 해당하는 온톨로지가 존재하지 않는 경우 해당 멀티미디어 파일에 대한 직접 검색을 실시하지 않거나, 잘못된 의미가 부여된 키워드에 의하여 검색 결과의 정확성과 재현율이 떨어지는 문제점을 가지고 있었다. 본 논문에서 제안한 SASM은 키워드에 부여된 다의성과 동의성의 개념을 이용하여 WordNet을 이용하여 확장한 후, 확장된 키워드들을 이용하여 온톨로지가 구축되어 있지 않더라도 해당 이미지에 대한 직접 분석을 실시할 수 있으며, 키워드에 대한 동의성과 다의성을 이용한 확장된 키워드들을 이용함으로써 검색 결과의 재현율과 정확성의 성능을 향상시켰다.

  • PDF

A Implementation of Keyword Extraction Algorithm Using Anchor Text for Web's Conceptual Knowledge (웹의 개념지식을 위한 Anchor Text에서의 키워드 추출 알고리즘의 구현)

  • 조남덕;배환국;김기태
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10b
    • /
    • pp.72-74
    • /
    • 2000
  • 인터넷을 효과적으로 검색하기 위하여 검색엔진을 많이 이용하고 있다. 그런데 문서의 키워드를 추출할 적에 지금까지는 Anchor Text를 염두에 두지 않았었다. Anchor Text는 사람이 직접 요약한 것이고(요약성), 하이퍼링크를 포함하는 웹 문서에 반드시 존재하므로(보편성) 그 하이퍼링크가 가리키는 곳의 문서의 키워드를 추출에 적합한 용도가 될 수 있다. 웹 그래프는 이러한 Anchor Text를 이용하여 키워드를 추출함으로써 문서와 문서간, 단어와 단어간의 관계(연관성)까지도 나타내 줄 수 있게 한 검색 엔진 시스템이다. 그러나 Anchor Text 자체가 본문의 내용이 아니고, Anchor Text를 작성한 사람에 따라 다르게 작성되며, 본문의 내용과 무관한 내용도 작성할 수 있다. 따라서 Anchor Text 자체를 어떠한 여과 없이 문서의 키워드로 받아들이긴 힘들다. 본 논문에서는 TFIDF를 통해 좀 더 정확성이 있는 키워드를 추출하였다.

  • PDF

A Methodology for Extracting Shopping-Related Keywords by Analyzing Internet Navigation Patterns (인터넷 검색기록 분석을 통한 쇼핑의도 포함 키워드 자동 추출 기법)

  • Kim, Mingyu;Kim, Namgyu;Jung, Inhwan
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.123-136
    • /
    • 2014
  • Recently, online shopping has further developed as the use of the Internet and a variety of smart mobile devices becomes more prevalent. The increase in the scale of such shopping has led to the creation of many Internet shopping malls. Consequently, there is a tendency for increasingly fierce competition among online retailers, and as a result, many Internet shopping malls are making significant attempts to attract online users to their sites. One such attempt is keyword marketing, whereby a retail site pays a fee to expose its link to potential customers when they insert a specific keyword on an Internet portal site. The price related to each keyword is generally estimated by the keyword's frequency of appearance. However, it is widely accepted that the price of keywords cannot be based solely on their frequency because many keywords may appear frequently but have little relationship to shopping. This implies that it is unreasonable for an online shopping mall to spend a great deal on some keywords simply because people frequently use them. Therefore, from the perspective of shopping malls, a specialized process is required to extract meaningful keywords. Further, the demand for automating this extraction process is increasing because of the drive to improve online sales performance. In this study, we propose a methodology that can automatically extract only shopping-related keywords from the entire set of search keywords used on portal sites. We define a shopping-related keyword as a keyword that is used directly before shopping behaviors. In other words, only search keywords that direct the search results page to shopping-related pages are extracted from among the entire set of search keywords. A comparison is then made between the extracted keywords' rankings and the rankings of the entire set of search keywords. Two types of data are used in our study's experiment: web browsing history from July 1, 2012 to June 30, 2013, and site information. The experimental dataset was from a web site ranking site, and the biggest portal site in Korea. The original sample dataset contains 150 million transaction logs. First, portal sites are selected, and search keywords in those sites are extracted. Search keywords can be easily extracted by simple parsing. The extracted keywords are ranked according to their frequency. The experiment uses approximately 3.9 million search results from Korea's largest search portal site. As a result, a total of 344,822 search keywords were extracted. Next, by using web browsing history and site information, the shopping-related keywords were taken from the entire set of search keywords. As a result, we obtained 4,709 shopping-related keywords. For performance evaluation, we compared the hit ratios of all the search keywords with the shopping-related keywords. To achieve this, we extracted 80,298 search keywords from several Internet shopping malls and then chose the top 1,000 keywords as a set of true shopping keywords. We measured precision, recall, and F-scores of the entire amount of keywords and the shopping-related keywords. The F-Score was formulated by calculating the harmonic mean of precision and recall. The precision, recall, and F-score of shopping-related keywords derived by the proposed methodology were revealed to be higher than those of the entire number of keywords. This study proposes a scheme that is able to obtain shopping-related keywords in a relatively simple manner. We could easily extract shopping-related keywords simply by examining transactions whose next visit is a shopping mall. The resultant shopping-related keyword set is expected to be a useful asset for many shopping malls that participate in keyword marketing. Moreover, the proposed methodology can be easily applied to the construction of special area-related keywords as well as shopping-related ones.

Development of the Pattern Matching Engine using Regular Expression (정규 표현식을 이용한 패턴 매칭 엔진 개발)

  • Ko, Kwang-Man;Park, Hong-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.2
    • /
    • pp.33-40
    • /
    • 2008
  • In various manners, string pattern matching algorithm has been proven for prominence in speed of searching particular queries and keywords. Whereas, the existing algorithms are limited in terms of various pattern. In this paper, regular expression has been utilized to improve efficiency of pattern matching through efficient execution towards various pattern of queries including particular keywords. Such as this research would enable to search various harmful string pattern more efficiently, rather than matching simple keywords, which also implies excellent speed of string pattern matching compared to that of those existing algorism. In this research, the proposed string search engine generated from the LEX are more efficient than BM & AC algorithm for a string patterns search speed in cases of 1000 with more than patterns, but we have got similar results for the keywords pattern matching.

Ontology-based Semantic Search System for Administrative Tasks (온톨로지 기반 행정 업무 의미검색 시스템)

  • Ham, Youngkyoung;Paek, Eunok;Hwang, Kyubaek;Choi, Kwangsun;Ahn, Taesung
    • Annual Conference on Human and Language Technology
    • /
    • 2012.10a
    • /
    • pp.104-106
    • /
    • 2012
  • 본 연구에서는 민원 행정 서비스 시스템이 보다 적합한 민원 업무 정보를 검색할 수 있는 기반 환경을 조성하기 위하여 온롤로지 기반의 검색시스템을 설계 및 구현하였고 그 성능을 기존의 키워드 기반 검색시스템과 비교해 보았다. 온톨로지 기반 검색시스템은 Protege를 사용하여 자체 설계 및 구현하였으며, 실험을 위해 서울시청의 대기 및 환경에 관한 민원사례 2700 여개의 데이터를 사용하였다. 그 중 677개의 민원 질의문을 대상으로 실험한 결과로, 온롤로지 기반으로 키워드를 확장하였을 경우가 일반 키워드 검색 결과보다 재현율 약 14%, 정확률 약 18%의 성능 향상이 있었음을 확인하였다.

  • PDF

Implementation of Mobile Search Services based on Image Deep-learning (이미지 딥러닝 기반의 모바일 검색 서비스 구현)

  • Song, Jeo;Cho, Jung-Hyun;Kwon, Jin-Gwan;Lee, Sang-Moon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2017.07a
    • /
    • pp.348-349
    • /
    • 2017
  • 본 논문에서 제안하는 내용은 기존의 포털 검색의 키워드 입력 방식과는 달리, 검색하고자 하는 대상을 스마트폰과 같은 모바일 기기의 카메라로 촬영하면, 해당 촬영 이미지가 사용자 입장에서는 검색 키워드와 같이 동일한 역할을 할 수 있도록 이미지에 해당되는 검색 키워드를 추출 및 매칭하여 검색을 위한 질의어로 사용할 수 있도록 해주는 것을 목적으로 한다.

  • PDF

Academic Paper Keyword Extracting Algorithm for Efficient Search and Development of Research Searching System (효율적인 검색을 위한 논문 키워드 추출 알고리즘 설계 및 연구 검색 시스템 개발)

  • Lee, Jong-Hyun;Lee, Won-Joon;Kim, Ho-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.463-466
    • /
    • 2018
  • 본 연구는 논문을 기반으로 연구의 주요 키워드를 추출하는 알고리즘을 설계하고 이를 적용한 연구 검색 시스템을 개발하여 효율적인 검색 환경을 제공하는 것을 목표로 한다. 논문 키워드 추출 알고리즘은 논문 내에서의 단어 출현 빈도와 PMI 지표를 바탕으로 정의한 단어간 연관성 K(x,y)을 기반으로 설계하였다. 연구 검색 시스템은 고등학교 R&E 등 제한적인 환경에서 이루어지는 연구들의 선행 연구 자료 부족을 해결하는 것을 주 목적으로 한다. 또한, 구현한 연구 검색 시스템에 제안된 알고리즘을 적용하여 보다 정확하고 직관적인 검색 환경을 제공할 수 있었으며, 추후 연구 자료가 추가됨에 따라 그 가치가 높아질 것으로 전망한다.

A Relation Analysis between NDSL User Queries and Technical Terms (NDSL 검색 질의어와 기술용어간의 관계에 대한 분석적 연구)

  • Kang, Nam-Gyu;Cho, Min-Hee;Kwon, Oh-Seok
    • Journal of Information Management
    • /
    • v.39 no.3
    • /
    • pp.163-177
    • /
    • 2008
  • In this paper, we analyzed the relationship between user query keywords that is used to search NDSL and technical terms extracted from NDSL journals. For the analysis, we extracted about 833,000 query keywords from NDSL search logs during nearly 17 months and approximately 41,000,000 technical terms from NDSL, INSPEC, FSTA journals. And we used only the English noun phrase in extracted those and then we did an experiment on analysis of equality, relationship analysis and frequency analysis.