• Journal of KIISE:Software and Applications
• /
• v.31 no.8
• /
• pp.1101-1112
• /
• 2004

In this paper, we propose a Web page weighting scheme using the user preference in each sense of query word to improve the performance of Web search. Generally search engines assign weights to a web page by using relevancy only, which is obtained by comparing the query word and the words in a web page. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy In this paper we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to senses, so that more accurate search is possible. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

• Journal of the Korean Society for information Management
• /
• v.15 no.2
• /
• pp.47-68
• /
• 1998

Although the research information resources on Internet are spread out on thousands of computers, it is not always easy to get them on the right time by the right manner. The purpose of this study is to use DDC(Dewey Decimal Classification) scheme in subject-based directory search engine for research information resourcees to aid retrieval on the Internet. For the design of classification code, this study followed 'systematic order' of DDC to arrange subjects from the general o the specific in a logical order, and for the design of classification dictionary, 'Relative Index' of DDC was used to bring together the various aspects of subjects.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.1
• /
• pp.153-184
• /
• 1997

The importance of WWW search services is increasing as Internet information resources explode. An evaluation of current 9 search services was first conducted by comparing descriptively the features concerning indexing, searching, and ranking of search results. Secondly, a couple of search queries were used to evaluate search performance of those services by the measures of retrieval effectiveness. the degree of overlap in searching sites, and the degree of similarity between services. In this experiment, Alta Vista, HotBot and Open Text Index showed better results for the retrieval effectiveness. The level of similarity among the 9 search services was extremely low.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.369-380
• /
• 2004

In this paper, we propose a web page weighting scheme based on WordNet-based collaborative evaluation and hyperlink to improve the precision of web search engine. Generally search engines use keyword matching to decide web page ranking. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy. In this paper, we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to lenses, so that more accurate search is possible. Weighting of each web page by using collaborative evaluation and hyperlink is reflected in ranking. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1404-1417
• /
• 1998

Currently, there exists two different methods for database retrieval in the internet. First is to use the search engine and the second is to use the plug-in or ActiveX technology, If a search engine, which makes use of indices built from keywords of simple text data in order to do a search, is used when accessing a database, first it is not possible to access more than one database at a time, second it is also not possible to support various conditional retrievals as in using query language, and third the set of data received might include many unwanted data, in other words, precision rate might be relatively low. Plug in or Active technology make use of Web browset to execute chents' query in order to do a database retrieval. Problems associated with this is that it is not possible to activate more than one DBMS simultaneously even if they are of the same data model. sefond it is not possible to execute a user query other than the ones thai arc previou sly defined by the client program In this paper, to resolve those aforementioned problems we design and implement database retrieval system using a virtual database, which makes it possible to provide direct query jntertacc through the conventional Web browser. We assume that the virtual database is designed and aggregated from more than one relational database using the same data model.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1997.08a
• /
• pp.37-53
• /
• 1997

The huge size of Internet does not allow ordinary information seekers to search information with ease. Now, it is almost impossible to navigate the ocean of information without effective search tools. Web search engine has been the most effective technology for information retrieval on WWW. But recently, the need for new search tools on WWW or Internet has increased drastically. Currently, there are many on-going researches on the related topics. In this survey, we categorize the new search tools into four types: monitoring systems, filtering systems, browsing assistant systems, recommending systems. These example systems are examined. We are especially interested in WWW information filtering. It is studied how to apply the information filtering techniques to WWW, The application is not so straightforward like Email, Newswire filtering systems. As a result of this study, a simple WWW information filtering system is proposed.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.135-150
• /
• 2005

In this paper, we propose an integrated information retrieval system for distributed multiple KRISTAL-2002 systems by using the metadata information. This system integrates current systems for different areas or systems for the same area with the different schemas so that the users can get the answers by once from the whole systems. The proposed system composes of the Source Server Manager(SSM) supporting the mapping between the integrated metadata database and source server, the Integrated Metadata Manager(ISM) for registering and managing the metadata and schema mapping, the Distributed Query Processor (DQP) for processing the user query into the source server query, the Distributed Data Set Integrated Manager(DDSIM) for transforming the total retrieval results by merging to the HTML format, and the integrated retrieval engine for managing the query results. It is assumed that the integrated metadata follows ISO/IEC 11179 metadata registration procedure with the metadata registry system which is a subsystem of the proposed system. There are two kinds of queries for users; the basic query and the detailed query. The users may select the databases or organizations for results by their own choices before giving the queries. The proposed system has been developed over KRISTAL-2002 systems with $Visual C^{++}\;and\;C^{++}-CGI$ and tested and verified with the six database systems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1123-1126
• /
• 2001

현재 인터넷상에는 수많은 정보가 산재되어 있고, 사용자가 원하는 정보를 검색해주는 수많은 검색엔진들이 개발되어 사용되고 있다. 하지만 기존의 검색엔진은 사용자들이 입력한 질의어만을 가지고 단지 시소러스 사선만을 참조해서 검색결과를 나타내는 게 대부분이이서 사용자의 구미에 맞는 정보를 찾는데 어려운 점이 많았다. 이에 본 논문에서는 MetaDB안에 있는 보편적 Meta 데이터를 이용, 사용자의 간단한 정보 입력과 합께 퍼지연산을 적용시킨 매칭기법으로 사용자의 특성에 맞는 검색결과를 도출하는 퍼지 검색시스템을 제안한다.

• Journal of the Korean Society for information Management
• /
• v.28 no.2
• /
• pp.177-193
• /
• 2011

This study constructed an ontology targeting journal articles and evaluated its performance. Also, the performance of a triple structure ontology was compared with the knowledge base of an inverted index file designed for a simple keyword search engine. The coverage was three years of articles published in the Journal of the Korean Society for Information Management from 2007 to 2009. Protege was used to construct an ontology, whilst utilizing an inverted index file to compare performance. The concept ontology was manually established, and the bibliography ontology was automatically constructed to produce an OWL concept ontology and an OWL bibliography ontology, respectively. This study compared the performance of the knowledge base of the ontology, using the Jena search engine with the performance of an inverted index file using the Lucene search engine. As a result, The Lucene showed higher precision rate, but Jena showed higher recall rate.

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