• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1195-1214
• /
• 2018

Typical search engines may not be the most efficient means of returning images in accordance with user requirements. With the help of semantic web technology, it is possible to search through images more precisely in any required domain, because the images are annotated according to a custom-built ontology. With appropriate annotations, a search can then, return images according to the context. This paper reports on the design of a tourism ontology relevant to touristic images. In particular, the image features and the meaning of the images are described using various properties, along with other types of information relevant to tourist attractions using the OWL language. The methodology used is described, commencing with building an image and tourism corpus, creating the ontology, and developing the search engine. The system was tested through a case study involving the western region of Thailand. The user can search specifying the specific class of image or they can use text-based searches. The results are ranked using weighted scores based on kinds of properties. The precision and recall of the prototype system was measured to show its efficiency. User satisfaction was also evaluated, was also performed and was found to be high.

• 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.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.05a
• /
• pp.316-320
• /
• 2005

We developed Intelligent Product Search Agent based on SWRL, and this agent can search product information with knowledge(facts and rules) on the web, implement price comparison for searched products considering delivery rates. Existing keyword based product search engines is poor at searching intent products though a user has already prefect knowledge about intent produces. Furthermore if a user has insufficient knowledge, it is impossible to implement search. Also, existing price comparison shopping mall gives users comparison service considering total price(product prices, taxes, delivery rates), this service is valid to single product and has limitations of system expansion and up-dating because of not rule base but programming base. If there is appropriate knowledge on the Semantic web and this makes product information retrieval possible, above problems can be solved clearly. In this research, we developed Intelligent Product Search Agent based on SWRL that can search product information efficiently by making agent to handle facts and rules by itself.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.3
• /
• pp.75-108
• /
• 1997

The purpose of the article is to help users to select appropriate Korean WWW search tools and to retrieve Web documents for their information needs by using them effectively. It analyzes the characteristics, functions, and advantages and disadvatages of each search tool, while search tools are divided broadly by two categories-subject directory services (Kor-seek, DIR, ZIP, Netquest21, Simmany) and keyword search engines (Simmany, Kachine, Jungbotamjung, Anysearch, Unifinder, Webglider, Missdachanni). It provides the selection criteria of search tools for users who have information needs. In addition, the study also attempts to contribute to the improvements in designing Korean WWW search tools, as investigating their shortcomings.

• Journal of the Korean Society for Library and Information Science
• /
• v.33 no.1
• /
• pp.113-128
• /
• 1999

Although traditional printed materials m indexed and abstracted by human beings with tools like thesaurus or controlled vocabulary, information resources on World Wide Web(WWW) are automatically indexed and abstracted without human beings efforts. It would be useful to investigate what major differences are in processes and in elements of indexing and abstracting between traditional printed materials and information resources on WWW. After discussing how WWW search engines work, six major WWW search engines were chosen for this study. Then, 17 indexing elements, 11 abstracting elements, and 2 meta elements were examined. Overall trends and issues for the future development of indexing and abstracting on WWW are also discussed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.880-886
• /
• 2016

With lots of information occurring on the Internet, the search engine plays a role in gathering the scattered information on the Internet. Some search engines show not only search result pages including search keyword but also search result numbers of the keyword. The number of keyword searching result provided by the Google search engine can be utilized to identify overall trends for this search word on the internet. This paper is aimed designing and realizing the system which can efficiently manage the number of searching result provided by Google search engine. This paper proposed system operates by Web, and consist of search agent, storage node, and search node, manage keyword and search result, numbers, and executing search. The proposed system make the results such as search keywords, the number of searching, NGD(Normalized Google Distance) that is the distance between two keywords in Google area.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.321-326
• /
• 2009

Since the existing Web search engines don't sufficiently reflect user's search intent, it is very difficult to find out accurate information that users want to find. Therefore, a lot of researches, study for personalized search, to enhance satisfaction of Web search results by analyzing search pattern and applying it to search are in progress in these days. Web searchers can more efficiently find information and easily obtain appropriate information through the personalized search. In this paper, we propose the personalized search based on community through the analysis of web users' query patterns and interest. Consequently, when applying query frequency, interest and community to web search, we are able to the confirm that the search results which hit to the search intent of the individual are provided.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.129-143
• /
• 2012

Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1093-1102
• /
• 2003

The dynamic nature of the World Wide Web challenges Search engines to find relevant and recent pages. Obtaining important pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. In this paper we study way spiders that should visit the URLs in order to obtain more “important” pages first. We define and apply several metrics, ranking formula for improving crawling results. The comparison between our result and Breadth-first Search (BFS) method shows the efficiency of our experiment system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1028-1034
• /
• 2004

As use of internet generalized laying stress on WWW(World Wide Web) service of multimedia based recently, we could acquire many informations that exist to all over the world's computer network. It is risen to important problem that use of internet acquires correct information rapidly on modem society which is generalized. This paper designed internet search engine and understand structure of that drawing URL which is optimized, and secure embodiment technology using OOPL(Object-Oriented Programming Language). Also, compare with existent domestic manufacture search engines and system that propose showed that the bad link rate is improved in this paper.