• Journal of Korean Society of Rural Planning
• /
• v.20 no.3
• /
• pp.143-154
• /
• 2014

For the purpose of drawing a representative type of utilizing idle farmlands, this study collected and analyzed newspaper articles about cases of utilizing idle farmlands in the past decade using Internet search engines. Prior to this, it clarified a concept of idle farmlands to raise accuracy of searching articles, and selected NAVER as a search engine. It set "idle farmland", "abandoned land", and "utilizing" as basic search words in search option, and also set search period from 1st of January in 2004 to 31st of December in 2013. This study primarily searched 1,593 articles, and extracted 165 articles excluding overlapped and unrelated articles. Furthermore, it investigated extracted articles by date, media, headline, content of use, region(province), particular area(city and country), main agent, item and keyword 1, 2, 3 for proper use. This study also examined frequencies by year according to indoor and outdoor environment as well as regional differences through frequencies by regional groups and chronology. Furthermore, it drew a diagram of frequency flow of keyword 2, 3 with each keyword 1 as the central figure in order to draw various types of using idle farmlands. Through the diagrams, this study drew 9 using types such as (1) community service. agriculture type, (2) high income. agriculture type, (3) sightseeing. landscape. agriculture type, (4) livestock. agriculture type, (5) weekend farm type, (6) high income. woodland type, (7) ecology. landscape. woodland type, (8) agricultural work-study type, (9) ecological environment type.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2185-2196
• /
• 1997

The existing information retrieval systems utilize thesaurus in order to search and retrieve the desired information even when the query is not accurate. However the cost for implementing and maintaining thesaurus is very high and it can not guarantee complete success of search/retrieval operation. Thus in this paper, Information Retrieval System using Keyword Network(KNetIRS) which was designed and implemented to solve these problem is introduced. Keyword Network composed of keywords which were extracted from documents. KNetIRS finds the appropriate documents by using the Keyword Network which is based on the concept of "inverted file". In addition, KNetIRS can carry out query expansion by using the Keyword Network Browser, and deal with the conjunction of "정보 검색", "정보", and "검색", by defining and implementing spilt function.

• The Journal of the Korea Contents Association
• /
• v.15 no.11
• /
• pp.456-466
• /
• 2015

This study is focusing to the keyword and blog advertising marketing services that are implementing a viral marketing utilizing keyword searches of the search portal and advertiser's blogs with convergent way. Through a case study for the company operating the service to pinpoint consumers to the advertisers site by indirect exposure via keyword advertising blog at the top of the search results, we analyzed the primitive service operation model on transactional relationship between the business players. We have a research purpose to generate improvement alternatives for the company's keyword advertising marketing services and operation solution using the survey study on the service quality perception and the perceptional gap between user groups. As results of study, we founded 4 types of the service solution and 4 models of service operating architecture on the transactional relations, and we recommended some improvements on the service and solution operation based on the SERVQUAL questionnaire analysis of the difference between the ads sponsor group and ads agency group.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.307-312
• /
• 2012

For semantic search methods to provide more accurate results than keyword-based search in a logical representation that uses a knowledge base are being studied. Than most of the user to use formal query language and schema used to interpret the meaning of a user keyword. In this paper, we propose to expand the user query for semantic search. In the proposed system, user query expansion component and a component to adjust the results to interpret user queries to take advantage of the knowledge base associated with a search term. Finally, a user query semantic interpretation, the proposed scheme to verify the experimental results of the prototype system is described.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.31-38
• /
• 2009

To provide the privacy of a keyword, a public key encryption with keyword search(PEKS) firstly was propsed by Boneh et al. The PEKS scheme enables that an email sender sends an encrypted email with receiver's public key to an email server and a server can obtain the relation between the given encrypted email and an encrypted query generated by a receiver. In this email system, we easily consider the situation that a user sends the one identical encrypted email to multi-receiver like as group e-mail. Hwang and Lee proposed a searchable public key encryption considering multi-receivers. To reduce the size of transmission data and the server's computation is important issue in multi-receiver setting. In this paper, we propose an efficient searchable public key encryption for multi-receiver (mPEKS) which is more efficient and reduces the server's pairing computation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.35-44
• /
• 2009

To protect sensitive personal information, data will be stored in encrypted form. However in order to retrieve these encrypted data without decryption, there need efficient search methods to enable the retrieval of the encrypted data. Until now, a number of searchable encryption schemes have been proposed but these schemes are not suitable when dynamic users who have the permission to access the data share the encrypted data. Since, in previous searchable encryption schemes, only specific user who is the data owner in symmetric key settings or has the secret key corresponding to the public key for the encrypted data in asymmetric key settings can access to the encrypted data. To solve this problem, Stephen S. Yau et al. firstly proposed the controlled privacy preserving keyword search scheme which can control the search capabilities of users according to access policies of the data provider. However, this scheme has the problem that the privacy of the data retrievers can be breached. In this paper, we firstly analyze the weakness of Stephen S. Yau et al.'s scheme and propose privacy preserving keyword search with access control. Our proposed scheme preserves the privacy of data retrievers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1637-1646
• /
• 2009

Recently many researchers have been studying various methods for data integration. Among the integration methods that the researchers have studied, there are a method using metadata repository, and Topic Map which identifies the relationships between the data. This study suggests Meta-Topic Map to create Topic Map about search keyword by applying metadata and Topic Map, and the XMDR as a way to connect Meta-Topic Map with metadata in the legacy system. Considering the semantic relationship of user's keyword in the legacy system, the Meta-Topic Map provides the Topic Map format and generates the Topic Map about user's keyword. The XMDR performs structural integration through solving the problem of heterogeneity among metadata in the legacy system. The suggested svides isproves the interoperability among existing Relational Database constructed in the legacy system and the search efficiency and is efficient in expanding the system.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.209-220
• /
• 2017

As a semantic data is widely used in various applications such as Knowledge Bases and Semantic Web, needs for effective search over a large amount of RDF data have been increasing. Previous keyword search methods based on distinct root semantics only retrieve a set of answer trees having different root nodes. Thus, they often find answer trees with similar meanings or low query relevance together while those with the same root node cannot be retrieved together even if they have different meanings and high query relevance. We propose a new method to find diverse and relevant answers to the query by permitting duplication of root nodes among them. We present an efficient query processing algorithm using path indexes to find top-k answers given a maximum amount of root duplication a set of answer trees can have. We show by experiments using a real dataset that the proposed approach can produce effective answer trees which are less redundant in their content nodes and more relevant to the query than the previous method.

• Journal of the Korean Geosynthetics Society
• /
• v.22 no.2
• /
• pp.47-54
• /
• 2023

In this paper, we propose the technique of optimal search keyword extraction and retrieval for news article classification. The proposed technique was verified as an example of identifying trends related to North Korean construction. A representative Korean media platform, BigKinds, was used to select sample articles and extract keywords. The extracted keywords were vectorized using word embedding and based on this, the similarity between the extracted keywords was examined through cosine similarity. In addition, words with a similarity of 0.5 or higher were clustered based on the top 10 frequencies. Each cluster was formed as 'OR' between keywords inside the cluster and 'AND' between clusters according to the search form of the BigKinds. As a result of the in-depth analysis, it was confirmed that meaningful articles appropriate for the original purpose were extracted. This paper is significant in that it is possible to classify news articles suitable for the user's specific purpose without modifying the existing classification system and search form.