• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.1-8
• /
• 1999

To provide information service with time constraints, it is required to support real-time information system for retrieval and update of distributed information. In this paper, we propose an information retrieval system model for internet. We design and implement a Domain Administration-Oriented search engine for the regional information network. Accordingly, an intelligent robot gathering and updating distributed information is implemented. And, in order to improves the performance of the system, a realtime robot control policy based on the loads of network and web server is proposed.

• Asia pacific journal of information systems
• /
• v.25 no.2
• /
• pp.337-355
• /
• 2015

The Internet has become one of the most important channels for people to communicate and for companies to implement their sales promotion activities, such as advertising. Marketing and advertising attempt to influence customers' attitude to persuade them to choose to buy the advertisers' products instead of the competitors'. With the different forms of online marketing, such as search engine marketing, email marketing, and mobile marketing, advertisers can find more effective strategies to attract the attention of more targeted audiences. With the emergence of the social web (web 2.0), a new platform was introduced called social networks. This paper presents the current work in internet marketing activities until web 2.0, and conducts a social network analysis to aid in data extraction. Marketing and advertising companies have understood the power of information for a very long time. The more knowledge these companies have on the demographics, consumer habits, and preferences of particular customer types, the more they can tailor their product offerings, and the more sales they can make. This paper aims to understand the internet marketing concepts as well as present challenges and work directions in internet marketing.

• Journal of the Korean Society for information Management
• /
• v.17 no.1
• /
• pp.103-127
• /
• 2000

This study compared finding economic and energy information on the WWW to finding the same information on DIALOG, a traditional search service. Professional searchers answered 20 questions for end users using either of DIALOG and one Internet database (general search engine or Web database). The relevance of the results in both sets of answers was ranked by searchers and end-users, respectively. The study found that searching for information on the Web took at least twice as long as it did when using DIALOG. Relevance rating was a little higher for materials found on DIALOG. However, the relevance rating difference between two systems was not so higher than we expected. From the research results, we conclude that Internet database including Web database and general search engines is providing valuable information of economic and energy subject areas.

• Journal of the Korean Society for information Management
• /
• v.23 no.2
• /
• pp.61-79
• /
• 2006

To come up with the recommendations to improve the patent & trademark retrieval efficiency, 100,016 patent & trademark search requests by 17,559 unique users over a period of 193 days were analyzed. By analyzing 2,202 multi-query sessions, where one user issuing two or more queries consecutively, we discovered a number of retrieval efficiency improvements clues. The session analysis result also led to suggestions for new system features to help users reformulating queries. The patent & trademark retrieval users were found to be similar to the typical web users in certain aspects especially in issuing short queries. However, we also found that the patent & trademark retrieval users used Boolean operators more than the typical web search users. By analyzing the multi-query sessions, we found that the users had five intentions in reformulating queries such as paraphrasing, specialization, generalization, alternation, and interruption, which were also used by the web search engine users.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.6
• /
• pp.579-587
• /
• 2008

In collaborative environment, since each agent generally uses different words for the same meaning, there is an obstacle for information sharing. In collaborative product development environment, each agent has different words for representing same product information. As a result, it is hard to share product information in this situation. For solving this problem, semantic-based product information is needed. In this paper, a ontology-based semantic searching system which is able to interact with legacy PDM systems is proposed for product information sharing in collaborative environment Product ontology is represented with OWL format, and the product ontology is processed by Pellet reasoning engine for semantic searching. The system is implemented as a web service which can be integrated with other systems. This paper also introduces the approach with which a PDM system provides a function of semantic search with this search system.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.180-192
• /
• 2000

Recently, the component technology has played a main role in software reuse. It has changed the code-based reuse into the binary code-based reuse, because components can be easily combined into the developing software only through component interfaces. Since components and component users have increased rapidly, it is necessary that the users of components search for the most proper components for HTML among the enormous number of components on the Internet. It is desirable to use web-document-typed specifications for component specifications on the Internet. This paper proposes to use XML component specifications instead of HTML specifications, because it is impossible to represent the semantics of contexts using HTML. We also propose the XML context-search method based on XML component specifications. Component users use the contexts for the component properties and the terms for the values of component properties in their queries for searching components. The index structure for the context-based search method is the inverted file indexing structure of term-context-component specification. Not only an XML context-based search method but also a variety of search methods based on context-based search, such as keyword, search, faceted search, and browsing search method, are provided for the convenience of users. We use the 3-layer architecture, with an interface layer, a query expansion layer, and an XML search engine layer, of the search engine for the efficient index scheme. In this paper, an XML DTD(Document Type Definition) for component specification is defined and the experimental results of comparing search performance of XML with HTML are discussed.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.54-62
• /
• 2009

To avoid the redundant investment on the project selection process, it is necessary to check whether the submitted research topics have been proposed or carried out at other institutions before. This is possible through the search engines adopted by the keyword matching algorithm which is based on boolean techniques in national-sized research results database. Even though the accuracy and speed of information retrieval have been improved, they still have fundamental limits caused by keyword matching. This paper examines implemented TFIDF-based algorithm, and shows an experiment in search engine to retrieve and give the order of priority for similar and redundant documents compared with research proposals, In addition to generic TFIDF algorithm, feature weighting and K-Nearest Neighbors classification methods are implemented in this algorithm. The documents are extracted from NDSL(National Digital Science Library) web directory service to test the algorithm.

• Journal of Advanced Navigation Technology
• /
• v.22 no.5
• /
• pp.456-461
• /
• 2018

Until the 4th Industrial Revolution fused the Web with diverse technologies, the only factor in evaluating the performance of a Web application was the loading speed of the Web application. Therefore, most existing Web application performance analysis tools focus on the speed at which Web applications run in a Web browser. However, the web is now being used not only in a simple web browser but also in a variety of services. So, in addition to simple speed, there are more elements to be checked to evaluate web applications. Therefore, in this paper, we design a server to perform web application performance analysis considering progressive web app, accessibility, best practice, and search engine optimization as well as the above mentioned speed. Also, we realize a REST API based server that can provide web application performance services without being affected by user's devices or environment.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2003.08a
• /
• pp.143-152
• /
• 2003

본 연구는 인터넷 환경에 따른 정보의 지식화현상과 지식경영 추세에 따라 새롭게 등장한 웹 검색엔진의 지식검색커뮤니티 기반 지식관리에 관한 연구이다. 아직까지 지식검색커뮤니티에 대한 연구를 거의 찾아볼 수 없는 상황에서, 본 연구는 네이버의 ‘지식 iN’, 야후의 ‘지식검색’, 엠파스의 ‘지식거래소’를 대상으로 웹 검색엔진의 지식검색커뮤니티를 살펴보았다. 지식의 개념을 통해 지식 순환과정을 고찰하였고, 순환과정의 각 단계별로 지식관리를 연구하였다. 더불어 커뮤니티 기반의 지식창출과 지식공유단계에 대한 이용자연구를 하고자 한다. 이를 바탕으로 보다 건전하고 활발한 지식공유문화조성을 위한 지식검색커뮤니티의 활성화 방안을 제안하고자 한다.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.227-237
• /
• 2004

While the WWW offers an incredibly rich base of information, organized as a hypertext, it does not provide a uniform and efficient way to retrieve specific information. When one tries to find information entering several query terms into a search engine, the highly-ranked pages in the result usually contain many irrelevant or useless pages. The problem is that single-term queries do not contain sufficient information to specify exactly which web pages are needed by the user. The purpose of this paper is to describe the employment of association rules in data mining for developing networks and computing associative coefficient among the terms. And this paper shows how the dynamic query expansion and/or reduction can be performed in information retrieval.