• 한국경영과학회지
• /
• 제40권4호
• /
• pp.49-63
• /
• 2015

Keyword indexed in multidisciplinary journals show trends about science and technology innovation. Nature and Science were selected as multidisciplinary journals for our analysis. In order to reduce the effect of plurality of keyword, stemming algorithm were implemented. After this process, we fitted growth curve of keyword (stem) following bass model, which is a well-known model in diffusion process. Bass model is useful for expressing growth pattern by assuming innovative and imitative activities in innovation spreading. In addition, we construct keyword co-occurrence network and calculate network measures such as centrality indices and local clustering coefficient. Based on network metrics and yearly frequency of keyword, time series analysis was conducted for obtaining statistical causality between these measures. For some cases, local clustering coefficient seems to Granger-cause yearly frequency of keyword. We expect that local clustering coefficient could be a supportive indicator of emerging science and technology.

• Journal of Information Processing Systems
• /
• 제5권3호
• /
• pp.159-166
• /
• 2009

As shown in Wikipedia, tagging or cross-linking through major keywords in a document collection improves not only the readability of documents but also responsive and adaptive navigation among related documents. In recent years, the Semantic Web has increased the importance of social tagging as a key feature of the Web 2.0 and, as its crucial phenotype, Tag Cloud has emerged to the public. In this paper we provide an efficient method of automated in-text keyword tagging based on large-scale controlled term collection or keyword dictionary, where the computational complexity of O(mN) - if a pattern matching algorithm is used - can be reduced to O(mlogN) - if an Information Retrieval technique is adopted - while m is the length of target document and N is the total number of candidate terms to be tagged. The result shows that automatic in-text tagging with keywords filtered by Information Retrieval speeds up to about 6 $\sim$ 40 times compared with the fastest pattern matching algorithm.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.447-459
• /
• 2020

After reading a document, people construct a concept about the information they consumed and merge multiple words to set up keywords that represent the material. With that in mind, this study suggests a smarter and more efficient keyword extraction method wherein scholarly journals are used as the basis for the establishment of production rules based on a concept information of words appearing in a document in a way in which author-provided keywords are functional although they do not appear in the body of the document. This study presents a new way to determine the importance of each keyword, excluding non-relevant keywords. To identify the validity of extracted keywords, titles and abstracts of journals about natural language and auditory language were collected for analysis. The comparison of author-provided keywords with the keyword results of the developed system showed that the developed system was highly useful, with an accuracy rate as good as up to 96%.

• 한국경영과학회지
• /
• 제39권1호
• /
• pp.29-48
• /
• 2014

The recent keyword advertising does not reflect the individual customer searching pattern because it is focused on each keyword at the aggregate level. The purpose of this research is to observe processes of customer searching patterns. To be specific, individual deal-proneness is mainly concerned. This study incorporates location as a control variable. This paper examines the relationship between customers' searching patterns and probability of purchase. A customer searching session, which is the collection of sequence of keyword queries, is utilized as the unit of analysis. The degree of deal-proneness is measured using customer behavior which is revealed by customer searching keywords in the session. Deal-proneness measuring function calculates the discount of deal prone keyword leverage in accordance with customer searching order. Location searching specificity function is also calculated by the same logic. The analyzed data is narrowed down to the customer query session which has more than two keyword queries. The number of the data is 218,305 by session, which is derived from Internet advertising agency's (COMAS) advertisement managing data and the travel business advertisement revenue data from advertiser's. As a research result, there are three types of the deal-prone customer. At first, there is an unconditional active deal-proneness customer. It is the customer who has lower deal-proneness which means that he/she utilizes deal-prone keywords in the last phase. He/she starts searching a keyword like general ones and then finally purchased appropriate products by utilizing deal-prone keywords in the last time. Those two types of customers have the similar rates of purchase. However, the last type of the customer has middle deal-proneness; who utilizes deal-prone keywords in the middle of the process. This type of a customer closely gets into the information by employing deal-prone keywords but he/she could not find out appropriate alternative then would modify other keywords to look for other alternatives. That is the reason why the purchase probability in this case would be decreased Also, this research confirmed that there is a loyalty effect using location searching specificity. The customer who has higher trip loyalty for specificity location responds to selected promotion rather than general promotion. So, this customer has a lower probability to purchase.

• The Journal of the Acoustical Society of Korea
• /
• 제16권2E호
• /
• pp.27-31
• /
• 1997

This paper proposes a new rejection algorithm which distinguishes unregistered spoken words(or non-keywords) from registered vocabulary. Two kinds of garbage models are employed in this design ; the original garbage model and a new word garbage model. The original garbage model collects all non-keyword patterns where the new word garbage model collects patterns classified by recognizing each non-keyword pattern with registered vocabulary. These two types of garbage models work together to make a robust reject decision. The first stage of processing is the classification of an input pattern through the original garbage model. In the event that the first stage of processing is ambiguous, the new word dependent garbage model is used to classify thye input pattern as either a registered or non-registered word. This paper shows the efficiency of the new word dependent garbage model. A Dynamic Multisection method is used to test the performance of the algorithm. Results of this experiment show that the proposed algorithm performs at a higher level than that of the original garbage model.

• 한국음향학회지
• /
• 제15권4호
• /
• pp.43-49
• /
• 1996

본 논문은 keyword spotting 기술을 이용한 247개의 DDD 지역명을 인식 대상으로 하여 화자 독립의 한국어 연속 음성인식을 위한 시스템을 제안하였다. 적용된 인식 알고리즘은 음성에서 시간축의 변화와 스펙트럼의 왜곡을 흡수할 수 있는 모델로 DP와 MLP로 구성된 동적 프로그래밍 신경회로망(DPNN)을 사용하였다. 이와 같은 실험을 위해 단어 모델을 만들고 이에 대한 단어 모델을 keyword 모델과 non-keyword 모델로 구분하여 성능을 향상시킬 수 있도록 하였다. 또한 잘못된 결과를 출력시키지 않기 위해서 후처리 과정을 두고 실험을 하였다. 실험결과, 단독어에 대한 화자 종속 실험은 93.45%의 결과를 보였고, 단독어에 대한 화자 독립 실험은 84.05%의 실험결과를 보였으며, 가장 중요한 간단한 대화체 문장의 keyword spotting 실험은 화자 종속으로 77.34%의 결과를 보였으며, 화자 독립 실험은 70.63%의 결과를 얻었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

• 한국실내디자인학회논문집
• /
• 제26권1호
• /
• pp.75-82
• /
• 2017

This study reviews the process of creating the patterns through the Christopher Alexander's books to discover the fundamental rules for creation of the pattern language. The essential ideas of 11 rules describing the characteristics of the pattern language are organized by keyword depending on the characteristics of each rule. Then, this study analyzes which keyword was applied importantly and how it had been developed chronologically in the Alexander's books. As a result, 5 keywords - reflection of cultural difference, reflection of human desires, solving the repeated problem, function suitable for principal purpose, and network structure - are applied to his early books in which the pattern language was theoretically developed, the pattern of traditional society was discovered and the network structure was developed. Another 5 keywords - user participation method, new problem solving, structure preserving transformation, post-mechanization method, and central invariant structure - are applied to the books in his mid-term after completion of the pattern theory which discover new pattern for contemporary society and apply the pattern language to time and space. In his later books which organize the theory of pattern language and suggest the direction for using the pattern language, 5 keywords - wholeness, post-mechanization method, user participation method, new problem solving, and structure preserving transformation - are applied. Users may use the pattern language more precisely if he/she considers the keywords of the early period in searching the patterns of existing environment, the keywords of the intermediate period in searching the patterns of new environment or in regard to time and space, and the keywords of the later period in considering direction of the application of the pattern language.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 춘계학술대회
• /
• pp.129-130
• /
• 2016

빅 데이터 분석은 기존 데이터베이스 관리 도구로부터 데이터를 수집, 저장, 관리, 분석할 수 있는 역량을 말한다. 대부분의 빅 데이터 분석 기술 방법들은 기존 통계학과 전산학에서 사용되던 데이터 마이닝, 기계 학습, 자연 언어 처리, 패턴 인식 등이 해당된다. 최근 스마트 기기의 발달과 정보통신기술의 발전은 트위터, 페이스북, 인스타그램 등의 소셜 네트워크상에서 유통되는 정보량이 폭발적 증가하고 있다. 이러한 변화는 데이터화가 가속화되고 있는 현대사회에서 데이터의 가치는 점점 높아질 것으로 예상되며, 데이터로부터 가치 있는 정보와 통찰력을 효과적으로 이끌어내는 기업이 경쟁력 확보를 위한 핵심가치가 되었다. 본 연구에서는 다음 커뮤니케이션의 빅 데이터 분석도구인 소셜 매트릭스를 활용하여 키워드 분석을 통해 스마트폰 플랫폼 키워드 의미를 분석하고자 한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 춘계학술대회
• /
• pp.143-144
• /
• 2016

빅 데이터 분석은 기존 데이터베이스 관리 도구로부터 데이터를 수집, 저장, 관리, 분석할 수 있는 역량을 말한다. 또한, 대량의 정형 또는 비정형 데이터 집합으로부터 가치를 추출하고 결과를 분석하는 기술을 의미한다. 대부분의 빅 데이터 분석 기술 방법들은 기존 통계학과 전산학에서 사용되던 데이터 마이닝, 기계 학습, 자연 언어 처리, 패턴 인식 등이 해당된다. 글로벌 리서치 기관들은 빅 데이터를 2011년 이래로 최근 가장 주목받는 신기술로 지목해오고 있다. 따라서 대부분의 산업에서 기업들은 빅 데이터의 적용을 통해 가치 창출을 위한 노력을 기하고 있다. 본 연구에서는 다음 커뮤니케이션의 빅 데이터 분석도구인 소셜 매트릭스를 활용하여 키워드 분석을 통해 창조경제 키워드 의미를 분석하고자 한다. 또한, 분석결과를 바탕으로 이론적 실무적 시사점을 제시하고자 한다.