• Information and Communications Magazine
• /
• 제11권9호
• /
• pp.57-66
• /
• 1994

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제24권1호
• /
• pp.5-14
• /
• 2014

Searchable encryption systems provide search on encrypted data while preserving the privacy of the data and the search keywords used in queries. Recently, interest on data outsourcing has increased due to proliferation of cloud computing services. Many researches are on going to minimize the trust put on external servers and searchable encryption is one of them. However, most of previous searchable encryption schemes provide only a single keyword boolean search. Although, there have been proposals to provide conjunctive keyword search, most of these works use a fixed field which limit their application. In this paper, we propose a field-free conjunctive keyword searchable encryption that also provides rank information of search results. Our system uses prime tables and greatest common divisor operation, making our system very efficient. Moreover, our system is practical and can be implemented very easily since it does not require sophisticated cryptographic module.

• Journal of the Korea Society of Computer and Information
• /
• 제25권10호
• /
• pp.87-94
• /
• 2020

Social reviews such as SNS feeds and blog articles have been widely used to extract keywords reflecting opinions and complaints from users' perspective, and often include proper nouns or new words reflecting recent trends. In general, these words are not included in a dictionary, so conventional morphological analyzers may not detect and extract those words from the reviews properly. In addition, due to their high processing time, it is inadequate to provide analysis results in a timely manner. This paper presents a method for efficient keyword extraction from social reviews based on the notion of cohesion scoring. Cohesion scores can be calculated based on word frequencies, so keyword extraction can be performed without a dictionary when using it. On the other hand, their accuracy can be degraded when input data with poor spacing is given. Regarding this, an algorithm is presented which improves the existing cohesion scoring mechanism using the structure of a word tree. Our experiment results show that it took only 0.008 seconds to extract keywords from 1,000 reviews in the proposed method while resulting in 15.5% error ratio which is better than the existing morphological analyzers.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제41권3호
• /
• pp.209-219
• /
• 2004

In order to implement a real time hardware for keyword spotting, we propose a Single-End-Point DTW(SEP-DTW) algorithm which is simple and less complex for computation. The SEP-DTW algorithm only needs a single end point which enables efficient applications, and it has a small wont of computations because the global search area is divided into successive local search areas. Also, we adopt new local constraints and a new distance measure for a better performance of the SEP-DTW algorithm. Besides, we make a normalization of feature same vectors so that they have the same variance in each frequency bin, and each frame has the same energy levels. To construct several reference patterns for each keyword, we use a clustering algorithm for all training patterns, and mean vectors in every cluster are taken as reference patterns. In order to detect a key word for input streams of speech, we measure the distances between reference patterns and input pattern, and we make a decision whether the distances are smaller than a pre-defined threshold value. With isolated speech recognition and keyword spotting experiments, we verify that the proposed algorithm has a better performance than other methods.

• Journal of KIISE
• /
• 제44권8호
• /
• pp.782-790
• /
• 2017

The service, 'Hot Search Keywords', provides a list of the most hot search terms of different web services such as Naver or Daum. The service, bases the changes in rank of a specific search keyword on changes in its users' interest. This paper introduces a temporal modelling framework for predicting the rank change of hot search keywords using past rank data and machine learning. Past rank data shows that more than 70% of hot search keywords tend to disappear and reappear later. The authors processed missing rank value, using deletion, dummy variables, mean substitution, and expectation maximization. It is however crucial to calculate the optimal window size of the past rank data. We proposed an optimal window size selection approach based on the minimum amount of time a topic within the same or a differing context disappeared. The experiments were conducted with four different machine-learning techniques using the Naver, Daum, and Nate 'Hot Search Keywords' datasets, which were collected for 2 years.

• Journal of Korean Library and Information Science Society
• /
• 제47권3호
• /
• pp.95-114
• /
• 2016

The purpose of this preliminary study is to collect specific examples of book reports and understand semantic characteristics of them through semantic network. The analysis was conducted with 23 book reports which classified by three groups. The keywords were selected from the of book reports. Five types of keyword network were composed based on co-occurrence relations with keywords. The result of this study is following these. First, each keyword network of book reports of groups and individuals is shown to have different structural characteristics. Second, each network has different high centrality keywords according to the result analysis of 3 types of centrality(degree centrality, closeness centrality, betweenness centrality). These characteristic means that keyword network analysis is useful in recognizing the characteristics of not only groups' and but also individual's book reports.

• Journal of KIISE:Computer Systems and Theory
• /
• 제35권3호
• /
• pp.103-110
• /
• 2008

This paper proposes an effective keyword extraction method for the Web videos. The proposed method classifies the Web video pages in one of 4 types. As such, we analyzed the structure of the Web pages based on the number of videos and the layout of the Web pages. And then we applied the keyword extraction algorithm fit to each page type. The experiment with 1,087 Web pages that have total 2,462 videos showed that the recall of the proposed extraction method is 18% higher than ImagerRover[2]. So, the proposed method could be used to build a powerful video search system for WWW.

• Journal of the Korea Computer Industry Society
• /
• 제4권12호
• /
• pp.901-910
• /
• 2003

Generally, most commercial retrieval engines adopt boolean query as user's query type. Although boolean query is useful to retrieval engines that need fast retrieval, it is not easy for user to express his demands with boolean operators. So, many researches have been studied for decades about information retrieval systems using natural language query that is convenient for user. To retrieve documents that are suitable for user's demands, they have to express their demands correctly, So, this thesis proposes interactive query process agent using natural language. This agent expresses demands concrete through gradual interaction with user, When users input a natural language Query, this agent analyzes the query and generates boolean query by selecting proper keyword and feedbacks the state of the keyword selected. If the keyword is a synonymy or a polysemy, the agent expands or limits the keyword through interaction with user. It makes user express demands more concrete and improve system performance. So, this agent can improve the precision of Information Retrieval.

• Journal of Korea Multimedia Society
• /
• 제11권11호
• /
• pp.1471-1479
• /
• 2008

In this paper, we propose a technique to improve Out-Of-Vocabulary(OOV) rejection algorithms in variable vocabulary recognition system which is much used in ASR(Automatic Speech Recognition). The rejection system can be classified into two categories by their implementation method, keyword spotting method and utterance verification method. The utterance verification method uses the likelihood ratio of each phoneme Viterbi score relative to anti-phoneme score for deciding OOV. In this paper, we add speaker verification system before utterance verification and calculate an speaker verification probability. The obtained speaker verification probability is applied for determining the proposed variable-confidence threshold. Using the proposed method, we achieve the significant performance improvement; CA(Correctly Accepted for keyword) 94.23%, CR(Correctly Rejected for out-of-vocabulary) 95.11% in office environment, and CA 91.14%, CR 92.74% in noisy environment.

• Journal of Information Technology Services
• /
• 제17권2호
• /
• pp.143-163
• /
• 2018

The business models has a great impact on the successful management of enterprises. Business environment has been shifting from industrial economy to knowledge-based economy. Enterprises go through numerous trials for successful management in the changing environment. Along with trial tests, research areas have been growing simultaneously. Although many researches have been conducted with regard to business models, it is very insufficient to systematically analyze the knowledge flow of research. Accordingly, successive researchers who want to study the business model may find it difficult to establish the orientation of future application research based on understanding the process of changing the knowledge structure that have accumulated so far. This study is intended to determine the current state of the business model research and to understand the process of knowledge structure changes in keywords that appear in 2,667 business model articles in the SCOPUS database. Identifying the knowledge structure has been completed through social network analysis, a methodology based on the 'relationship', and the changes in the knowledge structure were identified by classifying them into four different periods. The analysis showed that, first, the number of business model co-author increases over time with the need for academic diversity. Second, the 'innovation' keyword has the biggest center in the network, and over time, the lower-rank keyword which was in the former period has emerged as the top-rank keyword. Third, the cohesiveness group decreased from 12 before 2000 to 5 in 2015 and also the modularity decreased as well. Finally, examining characteristics of study area through a cognitive map showed that the relationships between domains increased gradually over time. The study has provided a systematic basis for understanding the current state of the business model research and the process of changing knowledge structure. In addition, considering that no research has ever systematically analyzed the knowledge structure accumulated by individual researches, it is considered as a significant study.