• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.266-272
• /
• 2002

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. And a manifest contents of query for special expert field so much worse 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. For example, in America, there are a site that searches only the recently updated headline news and the federal law and the government and and so on. 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 search engine uses the association rules in web data mining. So specialized search engine for ocean provides more information related to ocean because of raising recall about user's query

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2002.05a
• /
• pp.225-231
• /
• 2002

A specialized web search engine is an internet tool for detecting information in finite cyber world. It helps to retrieve necessary information in internet sites quickly In this paper, we design and implement a prototype search engine using method of mining for the association rule discovery. It consists of a search engine part and a search robot part. The search engine uses keyword method and is considered as various user oriented interface. The search robot fetches information related to ship parts n world wide web. The experiments show that our search engine(AISE) is superior to other search engines in collecting necessary informations.

• 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 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 KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.214-221
• /
• 2010

The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

• Proceedings of the CALSEC Conference
• /
• 1999.07b
• /
• pp.575-586
• /
• 1999

The advent of the Internet and the enormous increase in volume of electronically stored information (SGML, Image, Sound, etc.) has led to substantial work on IR(Information Retrieval). To service on the WWW, construction and retrieval technology of SGML, which is the fundamental standard data format for CALS/EC, is needed specially. Due to such a change, it becomes essential to change the existing paradigm of conventional information retrieval systems and to adopt new Internet service system with search engine, SGML browser and advanced Internet technology on WWW. KIPRIS(Korea Industrial Property Rights Information Service), which is the specialized and integrated Internet service systems in the field of industrial property rights information service, is trying to be a guide for our country to establish its technological competitiveness with providing the online service of high quality. The objective of the paper identifies features and technologies of KIPRIS IR(Information Retrieval) system based on WWW as follows. First, it describes the development background and process of KIPRIS. Second, it presents a fundamental technology that consists of IR(Information Retrieval) concept, BRS(Bibliographical Retrieval System) search engine, SGML implementation technologies and the Internet/WWW technologies. Third, it provides information about system configuration, architecture, and the features and characteristics of KIPRIS. Finally, the implemented KIPRIS system is introduced.

• Journal of Information Technology and Architecture
• /
• v.9 no.3
• /
• pp.323-331
• /
• 2012

With the advancement of the area of knowledge and information, Intellectual Property, especially, patents have captured attention more and more emergent. The increasing need for efficient way of patent information search has been essential, but the prevailing patent search engines have included too many noises for the results due to the Boolean models. This has occasioned too much time for the professional experts to investigate the results manually. In this paper, we reveal the differences between the conventional document search and patent search and analyze the limitations of existing patent search. Furthermore, we propose a specialized in patent search, so that the relationship between the keywords within each document and their significance within each patent document search keyword can be identified. Which in turn, the keywords and the relationships have been appointed a ranking for this patent in the upper ranks and the noise in the data sub-ranked. Therefore this approach is proposed to significantly reduce noise ratio of the data from the search results. Finally, in, we demonstrate the superiority of the proposed methodology by comparing the Kipris dataset.

• Archives of design research
• /
• v.17 no.4
• /
• pp.79-88
• /
• 2004

This study is aimed to grasp the organization of Internet information resources and to infer the characteristics of resource search engines so that criteria may be established to classify and evaluate Internet information resources. In addition, the author has compared and analyzed interior design classification systems of directory sites of each subject that provide classification system based on the Internet, foreign sites to be used to search for information, and domestic information-specialized sites in order to set up models of interior design classification systems of directories of each Web subject. The systems have been analyzed against such four measures as comprehensiveness of the subject scope, logicality of classification systems, preciseness of subject terms, and effectiveness of searches. Information of interior designs is mixed with that of related fields, and so its information search and classification are not organized systematically. The author has analyzed such a problem so as to present models of search engine classification systems for interior design information classification after considering both academic and practical aspects.

• The Journal of Pediatrics of Korean Medicine
• /
• v.27 no.3
• /
• pp.12-19
• /
• 2013

Objectives Children's unique taste bud often gives them difficult time to take oriental medicines. To overcome, survey was conducted focusing on useful and practical tips on how to take them. Methods The survey was carried out by posting mail questionnaire. Target clinics for the survey were selected by the internet search engine, Google, Daum, and Naver, and typing in "oriental treatment + pediatrics", "pediatrics + oriental medicine", "pediatric oriental clinic". 24 clinics were searched, but they were further narrowed down to the specialized pediatric oriental clinics. Also, total of 38 inquiry leaflets were distributed to 14 University Oriental Hospitals. Results If children refuse to take the medicine, mixture with sweeteners can be prescribed for them. Among them, oligosaccharide is the most recommended followed by sugar and honey. To avoid rejection to medication, use of different formulation, such as distillation medicine, soft X-Section, granulated medicine, and character printing can be used. Conclusions The most effective method is to investigate the mixture first, and then the alternative formulations.