• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.1
• /
• pp.123-138
• /
• 2013

Keyword advertising has been used as a promotion tool rather than the advertising itself to online retailers. This is because the online retailer expects the direct sales increase when they deploy the keyword sponsorship. In practice, many online sellers rely on keyword advertising to promote their sales in short term with limited budget. Most of the previous researches use direct revenue factors as dependent variables such as CTR (click through rate) and CVI (conversion per impression) in their researches on the keyword advertising[14, 16, 22, 25, 31, 32]. Previous studies were, however, conducted in the context of aggregate-level due to the limitations on the data availability. These researches cannot evaluate the performance of keyword advertising in the individual level. To overcome these limitations, our research focuses on conversion of keyword advertising in individual-level. Also, we consider manageable factors as independent variables in terms of online retailers (the costs of keyword by implementation methods and meanings of keyword). In our study we developed the keyword advertising conversion model in the individual-level. With our model, we can make some theoretical findings and managerial implications. Practically, in the case of a fixed cost plan, an increase of the number of clicks is revealed as an effective way. However, higher average CPC is not significantly effective in increasing probability of purchase conversion. When this type (fixed cost plan) of implementation could not generate a lot of clicks, it cannot significantly increase the probability of purchase choice. Theoretically, we consider the promotional attributes which influence consumer purchase behavior and conduct individuals-level research based on the actual data. Limitations and future direction of the study are discussed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.4
• /
• pp.3-10
• /
• 2011

To provide efficient keyword search on encrypted data, a public key encryption with keyword search (PEKS) was proposed by Boneh et al. A sender encrypts an e-mail and keywords with receiver's public key, respectively and uploads them on a server. Then a receiver generates a trapdoor of w with his secret key to search an e-mail related with some keyword w. However, Byun et al. showed that PEKS and some related schemes are not secure against keyword guessing attacks. In this paper, we propose a public key encryption with keyword search for restricted testability (PEKS-RT) scheme and show that our scheme is secure against keyword guessing attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.103-104
• /
• 2018

Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.424-425
• /
• 2018

Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.484-485
• /
• 2019

Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.565-566
• /
• 2021

Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3699-3719
• /
• 2017

Conjunctive keyword search encryption is an important technique for protecting sensitive personal health records that are outsourced to cloud servers. It has been extensively employed for cloud storage, which is a convenient storage option that saves bandwidth and economizes computing resources. However, the process of searching outsourced data may facilitate the leakage of sensitive personal information. Thus, an efficient data search approach with high security is critical. The multi-user search function is critical for personal health records (PHRs). To solve these problems, this paper proposes a novel multi-user conjunctive keyword search scheme (mNCKS) without a secure channel against keyword guessing attacks for personal health records, which is referred to as a secure channel-free mNCKS (SCF-mNCKS). The security of this scheme is demonstrated using the Decisional Bilinear Diffie-Hellman (DBDH) and Decision Linear (D-Linear) assumptions in the standard model. Comparisons are performed to demonstrate the security advantages of the SCF-mNCKS scheme and show that it has more functions than other schemes in the case of analogous efficiency.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2013

In this paper, we propose a keyword query processing technique based on semantic relationships for OWL data. The proposed keyword query processing technique can improve user's search satisfaction by performing two types of associative search. The first associative search uses information inferred by the relationships between classes or properties during keyword query processing. And it supports to search all information resources that are either directly or indirectly related with query keywords by semantic relationships between information resources. The second associative search returns not only information resources related with query keywords but also values of properties of them. We design a storage schema and index structures to support the proposed technique. And we propose evaluation functions to rank retrieved information resources according to three criteria. Finally, we evaluate the validity and accuracy of the proposed technique through experiments. The proposed technique can be utilized in a variety of fields, such as paper retrieval and multimedia retrieval.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.787-789
• /
• 2016

Today, need for a development system that provides the data to a chronic disease, and management has emerged. However, for most of the disease management system provides a wide range of data to the user and problem does not provide for important keyword or data existed. In this paper, analyzing the data for a disease through the R Programing it makes like the most relevant keyword in the illness to the user. This study was a system in which only the important parts when the user to manage their disease can be efficiently managed. By utilizing the proposed system to the user it is considered to be Except for unnecessary data or keyword and to be able to see the data and the keyword in need.

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.205-214
• /
• 2016

As a large amount of graph-structured data is widely used in various applications such as social networks, semantic web, and bio-informatics, keyword-based search over graph data has been getting a lot of attention. In this paper, we propose an efficient method for keyword search over graph data to find a set of top-k answers that are relevant as well as non-redundant in structure. We define a non-redundant answer structure for a keyword query and a relevance measure for the answer. We suggest a new indexing scheme on the relevant paths between nodes and keyword terms in the graph, and also propose a query processing algorithm to find top-k non-redundant answers efficiently by exploiting the pre-calculated indexes. We present effectiveness and efficiency of the proposed approach compared to the previous method by conducting an experiment using a real dataset.