• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.2
• /
• pp.119-128
• /
• 2013

Most internet users utilize internet portal search engines, such as Naver, Daum and Google nowadays. But since the results of internet portal search engines are based on universal criteria (e.g. search frequency by region or country), they do not consider personal interests. Namely, current search engines do not provide exact search results for homonym or polysemy because they try to serve universal users. In order to solve this problem, this research determines keyword importance and weight value for each individual search characteristics by collecting and analyzing customized keyword at external database. The customized keyword weight values are integrated with search engine results (e.g. PageRank), and the search ranks are rearranged. Using 50 web pages of Goolge search results for experiment and 6 web pages for customized keyword collection, the new customized search results are proved to be 90% match. Our personalization approach is not the way that users enter preference directly, but the way that system automatically collects and analyzes personal information and then reflects them for customized search results.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.8-15
• /
• 2003

Recently various of information suppliers provide information via WWW so the necessary of search engine grows larger. However the efficiency of most search engines is low comparatively because of using simple pattern match technique between user's query and web document. A specialized search engine returns the specialized information depend on each user's search goal. It is trend to develop specialized search engines in many countries. However, most such engines don't satisfy the user's needs. This paper proposes the specialized search engine for ocean information that uses user's query related with ocean and the association rules in web data mining can prove relation between web documents. So this search engine improved the recall of data and the precision in existent search method.

• Journal of Digital Convergence
• /
• v.17 no.1
• /
• pp.209-217
• /
• 2019

In this paper, the purpose of this paper is to lay the foundation for the search system by using and building an online search engine suitable for the search domain and enabling search, conversion, integration and sharing of information. It is to use the ontology to infer hierarchical relationships, deduce objects based on that layer, and extract attributes to search areas that are relevant to the data that the user wants. In order to search for information in this way, the information search system was implemented by entering key words related to 'qualifications'. The implemented system arranged the meaning and relationship of each attribute online so that the general public can search information quickly, easily, and accurately. In addition, the implementation results were compared with two different search engines. Comparable search engines are Naver and Daum, the two major search engines. The search engine of this study, which was built using an ontology suitable for the search domain to perform searches using the semantic web, was evaluated to have excellent results. However, it is thought that a more formalized online location is necessary to increase the accuracy and reliability of search engines and to include more comprehensive categories of search terms.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.33-41
• /
• 2003

It is not easy to find desired information in the world wide web. In this research, we introduce a notion of concept network that is useful in finding information if it is used in search engines that are specialized in domains such as medicine, law or engineering. The concept network that we propose is a network in which nodes represent significant concepts in the domain, and links represent relationships between the concepts. We may use the concept network constructor as a preprocessor to speci-alized search engines. When user enters a target word to find information, our system generates and displays a concept network in which nodes are con-cepts that are closely related with the target word. By reviewing the network, user may confirm that the target word is properly selected for his intention, otherwise he may replace the target word with better ones discovered in the network. In this research, we propose a detailed method to construct concept net-work, implemented a prototypical system that constructs concept networks, and illustrate its usefulness by demonstrating a practical case.

• Journal of Korean Library and Information Science Society
• /
• v.27
• /
• pp.457-483
• /
• 1997

This study was intended to compare the effectiveness of the Savvy search and Metacrawler in terms of the total number of relevant documents retrieved, precision, recall, and the number of deadlines. In addition, this study measured whether the Meta-search engine and general web search engines retrieved different web documents. As a result, Savvy search produced a higher precision and recall as compared with motacrawler search engine while the metacrawler had lower deadlines ration than savvy search, Also, Meta search engine was more effective than the general web search engine, The results show that the hybrid methodology of integrating a variety of web search engines can help solve retrieval effectiveness problems on the Internet.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2008

In the Web 2.0, besides more gaining information on the web, the number of web sites that take advantage of RSS increases explosively. Commonly each users search RSS channels through the web search engine before registering RSS channel's url to the RSS reader. Users judge whether the site is RSS channel or not and register an RSS channel's url through theirs interests. Because accomplished by users themselves, those processes conflict to user's convenience and quick consumption of information. Techniques of current search engines can't provide users with reliable RSS feed information as search results. In this paper, we analysis appropriateness of current search engines' techniques that offer users RSS feed search service and discuss their limitations. Also, we make up RSS feed database through classification of RSS tag being possible to search RSS feed information effectively and apply update rate of each RSS channel's feed to ranking algorithm providing more reliable search results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.598-601
• /
• 2003

As the amount of information on the WWW is increasing at a very high speed, the role of search engines has become more necessary and important. Yet, current popular search engines have a limitation of scalability because the more information those engines gather, the more garbage hit search results are produced, thus, XML based metadata has recently been the issue of much focus. Metadata is information about information, which using a small potion of data can express the fundamental information about other information. XML enables data to be expressed better organized and well structured. Moreover, the information in those current efficiency and make them disappointed by dead links and obsolete pages. this is because the information was collected and indexed in advance before users do searching. therefore, a mechanism is required that cam search from current and up-to-date information resources dynamically in real time to avoid retrieving out of data information. In this 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 discussed.

• Journal of the Korean Society for Library and Information Science
• /
• v.34 no.2
• /
• pp.117-133
• /
• 2000

This study evaluated two Korean search engines, Korean AltaVista and Naver, using user-based measures by Su(1998). Measures are based on four evaluation criteria: efficiency, precision, validity of the links, user satisfaction. For this study, users conducted searches on two engines with their own search queries and performed relevance judgement. Study results indicate that efficiency, validity of the links, and user' s satisfaction ratios of system features are significantly different between two search engines, although there is no significant difference of precision. This study can be used as a framework for usercentered evaluation and utilized to enhance Korean search engines.

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

There are lots of Web materials in the field of medicine and many search engines classify the medical materials on the Web through directories. But the organization of these directories are wanting in consistency and systematization. In order for manager of search engines to organize medical materials on the Web systematically, this paper suggests several guidelines. NLMC, a special classification system for medicine, need to be applied to develop directories of medicine in search engines. Also, items of the directories should be arranged based on the relevance of subjects among subfields of medical science. For classifying an item to several directories repeatedly, clear criteria should be established. In addition to, controlled vocabularies or glossaries for medicine such as MeSH and the English-Korean, Korean-English Medical Terminology Collection should be used for selection of the name of items in medical directories.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.345-354
• /
• 2002

HTML pages in the web change at any time. It could cause to decrease the functionality of meta-search engines which provide users with integrated results of search engines. To solve this problem, we propose an HTML pages modification detector. It utilities information of element positions in HTML pages and the modified Jaak Vilo algorithm. The HTML page modification detector uses patterns that represent the structure of HTML expressions occurring repeatedly in HTML pages. An experiment is carried out to verify the correctness of the modification detector.