• Journal of Information Management
• /
• v.31 no.4
• /
• pp.50-70
• /
• 2000

Since the contents of internet resources are beginning to include texts, images and sounds, different Web-based image search engines have been developed accordingly. It is a fact that these diversities of multimedia contents have made search process and retrieval of relevant information very difficult. The purpose of the study is to compare and evaluate its special features and performance of the existing image search engines in order to provide user help to select appropriate search engines. The study selected AV Photo Finder, Lycos MultiMedia, Amazing Picture Machine, Image Surfer, WebSeek, Ditto for comparison and evaluation because of their reputations of popularity among users of image search engines. The methodology of the study was to analyze previous related literature and establish criteria for the evaluation of image search engines. The study investigated characteristics, indexing methods, search capabilities, screen display and user interfaces of different search engines for the purpose of comparison of its performance. Finally, the study measured relative recall and precision ratios to evaluate their electiveness of retrieval under the experimental set up. Results of the comparative analysis in regard to its search performance are as follows. AV Photo Finder marked the highest rank among other image search engines. Ditto and WebSeek also showed comparatively high precision ratio. Lycos MultiMedia and Image Surfer follows after them. Amazing Picture Machine stowed the lowest in ranking.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.19-29
• /
• 2011

As people have heightened attention to blogs that are individual media, a variety rank algorithms was proposed for the blog search. These algorithms was modified for structural features of blogs that differ from typical web sites, and measured blogs' reputations or popularities based on the interaction results like links, comments or trackbacks and reflected in the search system. But actual blog search systems use not only blog-ranks but also search words, a time factor and so on. Nevertheless, those might not produce desirable results. In this paper, we suggest a topic-rank technique, which can find blogs that have significant degrees of association with topics. This technique is a method which ranks the relations between blogs and indexed words of blog posts as well as the topics representing blog posts. The blog rankings of correlations with search words are can be effectively computed in the blog retrieval by the proposed technique. After comparing precisions and coverage ratios of our blog retrieval system which applis our proposed topic-rank technique, we know that the performance of the blog retrieval system using topic-rank technique is more effective than others.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.83-88
• /
• 2016

Subtopic mining is the extraction and ranking of possible subtopics, which disambiguate and specify the search intentions of an input query in terms of relevance, popularity, and diversity. This paper describes the limitations of previous studies on the utilization of web resources, and proposes a subtopic mining method with a two-level hierarchy based on hierarchical search intentions and web resources, in order to overcome these limitations. Considering the characteristics of resources provided by the official subtopic mining task, we extract various second-level subtopics reflecting hierarchical search intentions from web documents, and expand and re-rank them using other provided resources. Terms in subtopics with wider search intentions are used to generate first-level subtopics. Our method performed better than state-of-the-art methods in almost every aspect.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.737-744
• /
• 2004

Retrieving relevant information well corresponding to the user`s request from web is a crucial task of search engines. However, most of conventional search engines based on pattern matching schemes to queries have a limitation that is not easy to provide results corresponding to the user`s request due to the uncertainty of queries. To overcome the limitation in this paper, we propose a framework for knowledge-based semantic meta-search engines with the following five processes: (i) Query formation, (ii) Query expansion, (iii) Searching, (iv) Ranking recreation, and (v) Knowledge base. From simulation results on english-based web documents, we can see that the Proposed knowledge-based semantic meta-search engine provides more correct and better searching results than those obtained by using the Google.

• Journal of the Korean Society for Library and Information Science
• /
• v.39 no.1
• /
• pp.265-278
• /
• 2005

This study examines web query types and topics submitted to Naver during one year period by analyzing query logs and click logs. Query logs capture queries users submitted to the system, and click logs consist of documents users clicked and viewed. This study presents a methodology to classify query types and topics. A method for click log analysis is also suggested. When classified by query types, there are more site search queries than content search queries. Queries about computer/internet. entertainment, shopping. game, education rank hightest. The implications for system designers and web content providers are discussed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3458-3464
• /
• 2010

Due to the recent tremendous growth of internet information, RSS, syndication technology provides internet users with a user-friendly information search. RSS enables you to automatically receive newly updated contents, so users do not need to constantly access web sites to obtain new information. This paper proposes the way of managing the web crawler, which collects the sites of RSS documents and helps the users efficiently use the RSS documents. And it also suggests the proper way of ranking the RSS documents based on the users' popularity. Users can efficiently search out the documents they need by using the proposed information searching methods.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.580-589
• /
• 2009

Today, most web pages are being created in the blogspace or evolving into the blogspace. A blog entry (blog page) includes non-traditional features of Web pages, such as trackback links, bloggers' authority, tags, and comments. Thus, the traditional rank algorithms are not proper to evaluate blog entries because those algorithms do not consider the blog specific features. In this paper, a new algorithm called "Blog-Rank" is proposed. This algorithm ranks blog entries by calculating bloggers' reputation scores, trackback scores, and comment scores based on the features of the blog entries. This algorithm is also applied to searching for information related to the users' queries in the blogspace. The experiment shows that it finds the much more relevant information than the traditional ranking algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.1-3
• /
• 2005

최근 웹 검색 분야에서는 검색 질을 높이기 위한 기법들이 많이 연구되어 왔으며, 대표적인 연구로는 제한 검색, focused crawling, 웹 클러스터링 등이 있다. 그러나 제한 검색은 검색 범위를 의미적으로 관련된 사이트들로 제한할 수 없으며, focused crawling은 질의 시점에 클러스터링하기 때문에 질의 처리 시간이 오래 걸리고, 웹 클러스터링은 많은 웹 페이지들을 대상으로 클러스터링하기 위한 오버헤드가 크다. 본 논문에서는 검색 범위를 특정 커뮤니티로 제한하여 검색 하는 커뮤니티 제한 검색과 커뮤니티를 구하는 방법으로 cluster crawler를 제안하여 이러한 문제점을 해결한다. 또한, 커뮤니티를 이용하여 PageRank를 2단계로 계산하는 방법을 제안한다. 제안된 방법은 첫 번째 과정에서 커뮤니티 단위로 지역적으로 PageRank를 계산한 후, 두 번째 과정에서 이를 바탕으로 전역적으로 PageRank론 계산한다. 제안된 방법은 Wang에 의해 제안된 방법에 비해 PageRank 근사치의 오차를 $59\%$ 정도로 줄일 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.744-768
• /
• 2016

As various pieces of information can be provided through the web, schemes that provide search results optimized for individual users are required in consideration of user preference. Since the existing social search schemes use users' profiles, the accuracy of the search deteriorates. They also decrease the reliability of a search result because they do not consider a search time. Therefore, a new social search scheme that considers temporal information as well as popularities and user preferences is required. In this paper, we propose a new mobile social search scheme considering popularities and user preferences based on temporal information. Popularity is calculated by collecting the visiting records of users, while user preference is generated by the actual visiting information among the search results. In order to extract meaningful information from the search target objects that have multiple attributes, a skyline processing method is used, and rank is given to the search results by combining the user preference and the popularity with the skyline processing result. To show the superiority of the proposed scheme, we conduct performance evaluations of the existing scheme and the proposed scheme.

• The Korea Journal of Herbology
• /
• v.31 no.4
• /
• pp.93-100
• /
• 2016

Objectives : The internet is the most common method to investigate information. It is showed that 75.2% of Internet users of 20s had health information search experience. So this study is aim to understanding of interest of public about the herbal medicine using internet search query volume data.Methods : The Naver that is the top internet portal web service of the Republic of Korea has provided an Internet search query volume data from January 2007 to the current through the Naver data lab (http://datalab.naver.com) service. We have collected search query volume data which was provided by the Naver in 606 herbal medicine names and sorted the data by peak and total search volume.Results : The most frequently searched herbal medicines which has less bias and sorted by peak search volume is 'wasong (와송)'. And the most frequently searched herbal medicines which has less bias and sorted by total search volume is 'hasuo (하수오)'.Conclustions : This study is showed that the rank of interest of public about herbal medicines. Among the above herbal medicines, some herbal medicines had supply issue. And there are some other herbal medicines that had very little demand in Korean medicine market, but highly interested public. So it is necessary to monitor for these herbal medicines which is highly interested of the public. Furthermore if the reliability of the data obtained on the basis of these studies, it is possible to be utilizing herbal medicine monitoring service.