• Journal of the Korean Society for information Management
• /
• v.17 no.4
• /
• pp.47-65
• /
• 2000

This study aims lo enhance the perfor~nance 01 concept-based information retr~eval through the use of the lraditional thesaurus which, clearly delmes relalions among terms. To achwe lhls, thc study purports to construcl relation-value-based, relalion-bad, and inlegated kumwledge bases tluough the use ol ihc lhcsau~ub. To cornpale and a~alyze retrieval perlor~nance among knowledge bases, two methods weue al~plied. Sequential bnb algorithm is ap~lied to the I-clation-ualue-based and intzgralcd knowledge base while heuristic bnb algorithm is applied to the relal~on-based knowlcdgc base.

• Proceedings of the CALSEC Conference
• /
• 1999.07b
• /
• pp.575-586
• /
• 1999

The advent of the Internet and the enormous increase in volume of electronically stored information (SGML, Image, Sound, etc.) has led to substantial work on IR(Information Retrieval). To service on the WWW, construction and retrieval technology of SGML, which is the fundamental standard data format for CALS/EC, is needed specially. Due to such a change, it becomes essential to change the existing paradigm of conventional information retrieval systems and to adopt new Internet service system with search engine, SGML browser and advanced Internet technology on WWW. KIPRIS(Korea Industrial Property Rights Information Service), which is the specialized and integrated Internet service systems in the field of industrial property rights information service, is trying to be a guide for our country to establish its technological competitiveness with providing the online service of high quality. The objective of the paper identifies features and technologies of KIPRIS IR(Information Retrieval) system based on WWW as follows. First, it describes the development background and process of KIPRIS. Second, it presents a fundamental technology that consists of IR(Information Retrieval) concept, BRS(Bibliographical Retrieval System) search engine, SGML implementation technologies and the Internet/WWW technologies. Third, it provides information about system configuration, architecture, and the features and characteristics of KIPRIS. Finally, the implemented KIPRIS system is introduced.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.964-973
• /
• 1999

본 논문에서는 퍼지 트리플을 사용하는 내용 기반 이미지 검색 방법을 제안한다. 이미지 내 객체들 사이의 공간 관계는 내용 기반 이미지 검색을 위해 사용되는 주요한 속성들 중의 하나이다. 그러나, 기존의 트리플을 이용한 이미지 검색 시스템들은 개념 기반 검색 방법을 지원하지 못하고, 방향들 사이의 근사 정합을 처리하지 못하는 문제점을 가지고 있다. 이 문제를 해결하기 위하여 본 논문에서는 개념 기반 정합과 근사 정합을 지원하는 퍼지 트리플을 이용한 이미지 검색 방법을 제안한다. 개념 기반 정합을 위해서는 퍼지 소속성 집합으로 이루어진 시소러스가 사용되며, 근사 정합을 위해서는 방향들 사이의 관계를 정량화 하기 위한 k-weight 함수가 각각 이용된다. 이 두 가지 정합은 퍼지 트리플 간의 퍼지 정합을 통하여 균일하게 지원될 수 있다. 본 논문에서는 또한, 개념 기반 정합과 근사 정합에 대한 검색 효과를 정량적으로 평가하는 작업을 수행한다. Abstract This paper proposes an inexact and a concept-based image match technique based on fuzzy triples. The most general method adopted to index and retrieve images based on this spatial structure may be triple framework. However, there are two significant drawbacks in this framework; one is that it can not support a concept-based image retrieval and the other is that it fails to deal with an inexact match among directions. To compensate these problems, we develope an image retrieval technique based on fuzzy triples to make the inexact and concept-based match possible. For the concept-based match, we employ a set of fuzzy membership functions structured like a thesaurus, whereas for the inexact match, we introduce k-weight functions to quantify the similarity between directions. In fuzzy triples, the two facilities are uniformly supported by fuzzy matching. In addition, we analyze the retrieval effectiveness of our framework regarding the degree of the conceptual matching and the inexact matching.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.601-616
• /
• 2004

Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.3-8
• /
• 2002

This paper introduces the basic concept of computational modeling of perception processes for multimedia data. Such processes are modeled as hierarchical inter- and intra- relationships amongst information in physical, physiological, psychological and cognitive layers in perception. Based on our framework, this paper gives the algorithms for content-based retrieval for multimedia database systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3806-3825
• /
• 2016

This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose we intent to hitch on BOVW and Mapreduce in 3D framework. Here, we tried to coalesce shape, color and texture for feature extraction. For this purpose, we have used combination of geometric & topological features for shape and 3D co-occurrence matrix for color and texture. After thriving extraction of local descriptors, TB-PCT (Threshold Based- Predictive Clustering Tree) algorithm is used to generate visual codebook. Further, matching is performed using soft weighting scheme with L₂ distance function. As a final step, retrieved results are ranked according to the Index value and produce results .In order to handle prodigious amount of data and Efficacious retrieval, we have incorporated HDFS in our Intellection. Using 3D video dataset, we fiture the performance of our proposed system which can pan out that the proposed work gives meticulous result and also reduce the time intricacy.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.4
• /
• pp.270-276
• /
• 2012

With the increase in amount of data and information available on the web, there have been high demands on personalized information retrieval services to provide context-aware services for the web users. This paper proposes a novel dynamic multi-agent context-awareness user profile construction method based on ontology to incorporate concepts and properties to model the user profile. This method comprehensively considers the frequency and the specific of the concept in one document and its corresponding domain ontology to construct the user profile, based on which, a fuzzy c-means clustering method is adopted to cluster the user's interest domain, and a dynamic update policy is adopted to continuously consider the change of the users' interest. The simulation result shows that along with the gradual perfection of the our user profile, our proposed system is better than traditional semantic based retrieval system in terms of the Recall Ratio and Precision Ratio.

• Journal of the Korean Society for information Management
• /
• v.17 no.3
• /
• pp.45-70
• /
• 2000

• Journal of the Korean Society for Library and Information Science
• /
• v.8
• /
• pp.73-101
• /
• 1981

Retrieval effectiveness is the principal criterion for measuring the performance of an information retrieval system. The effectiveness of a retrieval system depends primarily on the extent to which it can retrieve wanted documents without retrieving unwanted ones. So, ultimately, effectiveness is a function of the relevant and nonrelevant documents retrieved. Consequently, 'relevance' of information to the user's request has become one of the most fundamental concept encountered in the theory of information retrieval. Although there is at present no consensus as to how this notion should be defined, relevance has been widely used as a meaningful quantity and an adequate criterion for measures of the evaluation of retrieval effectiveness. The recall and precision among various parameters based on the 'two-by-two' table (or, contingency table) were major considerations in this paper, because it is assumed that recall and precision are sufficient for the measurement of effectiveness. Accordingly, different concepts of 'relevance' and 'pertinence' of documents to user requests and their proper usages were investigated even though the two terms have unfortunately been used rather loosely in the literature. In addition, a number of variables affecting the recall and precision values were discussed. Some conclusions derived from this study are as follows: Any notion of retrieval effectiveness is based on 'relevance' which itself is extremely difficult to define. Recall and precision are valuable concepts in the study of any information retrieval system. They are, however, not the only criteria by which a system may be judged. The recall-precision curve represents the average performance of any given system, and this may vary quite considerably in particular situations. Therefore, it is possible to some extent to vary the indexing policy, the indexing policy, the indexing language, or the search methodology to improve the performance of the system in terms of recall and precision. The 'inverse relationship' between average recall and precision could be accepted as the 'fundamental law of retrieval', and it should certainly be used as an aid to evaluation. Finally, there is a limit to the performance(in terms of effectiveness) achievable by an information retrieval system. That is : "Perfect retrieval is impossible."

• Journal of information and communication convergence engineering
• /
• v.1 no.3
• /
• pp.143-146
• /
• 2003

In the study, a new-concept search agent system for the WWW by using XML-based technology is proposed. The implementation of the prototype of this proposed system, the comparison with traditional search engines, and the evaluation of the prototype system are also.