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

• Journal of Digital Contents Society
• /
• v.11 no.1
• /
• pp.105-115
• /
• 2010

Search engines provide web documents that are related to user's query. However, using only the query terms that user provided, it is hard for search engines to know user's exact intention and provide the very matching web documents. To remedy this problem, search systems are needed to exploit personalized search technologies. In this paper, we propose not only a novel personalized query recommendation scheme based on folksonomy but also a new personalized search service architecture which reduces the risk of privacy violation while enabling search service providers to provide other various personalized services such as personalized advertisement.

• 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 Internet Computing and Services
• /
• v.3 no.2
• /
• pp.97-108
• /
• 2002

A user with a specific information need will often need to query several search engines before finding relevant documents. To address the problem of navigating the search engines, agents are used. In general, an agent is a program that can perform a particular task automatically, when appropriate or upon request by another program. In this paper, we design and implement the education information search system for children: using Information gathering agent that is called Edulnfo4k. The information gathering agent periodically visits several portal web sites for children: Ggureogi of Yahoo Korea, Junior of Naver and Gaegujaengi of Hanmir, collects the education or learning information for children, stores the collected information into database. Then, causal users can search the education information for children from database through a uniform user interface, conveniently. As the result, we know that Edulnfo4k provides integrated search without query in several search engines.

• International Journal of Contents
• /
• v.8 no.1
• /
• pp.100-107
• /
• 2012

While considerable research suggests that users' uncertainty gradually decreases, as they proceed through the information seeking process, others argue that it can arise at any stage of their information seeking process. Reflecting the latter view, this study examined user perceptions of uncertainty in the final stage of users' information seeking process, the stage of search results evaluation. Considering the significance of Web search engines for academic study, this study investigated the relevance decision stage of scholarly researchers in the field of science, who use Web search engines for their academic study. Based on the analysis of the users' uncertainty, this study provided implications to improve information systems and Web contents design.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.699-702
• /
• 2000

The Internet has become widely used in many countries. In particular, a new emerging technology, the WWW (World Wide Web), which has become a major application of the Internet, has been rapidly developed. As a result, there are hundreds of millions of URLs (Uniform Resource Locators) on the WWW, and the total number of URLs is still explosively increasing. To get information from the WWW, we generally use Internet search engines. However, we cannot always get the actual information we want. Accordingly, we have solved this problem by constructing a prototype system based on agents by programming language Java for constructing a more effective search engine. This so-called “intelligent agent system on WWW” deletes redundant HTML (Hyper Text Markup Language) files and exchanges information about the existence of URLs. And we found that our prototype system is more powerful and effective than conventional search engines.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.1
• /
• pp.71-89
• /
• 2005

This study discussed the problems of internet search engines or metadata and the necessity to catalog the digital information resources including information resources on the networks in libraries. The internet search engines or metadata make digital information resources indexed or organized immediately. But traditional library bibliographic tools like catalog should be described accurately and fully, and standardized in addition to the rapidity. Therefore from the library standpoint, digital information resources should be cataloged fully too. Cataloging cost of the increasing digital information resources can be reduced by cooperating and sharing the works among the libraries.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.6
• /
• pp.195-204
• /
• 2020

Nowadays there are over 1.6 billion web pages and it is hard to get necessary results that user wants. Most search engines allow you to search with logical form to get accurate results. However, normal users are not familiar to search information as logical form. Therefore, they search in natural language rather than in complicated logical form. In this paper there are some suggestions to improve quality of searching results, converting natural language input by the user into logical form which can able to use advanced search engine. Users tend to make short searches due to the 'Simplicity' which is one of the features of the search form. Therefore we suggest history retrieval method; advanced version of previous suggestion to provide convenience to the normal users. We had improvement on accuracy of the search results converting natural languages to logical form and also can contain every keyword without missing any keywords using searching methods on this paper. It is expected that these search methods will contribute to the development of search engines.

• Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.161-172
• /
• 2014

This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.