• Journal of Korea Technology Innovation Society
• /
• v.14 no.spc
• /
• pp.1152-1170
• /
• 2011

We selected core documents from enormous number of documents by analyzing citation relation of papers or patents including direct citation and indirect citation. Then we tried to creat the technology evolution path from citation network tree. By applying the method to the patent DB of OLED (Organic Light Emitting Diode), we obtained genealogical citation network of core patents of OLED. We analyzed how the one of OLED technology was transferred to the semiconductor related technology and we named the process of transition as 'technology evolution path' of OLED technology. And we also analyzed the genealogical citation network of papers on graphene. From the analysis, we found that the weight count method including indirect citation was better in evaluating the value of technology of a paper than the times cited method.

• Proceedings of the Technology Innovation Conference
• /
• 2009.02a
• /
• pp.259-274
• /
• 2009

연구개발에 종사하는 연구자나 연구기획자들은 미래에 어떤 기술 또는 연구 분야가 각광을 받을지 파악하기 위해 정보를 수집하거나 분석한다. 그러나 방대한 정보 중에서도 정말 필요한 정보를 단시간내에 효과적으로 수집하기는 쉽지 않다. 기술기획이나 연구기획의 경우 현재의 연구동향이나 현황을 빠른 시간안에 정확히 파악하는 것이 주된 관심사이며, 이것을 지원해 줄 수 있는 연구방법론 중 하나가 계량서지학이다. 본 연구는 계량서지적 분석결과를 효과적으로 이해할 수 있도록 시각화 기법을 이용한 정보분석 방법론을 다룬다. 발표동향 분석, 공동연구네트워크분석, 수준지수분석, 특허인용네트워크를 통한 인용트리분석 등을 이용하여 전자종이(e-Paper)기술분야에 대해 분석하였다. 본 연구는 정보분석에 있어 비전문가라도 신속하게 정보분석 결과를 획득할 수 있도록 KISTI에서 개발한 정보분석시스템인 KnowledgeMatrix S/W와 이를 응용한 S/W를 활용한 방법론을 제시한다. 본 연구에서 사용한 방법론들은 실제로 연구사업에 활용하고 있거나 활용가능성이 매우 높은 방법론을 이용하였기 때문에 향후에도 널리 활용될 수 있을 것으로 판단한다.

• Journal of Technology Innovation
• /
• v.22 no.4
• /
• pp.117-143
• /
• 2014

Tracing an evolutionary technological trajectory in the macroscopic viewpoint is useful for technology policy, but not for corporate technology and intellectual property strategy. Tackling this issue, recent bibliometric studies using patents and papers have made efforts to identify more specific and detailed technological trajectory. However, these studies cannot go beyond simple description of the past trajectory. Also, identification of technology fusion and evolution relies on experts judgments. We suggest a way of identifying microscopic evolutionary technological trajectories by combining patent citation network analysis with dynamic technology tree. Also, using new indicators of generality, diversity and novelty, we can detect key technologies that can be a starting point of next generation technology and derivative technology. HVDC(High Voltage DC transmission) system technology is exemplified.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.101-103
• /
• 2007

혈관 구조는 사람의 가장 복잡한 구조 중 하나이다. 혈관 분석에는 Morphology and Topology 가 있다. 우리는 목표는 위 분석 기법과는 달리 3D 영상 재구성이다. 본 논문은 Raw CT data 을 세그먼트하고 Skeleton line 을 인용하여 복잡한 트리 형태의 혈관 3D 재구성을 하였다.

• Annual Conference on Human and Language Technology
• /
• 2012.10a
• /
• pp.77-83
• /
• 2012

본 연구에서는 로봇의 자동 동화구연을 목표로 발화문장 상의 감정 파악 및 등장인물 별 다앙한 TTS 보이스 선택에 활용 가능한 발화문장의 화자 파악문제를 다룬다. 본 연구에서는 기존 규칙기반 방법론에서 많이 활용되어온 자질인 후보의 위치, 화자 후보의 주격/목적격 여부, 발화동사 존재 여부를 비롯하여 동화에 자주 나타나는 등장인물의 의미적 분류 및 등장인물의 등장/퇴장과 관련된 동사들을 추가 자질로 활용한다. 사람 및 동식물, 무생물이 모두 화자가 될 수 있는 동화 코퍼스에서 제안한 자질들을 활용하여 의사결정트리로 학습 및 검증한 결과 규칙기반의 베이스라인 방법에 비해 최대 49%의 정확도가 향상되었고, 제안한 방법론이 데이터의 변화에도 강인한 것을 확인할 수 있었다.

• Journal of the Korean Society for information Management
• /
• v.34 no.1
• /
• pp.177-195
• /
• 2017

This study attempts to infer research fronts using factor graph model based on heterogeneous features. The model suggested by this study infers research fronts having documents with the potential to be cited multiple times in the future. To this end, the documents are represented by bibliographic, network, and content features. Bibliographic features contain bibliographic information such as the number of authors, the number of institutions to which the authors belong, proceedings, the number of keywords the authors provide, funds, the number of references, the number of pages, and the journal impact factor. Network features include degree centrality, betweenness, and closeness among the document network. Content features include keywords from the title and abstract using keyphrase extraction techniques. The model learns these features of a publication and infers whether the document would be an RF using sum-product algorithm and junction tree algorithm on a factor graph. We experimentally demonstrate that when predicting RFs, the FG predicted more densely connected documents than those predicted by RFs constructed using a traditional bibliometric approach. Our results also indicate that FG-predicted documents exhibit stronger degrees of centrality and betweenness among RFs.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.63-77
• /
• 2011

The World Wide Web is a very large distributed digital information space. From its origins in 1991, the web has grown to encompass diverse information resources as personal home pasges, online digital libraries and virtual museums. Some estimates suggest that the web currently includes over 500 billion pages in the deep web. The ability to search and retrieve information from the web efficiently and effectively is an enabling technology for realizing its full potential. With powerful workstations and parallel processing technology, efficiency is not a bottleneck. In fact, some existing search tools sift through gigabyte.syze precompiled web indexes in a fraction of a second. But retrieval effectiveness is a different matter. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not nessarily appear at the top of the query output order. Also, current search tools can not retrieve the documents related with retrieved document from gigantic amount of documents. The most important problem for lots of current searching systems is to increase the quality of search. It means to provide related documents or decrease the number of unrelated documents as low as possible in the results of search. For this problem, CiteSeer proposed the ACI (Autonomous Citation Indexing) of the articles on the World Wide Web. A "citation index" indexes the links between articles that researchers make when they cite other articles. Citation indexes are very useful for a number of purposes, including literature search and analysis of the academic literature. For details of this work, references contained in academic articles are used to give credit to previous work in the literature and provide a link between the "citing" and "cited" articles. A citation index indexes the citations that an article makes, linking the articleswith the cited works. Citation indexes were originally designed mainly for information retrieval. The citation links allow navigating the literature in unique ways. Papers can be located independent of language, and words in thetitle, keywords or document. A citation index allows navigation backward in time (the list of cited articles) and forwardin time (which subsequent articles cite the current article?) But CiteSeer can not indexes the links between articles that researchers doesn't make. Because it indexes the links between articles that only researchers make when they cite other articles. Also, CiteSeer is not easy to scalability. Because CiteSeer can not indexes the links between articles that researchers doesn't make. All these problems make us orient for designing more effective search system. This paper shows a method that extracts subject and predicate per each sentence in documents. A document will be changed into the tabular form that extracted predicate checked value of possible subject and object. We make a hierarchical graph of a document using the table and then integrate graphs of documents. The graph of entire documents calculates the area of document as compared with integrated documents. We mark relation among the documents as compared with the area of documents. Also it proposes a method for structural integration of documents that retrieves documents from the graph. It makes that the user can find information easier. We compared the performance of the proposed approaches with lucene search engine using the formulas for ranking. As a result, the F.measure is about 60% and it is better as about 15%.