• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.134-137
• /
• 2003

Both browsing and retrieval with search engines are major operations that establish the interaction between users and the Web. Although both operations are usually combined to locate information from the Web, recent growth of the Web has overtaken the potential of this conventional interaction. This paper proposes the concept of Retrieve, Browse, and Analyze (RBA)-based interactions, as the improvement of the conventional Retrieve and Browse (RB)-based interaction. The prototype interface based on RBA-based interaction is also presented.

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

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.71-92
• /
• 2008

Currently, hotel search engines may help travelers find hotels, but the returned set of information is usually not satisfactory to them. It is because the engines do not understand what travelers want exactly and cannot deal with the travelers' interest which is expressed in various terms, even including some ambiguous ones. The objective of this research is to build hotel ontology using currently available semantic web technologies such as RDF, OWL and SWRL and to show how it can be used to help travelers find hotels of their interest. To that end, we analyzed available hotel-related ontologies and investigated typical terms which are used when searching for hotels in the Q&A communities. Based on the results of the analysis and investigation, we designed hotel domain ontology which consists of Objective Concepts Ontology(OCO), Universal Concepts Ontology(UCO), and Evaluation Concepts Ontology(ECO). To demonstrate the use of the ontology for a hotel search, we developed a Semantic Hotel Search System (SHSS).

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3732-3838
• /
• 2000

As the Internet sites and users have rapidly been increased, the development for search engines has also been accelerated to satisfy users' expectations. As the result, not only the action of collecting documents through many search engines gave hosts workload, but also regular updating all the information is needed since information is newly added. With the circumstances, the necessity of the technology to collect massive information in hosts has been increased for the speed which is a basic requisite of search systems, and for more accurate collection of documents. Also, the role of search engines grows bigger for Internet users' various demands and flexible process through World Wide Web. In this paper, we design and implement a robot agent and a remote control system which doesn't give an excessive workload on a target server and makes the collection of documents done in a short period by considering an average workload rate on the target server and the rate of the workload that a robot experience in collection time, after we compare and analyze the existing Robot Agent Systems and supplement their weak points.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.150-156
• /
• 2024

With the advent of personalized search engines, a myriad of approaches came into practice. With social media emergence the personalization was extended to different level. The main reason for this preference of personalized engine over traditional search was need of accurate and precise results. Due to paucity of time and patience users didn't want to surf several pages to find the result that suits them most. Personalized search engines could solve this problem effectively by understanding user through profiles and histories and thus diminishing uncertainty and ambiguity. But since several layers of personalization were added to basic search, the response time and resource requirement (for profile storage) increased manifold. So it's time to focus on optimizing the layered architectures of personalization. The paper presents a layout of the multi agent based personalized search engine that works on histories and profiles. Further to store the huge amount of data, distributed database is used at its core, so high availability, scaling, and geographic distribution are built in and easy to use. Initially results are retrieved using traditional search engine, after applying layer of personalization the results are provided to user. MongoDB is used to store profiles in flexible form thus improving the performance of the engine. Further Weighted Sum model is used to rank the pages in personalization layer.

• 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 Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.5-22
• /
• 1998

This study compared whether there are significant differences of searching characteristics between the subject specialists and professional searchers in education in terms of internet search engines. The major findings and conclusions from the study are as follows. Subject specialists used more search terms and Boolean operators and spent more times on the computers than professional searchers. However, professional searchers retrieved more relevant documents and had higher precision ratios than subject specialists.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.22-29
• /
• 2009

The World Wide Web has emerged as largest media which provides even a single user to market their products and publish desired information; on the other hand the user can access what kind of information abundantly enough as well. As a result web holds large amount of related information distributed over multiple web pages. The current search engines search for all the entered keywords in a single webpage and rank the resulting set of web pages as an answer to the user query. But this approach fails to retrieve the pair of web pages which contains more relevant information for users search. We introduce a new search paradigm which gives different weights to the query keywords according to their order of appearance. We propose a new arc weight measure that assigns more relevance to the pair of web pages with alternate keywords present so that the pair of web pages which contains related but distributed information can be presented to the user. Our measure proved to be effective on the similarity search in which the experimentation represented the e~arc ranking measure outperforming the conventional ones.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2009

In these days everyone search the information easily with the Internet as the rapid distribution and active usage of the Internet. The search engines were developed specially to accuracy of information retrieval. User search the information more quickly and variously with them. The search portal system will be embossed with representation and basic services. The Internet user needs the result of text, image and video, knowledge search. The keyword based search is used generally for getting result of the information retrieval and another method is category based search. This paper investigates the classification of knowledge search structure for oriental medicine in market leader of search portal system by ranking web site. As a result, each classification system is unified and there is a possibility of getting up a many confusion to the user who approaches with classification systematic search method. This treatise proposed the improved oriental medicine classification system of internet information retrieval in knowledge search area. if the service provider amends about the classification system, there will be able to guarantee the compatibility of data. Also the proper access path of the knowledge which seeks is secured to user.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.17-28
• /
• 2017

Recently, a study on data has been actively conducted because the value of the data has become more useful. Web crawler that is program of data collection recently spotlighted because it can take advantage of the various fields. Web crawler can be defined as a tool to analyze the web pages and collects the URL by traversing the web server in an automated manner. For the treatment of Big-data, distributed Web crawler is widely used which is based on the Hadoop MapReduce. But, it is difficult to use and has constraints on the performance. Apache spark that is the In-memory computing platform is an alternative to MapReduce. The search engine which is one of the main purposes of web crawler displays the information you search by keyword gathered by web crawler. If search engines implement a spark-based web crawler instead of traditional MapReduce-based web crawler, it would be a more rapid data collection.