• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.483-494
• /
• 2001

Most of hypertext retrieval models consider documents as independent entities. They ignore relationships between documents of link semantics. in an information retrieval system for hypertext documents, retrieval effectiveness can be improved when ling information is used. Previous link-based hypertext retrieval models ignore link information while indexing. They utilize link information to re-rank the retrieval results. Therefore they are limited that only the documents is result-set utilize link information. This paper utilizes link information when indexing. We present how to use term weighting and inLinks weighting for ranking the relevant documents. Experimental results show that recall and precision evaluation according to the link semantics and the comparison with previously link_based hypertext retrieval model.

• Journal of the Korean Society for information Management
• /
• v.20 no.3
• /
• pp.111-127
• /
• 2003

The purpose of this study is to ascertain whether event tracking is more effective in event retrieval than information filtering. This study examined the two techniques for event retrieval to suggest the more effective one. The event-retrieval performances of the event tracking technique based on a kNN classifier and the query-based information filtering technique were compared. Two event tracking experiments, one with the static training set and the other with the dynamic training set , were carried out. Two information filtering experiments, one with initial queries and the other with refined queries, were also carried out to evaluate the event-retrieval effectiveness. We found that the event tracking technique with the static training set performed better than on with the dynamic training set. It was also found that the information fitering technique using intial queries performed better than one using the refined queries. In conclusion, the comparison of the best cases of event tracking and information filtering revealed that the information filtering technique outperformed the event tracking technique in event retrieval.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.683-688
• /
• 2008

The emotional information processing is to simulate and recognize human sensibility, sensuality or emotion, to realize natural and harmonious human-machine interface. This paper proposes an emotion-based image retrieval method. In this method, user can choose a linguistic query among some emotional adjectives. Then the system shows some corresponding representative images that are pre-evaluated by experts. Again the user can select a representative one among the representative images to initiate traditional content-based image retrieval (CBIR). By this proposed method any CBIR can be easily expanded as emotion-based image retrieval. In CBIR of our system, we use several color and texture visual descriptors recommended by MPEG-7. We also propose a fuzzy similarity measure based on Choquet integral in the CBIR system. For the communication between system and user, a relevance feedback mechanism is used to represent human subjectivity in image retrieval. This can improve the performance of image retrieval, and also satisfy the user's individual preference.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.4
• /
• pp.99-124
• /
• 2015

As the improvement of digital technologies increases the use of images from various fields, the domain of image retrieval has evolved and become a growing topic of research in the Library and Information Science field. The purpose of this study is to identify the knowledge structure of the image retrieval domain by using the author co-citation analysis and author bibliographic coupling as analytical tools in order to understand the domain's past and present. The data set for this study is 245 articles with 8,031 cited articles in the field of image retrieval from 1998 to 2013, from the Web of Science citation database. According to the results of author co-citation analysis for the past of the image retrieval domain, our findings demonstrate that the intellectual structure of image retrieval in the LIS field consists of predominantly user-oriented approaches, but also includes some areas influenced by the CBIR area. More specifically, the user-oriented approach contains six specific areas which include image needs, information seeking, image needs and search behavior, image indexing and access, indexing of image collection, and web image search. On the other hand, for CBIR approaches, it contains feature-based image indexing, shape-based indexing, and IR & CBIR. The recent trends of image retrieval based on the results from author bibliographic coupling analysis show that the domain is expanding to emerging areas of medical images, multimedia, ontology- and tag-based indexing which thus reflects a new paradigm of information environment.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.101-108
• /
• 2010

In this paper, how fast and accurate the companies provides exponentially increasing information to the users is the most important in the corporate competitiveness. The enhancement of the retrieval relevance became the important element in enhancing company competitiveness and it is required to provide the services that are beyond simple retrieval service for good quality search service. This paper proposes the effective scheme that enhances retrieval relevance by utilizing registered tag information. By proposed scheme, we can overcome the limitations of retrieval relevance that usual search engines provide. And we compare the proposed scheme with existing web retrieval service on retrieval relevance evaluation and related search keyword.

• Journal of the Korean Society for Library and Information Science
• /
• v.17
• /
• pp.49-83
• /
• 1989

A Full text retrieval system is a natural language document retrieval system in which the full text of all documents in a collection is stored on a computer so that every word in every sentence of every document can be located by the machine. This kind of IR System is recently becoming rapidly available online in the field of legal, newspaper, journal and reference book indexing. Increased research interest has been in this field. In this paper, research on full text databases and retrieval systems are reviewed, directions for research in this field are speculated, questions in the field that need answering are considered, and variables affecting online full text retrieval and various role that variables play in a research study are described. Two obvious research questions in full text retrieval have been how full text retrieval performs and how to improve the retrieval performance of full text databases. Research to improve the retrieval performance has been incorporated with ranking or weighting algorithms based on word occurrences, combined menu-driven and query-driven systems, and improvement of computer architectures and record structure for databases. Recent increase in the number of full text databases with various sizes, forms and subject matters, and recent development in computer architecture artificial intelligence, and videodisc technology promise new direction of its research and scholarly growth. Studies on the interrelationship between every elements of the full text retrieval situation and the relationship between each elements and retrieval performance may give a professional view in theory and practice of full text retrieval.

• Journal of Korean Library and Information Science Society
• /
• v.31 no.2
• /
• pp.279-302
• /
• 2000

This study is to develop a new automatic system for the Korean thesaurus browser by which we can automatically control all the processes of searching queries such as, representation, generation, extension and construction of searching strategy and feedback searching. The system in this study is programmed by Delphi 4.0(PASCAL) and consists of database system, automatic indexing, clustering technique, establishing and expressing thesaurus, and automatic information retrieval technique. The results proved by this system are as follows: 1)By using the new automatic thesaurus browser developed by the new algorithm, we can perform information retrieval, automatic indexing, clustering technique, establishing and expressing thesaurus, information retrieval technique, and retrieval feedback. Thus it turns out that even the beginner user can easily access special terms about the field of a specific subject. 2) The thesaurus browser in this paper has such merits as the easiness of establishing, the convenience of using, and the good results of information retrieval in terms of the rate of speed, degree, and regeneration. Thus, it t m out very pragmatic.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.15 no.2
• /
• pp.97-115
• /
• 2004

The paper examined the concepts and features of content-based Image and Video retrieval systems. It then analyzed the retrieval performance of on five content_based retrieval systems in terms of usability and retrieval features. The results showed that the combination of content_based retrieval techniques and meta-data based retrieval will be able to improve the retrieval effectiveness.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.5 no.1
• /
• pp.85-105
• /
• 1981

Information is an essential factor leading the rapid progress which is one of the distinguished characteristics in modem society. As more information is required and as more is supplied by individuals, governmental units, businesses, and educational institutions, the greater will be the requirement for efficient methods of communication. One possibility for improving the information dissemination process is to use computers. The capabilities of such machine are beginning to be used in the process of Information storage, retrieval and dissemination. An important problems, that must be carefully examined is whether one technique for information retrieval is better for worse than another. This paper examines problem of how to evaluate an information retrieval system. One specific approach is a cost accounting model for use in studying how to minimize the cost of operating a mechanized retrieval system. Through the use of cost analysis, the model provides a method for comparative evaluation between systems. The general cost accounting model of the literature retrieval system being designed by this study are given below. 1. The total cost accounting model of the literature retrieval system. The total cost of the literature retrieval system = (the cost per unit of user time X the amount of user time) + ( the cost per unit of system time X the amount of system time) 2. System cost accounting model system cost = (the pre-search system cost per unit of time X time) + (the search system cost per unit of time X time) + (the post search system cost per unit of time X time) 1) Pre-search system cost per unit of time = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 2) Search system cost per unit of time = comparison cost + document representation cost. 3) Post-search system cost per unit of time. = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 3. User cost accounting model Total user cost = [pre-search user cost per unit of time X (time + additional time) ] + [search user cost per unit of time X (time + additional time) ] + [post-search user cost per unit of time X (time + additional time) ].

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.250-252
• /
• 2001

With the growth in computer and network technologies, some content-based music retrieval systems have been developed. However, their retrieval efficiency does not satisfy user's requirement yet. Of course users hope to have a more efficient and higher precision for music retrieval. In this paper so for these reasons, we Propose an efficient content-based music retrieval algorithm using melodies represented as music sequences. From the experimental result, it is shown that the proposed algorithm has higher exact rate than the related algorithms.