• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.667-671
• /
• 2002

It is very difficult to extract the words fitted for the purpose in spite of the great importance of efficient keyword extraction in information retrieval systems because there are many compound words. For example, AC machine is not able to search compound keywords from a single keyword. The DER structure solves this problem, but there remains a problem that it takes too much time to search keywords. Therefore a DERtable structure based on these methods is proposed in this dissertation to solve the above problems in which method tables are added to the existing DER structure and utilized to search keywords.

• Journal of Korean Library and Information Science Society
• /
• v.41 no.1
• /
• pp.149-165
• /
• 2010

In this research, we analyze about the general service provided by Society of Korean journal articles of science and technology. Personalized retrieval services which are suitable to the articles service were developed based on this. That is, there are personalized retrieval system based on user's keyword, authors navigation system, automatic topic recommendation system based on author's keyword, and similar user automatic recommendation system. In this research, personalized service methods being suitable to the articles service of Society tries to be considered through the user survey.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.227-240
• /
• 2011

New concepts and ideas often result from extensive recombination of existing concepts or ideas. Both researchers and developers build on existing concepts and ideas in published papers or registered patents to develop new theories and technologies that in turn serve as a basis for further development. As the importance of patent increases, so does that of patent analysis. Patent analysis is largely divided into network-based and keyword-based analyses. The former lacks its ability to analyze information technology in details while the letter is unable to identify the relationship between such technologies. In order to overcome the limitations of network-based and keyword-based analyses, this study, which blends those two methods, suggests the keyword network based analysis methodology. In this study, we collected significant technology information in each patent that is related to Light Emitting Diode (LED) through text mining, built a keyword network, and then executed a community network analysis on the collected data. The results of analysis are as the following. First, the patent keyword network indicated very low density and exceptionally high clustering coefficient. Technically, density is obtained by dividing the number of ties in a network by the number of all possible ties. The value ranges between 0 and 1, with higher values indicating denser networks and lower values indicating sparser networks. In real-world networks, the density varies depending on the size of a network; increasing the size of a network generally leads to a decrease in the density. The clustering coefficient is a network-level measure that illustrates the tendency of nodes to cluster in densely interconnected modules. This measure is to show the small-world property in which a network can be highly clustered even though it has a small average distance between nodes in spite of the large number of nodes. Therefore, high density in patent keyword network means that nodes in the patent keyword network are connected sporadically, and high clustering coefficient shows that nodes in the network are closely connected one another. Second, the cumulative degree distribution of the patent keyword network, as any other knowledge network like citation network or collaboration network, followed a clear power-law distribution. A well-known mechanism of this pattern is the preferential attachment mechanism, whereby a node with more links is likely to attain further new links in the evolution of the corresponding network. Unlike general normal distributions, the power-law distribution does not have a representative scale. This means that one cannot pick a representative or an average because there is always a considerable probability of finding much larger values. Networks with power-law distributions are therefore often referred to as scale-free networks. The presence of heavy-tailed scale-free distribution represents the fundamental signature of an emergent collective behavior of the actors who contribute to forming the network. In our context, the more frequently a patent keyword is used, the more often it is selected by researchers and is associated with other keywords or concepts to constitute and convey new patents or technologies. The evidence of power-law distribution implies that the preferential attachment mechanism suggests the origin of heavy-tailed distributions in a wide range of growing patent keyword network. Third, we found that among keywords that flew into a particular field, the vast majority of keywords with new links join existing keywords in the associated community in forming the concept of a new patent. This finding resulted in the same outcomes for both the short-term period (4-year) and long-term period (10-year) analyses. Furthermore, using the keyword combination information that was derived from the methodology suggested by our study enables one to forecast which concepts combine to form a new patent dimension and refer to those concepts when developing a new patent.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.923-924
• /
• 2009

학술 정보의 결정체라 할 수 있는 논문 정보에 대한 검색을 할 때 기존의 학술 정보 검색 시스템에서는 키워드와의 일치성을 기반으로 학술 정보 검색 시스템을 구축할 수 있지만, 검색 사용자가 지정한 키워드와 유사한 논문 정보에 대해서는 검색 할 수 없었다. 본 논문에서는 온톨로지 서버를 이용하여 각 학술 분야에 대한 의미를 바탕으로 검색시 특정 학술 분야 검색에 대한 "깊이와 넓이"의 연관성을 충족하는 검색 시스템에 대해 설명한다.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.59-73
• /
• 2009

Keyword extraction is an important and essential technique for text mining applications such as information retrieval, text categorization, summarization and topic detection. A set of keywords extracted from a large-scale electronic document data are used for significant features for text mining algorithms and they contribute to improve the performance of document browsing, topic detection, and automated text classification. This paper presents a keyword extraction technique that can be used to detect topics for each news domain from a large document collection of internet news portal sites. Basically, we have used six variants of traditional TF-IDF weighting model. On top of the TF-IDF model, we propose a word filtering technique called 'cross-domain comparison filtering'. To prove effectiveness of our method, we have analyzed usefulness of keywords extracted from Korean news articles and have presented changes of the keywords over time of each news domain.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.202-214
• /
• 2005

The semantic web is the web paradigm that represents not general link of documents but semantics and relation of document. In addition it enables software agents to understand semantics of documents. We propose a semantic search based on inference with ontologies, which has the following characteristics. First, our search engine enables retrieval using explicit ontologies to reason though a search keyword is different from that of documents. Second, although the concept of two ontologies does not match exactly, can be found out similar results from a rule based translator and ontological reasoning. Third, our approach enables search engine to increase accuracy and precision by using explicit ontologies to reason about meanings of documents rather than guessing meanings of documents just by keyword. Fourth, domain ontology enables users to use more detailed queries based on ontology-based automated query generator that has search area and accuracy similar to NLP. Fifth, it enables agents to do automated search not only documents with keyword but also user-preferable information and knowledge from ontologies. It can perform search more accurately than current retrieval systems which use query to databases or keyword matching. We demonstrate our system, which use ontologies and inference based on explicit ontologies, can perform better than keyword matching approach .

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.103-109
• /
• 2005

Research about P2P system have recently a lot of attention in connection of form that pass early Centralized P2P and is Decentralized P2P. Specially, Structured P2P System of DHT base have a attention to scalability and systematic search and high search efficiency by routing. But, Structured P2P System of DHT base have problem, file can be located only their unique File IDs that although user may wish to search for files using a set descriptive keyword or do not have the exact File ID of the files. This paper propose extended-CAN mechanism that creates File ID of Contents base and use KID and CKD for commonness keyword processing to support keyword search in P2P System of DHT base.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.245-252
• /
• 2014

Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.06a
• /
• pp.45-50
• /
• 2008

웹의 폭발적인 성장으로 다양한 형태의 지역관련 정보가 웹 공간에 포함되어 있으며, 기존의 지리정보시스템에서 제공하지 못한 실생활의 다양한 지역 정보를 얻을 수 있게 되었다. 하지만, 사용자가 지역 정보를 얻기 위해서는 현재의 키워드 기반의 웹 검색 엔진을 사용하여 얻은 다수의 검색 결과와 이를 맵과 관련시켜 정리해야 하는 불편함이 있다. 이러한 문제를 해결하기 위하여, 본 논문에서는 특정지역에 대한 정확한 지리정보를 갖고 있는 수치지도와 방대한 지역정보를 갖고 있는 웹 공간을 융합하여 특정지역과 관련된 지역정보를 효율적으로 제공할 수 있는 시스템인 "경기21서치 2.0"을 제안한다. 본 시스템에서는 웹을 통해 분석한 지역의 특징 및 지역 간의 의미적 관련성을 키워드를 통해 지역지식 네비게이터로 구성하고, 이를 수치지도에 기반한 맵 인터페이스와 연동하여 보다 효율적인 지역 웹 정보검색을 지원한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.100-102
• /
• 2003

인터넷의 등장 이후 폭발적으로 증대되는 웹 정보를 효율적으로 사용하기 위한 방안이 연구되고 있다. 현재, 웹 서비스에서 사용하고 있는 키워드 기반 검색은 syntactic 정보만을 제공하므로 원하는 서비스를 받고자하는 사용자의 의도와 상관없는 정보를 탐색하여 서비스한다. 그러나 시멘틱 웹을 기반으로 만들어진 시스템들은 서비스 정보의 질을 향상시키기 위하여 DQL(Daml Query Language)을 이용한 시멘틱 서치(Semantic search)기법을 이용하고 있다. 시멘틱 서치는 사용자가 입력한 질의들을 의미상으로 해석하고, 이를 통하여 사용자의 원하는 정보와 의미가 같은 해답을 얻어내는 것이다. 그러나 기존의 시멘틱 서치는 사용자가 복잡한 질의들을 수작업으로 처리하여 원하는 정보를 탐색해야하고 DQL(Daml Query Language)은 자체 추론 기능을 갖지 않기 때문에 DQL엔진에서 각각의 메타데이터들을 비교하여 사용자의 질의에 맞는 해답을 찾아내야 함으로 시스템 과부하 현상이 일어나게 된다. 본 논문은 이러한 기존의 시멘틱 서치 방식의 효율성과 속도를 놀이기 위하여, 사용자 중심의 키워드 형태 질의를 시스템 중심의 DQL로 변환하는 DQL 컨버터 시스템과 추론엔진을 불러내어 전방향 추론과 단일화를 실행하는 DQL 엔진을 제안한다.