• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1519-1533
• /
• 2004

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. In this paper, we apply the fuzzy retrieval model to solve the high time complexity of the retrieval system by constructing a reduced term set for the term's relatively importance degree. Furthermore, we perform a cluster retrieval to reflect the user's Query exactly through the similarity relation matrix satisfying the characteristics of the fuzzy compatibility relation. We have proven the performance of a proposed re-ranking model based on the similarity union of the fuzzy retrieval model and the document cluster retrieval model.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.737-747
• /
• 2019

Shape description is an important and fundamental issue in content-based image retrieval (CBIR), and a number of shape description methods have been reported in the literature. For shape description, both global information and local contour variations play important roles. In this paper a new included-angular ternary pattern (IATP) based shape descriptor is proposed for shape image retrieval. For each point on the shape contour, IATP is derived from its neighbor points, and IATP has good properties for shape description. IATP is intrinsically invariant to rotation, translation and scaling. To enhance the description capability, multiscale IATP histogram is presented to describe both local and global information of shape. Then multiscale IATP histogram is combined with included-angular histogram for efficient shape retrieval. In the matching stage, cosine distance is used to measure shape features' similarity. Image retrieval experiments are conducted on the standard MPEG-7 shape database and Swedish leaf database. And the shape image retrieval performance of the proposed method is compared with other shape descriptors using the standard evaluation method. The experimental results of shape retrieval indicate that the proposed method reaches higher precision at the same recall value compared with other description method.

• Journal of the Korean Society for information Management
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2004

For the users of information retrieval systems, natural language query is the more ideal interface, compared with keyword and boolean expressions. This paper proposes a retrieval technique with expanded keyword from syntactically-analyzed structures of natural language query as user input. Through the steps combining or splitting the compound nouns based on syntactic tree traversal of the query, and expanding the other-formed or shorten-formed into multiple keyword, it can enhance the precision and correctness of the retrieval system.

• Asia pacific journal of information systems
• /
• v.16 no.4
• /
• pp.203-215
• /
• 2006

The advent of KM(knowledge management) concept have led many organizations to seek an effective way to make use of their knowledge. But the absence of right tools for systematic handling of unstructured information makes it difficult to automatically retrieve and share relevant information that exactly meet user's needs. we propose a systematic method to enable content-based information retrieval from corpus of unstructured documents. In our method, a document is represented by using several key terms which are automatically selected based on their quantitative relevancy to the document. Basically, the relevancy is calculated by using a traditional TFIDF measure that are widely accepted in the related research, but to improve effectiveness of the measure, we exploited 'concept network' that represents term-term relationships. In particular, in constructing the concept network, we have also considered relative position of terms occurring in a document. A prototype system for experiment has been implemented. The experiment result shows that our approach can have higher performance over the conventional TFIDF method.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.407-412
• /
• 2002

With the increasing availability of information in electronic form, it becomes more important and feasible to have automatic methods to retrieve relevant information in the internet. A deficiency of traditional information retrieval systems is that search terms are often different from those indexed by the systems. Thus, user may either retrieve wrong information or miss what they really want. In this paper, we used an automatic query expansion based on term distribution to enhance the performance of information retrieval. Also this thesis proposed the method for setting the threshold according to area distribution in order to choose additional terns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.450-470
• /
• 2023

Traditional cloud computing faces some challenges such as huge energy consumption, network delay and single point of failure. Edge computing is a typical distributed processing platform which includes multiple edge servers closer to the users, thus is more robust and can provide real-time computing services. Although outsourcing data to edge servers can bring great convenience, it also brings serious security threats. In order to provide image retrieval while ensuring users' data privacy, a privacy preserving image retrieval scheme in edge environment is proposed. Considering the distributed characteristics of edge computing environment and the requirement for lightweight computing, we present a privacy-preserving image retrieval scheme in edge computing environment, which two or more "honest but curious" servers retrieve the image quickly and accurately without divulging the image content. Compared with other traditional schemes, the scheme consumes less computing resources and has higher computing efficiency, which is more suitable for resource-constrained edge computing environment. Experimental results show the algorithm has high security, retrieval accuracy and efficiency.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.789-796
• /
• 2005

Because existing information retrieval systems, in particular library retrieval systems, use 'exact keyword matching' with user's query, they present user with massive results including irrelevant information. So, a user spends extra effort and time to get the relevant information from the results. Thus, this paper will propose SULRM a Retrieval Model using Subject Classification Table, User profile, and LSI(Latent Semantic Indexing), to provide more relevant results. SULRM uses document filtering technique for classified data and document ranking technique for non-classified data in the results of keyword-based retrieval. Filtering technique uses Subject Classification Table, and ranking technique uses user profile and LSI. And, we have performed experiments on the performance of filtering technique, user profile updating method, and document ranking technique using the results of information retrieval system of our university' digital library system. In case that many documents are retrieved proposed techniques are able to provide user with filtered data and ranked data according to user's subject and preference.

• Journal of Information Science Theory and Practice
• /
• v.1 no.3
• /
• pp.33-46
• /
• 2013

Despite limited success, today's information retrieval (IR) systems are not intelligent or reliable. IR systems return poor search results when users formulate their information needs into incomplete or ambiguous queries (i.e., weak queries). Therefore, one of the main challenges in modern IR research is to provide consistent results across all queries by improving the performance on weak queries. However, existing IR approaches such as query expansion are not overly effective because they make little effort to analyze and exploit the meanings of the queries. Furthermore, word sense disambiguation approaches, which rely on textual context, are ineffective against weak queries that are typically short. Motivated by the demand for a robust IR system that can consistently provide highly accurate results, the proposed study implemented a novel topic detection that leveraged both the language model and structural knowledge of Wikipedia and systematically evaluated the effect of query disambiguation and topic-based retrieval approaches on TREC collections. The results not only confirm the effectiveness of the proposed topic detection and topic-based retrieval approaches but also demonstrate that query disambiguation does not improve IR as expected.

• Journal of Korean Library and Information Science Society
• /
• v.38 no.3
• /
• pp.223-246
• /
• 2007

This study examines the retrieval efficiency of the FRBR-based bibliographic retrieval system. To do this, we built two experimental retrieval systems(a FRBR-based system constructed through FRBRizing algorithms and an OPAC-based retrieval system) using 387 music materials coded in a KORMARC format. Next, we set up six hypotheses and compared these two systems in terms of recall, precision, and retrieval time using 28 participants and a questionnaire with 12 queries. The results show that the average recall value of the FRBR-based system Is higher than that of the OPAC system regardless of query types and the average precision and retrieval time values of manifestation queries of the OPAC system is more efficient that those of the FRBR-based system. This study results can be used to customize digital library interfaces as well as to improve the retrieval efficiency of the bibliographic retrieval system.

• Journal of Korean Library and Information Science Society
• /
• v.15
• /
• pp.207-243
• /
• 1988

This study is an attempt to furnish some helpful data for the maximum use of online information retrieval systems based on the comparative analysis of commands and operating terms employed by DIALOG, ORBIT and BRS which are three largest information retrieval systems in the world. To begin with, the historical development, service contents and retrieval functions of three systems were overviewed in the second chapter, on the basis of which the concrete functions and contents of the commands and the operating terms of the three systems were compared and analyzed one another. Commands were explained divided into basic and special ones. The basic commands subdivided into 44 items were put into the form of a diagram(Table 1). The special commands were first subdivided into search commnad, output-related commands and su n.0, pplementary commands, and then 14 items of which were comparatively analyzed and were represented as a chart(Table 2). In addition, any stand-alone commands employed by each system were also analyzed as a chart(Table 3). The Operating terms other than commands were subdivided into 16 items and were represented as a chart(Table 4). Password, inverted file, search step number in search session, etc were explained to the very detailed extent. A self-evident, single word is that the through understanding of commands is essential to the maximm use of all the functions of each of three systems.