• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.267-272
• /
• 2021

The current study aimed at measuring the rate of loss in search results of the actual number of publications in journals indexed by Web of Science when not using the accurate official authority name as indicated by the Ministry of Education. Conducting a search using the authority name does not always yield complete results of all existing publications. Researchers in Saudi universities tend to use up to 10 different random names of universities when searching. This interesting fact has prompted the authors of this paper to conduct a study on the search results of 30 Saudi universities using the authority name as indicated by the Ministry of Education. The statistical analyses revealed that there is a high tendency for the wrong use of authority names. Results show that 8 universities were not found in the search results. Furthermore, other universities are losing between 10 and 30% of search results that reflect the actual number of publications. Consequently, the rank of each university, as well as the general rank of Saudi universities in the Web of Science, will be affected.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.175-177
• /
• 2005

인터넷이 널리 활용되면서 웹 사이트의 수가 기하급수적으로 증가하는 동시에, 각각의 웹 사이트에 저장된 정보의 양도 급속히 증가하고 있다. 사용자가 이러한 웹 환경에서 원하는 정보를 효과적으로 찾을 수 있도록 하기 위해서는 크게 두 가지 요소가 중요한데, 첫 번째는 웹 검색 사이트에서 다양한 제한 검색 기능들을 제공하는 것이고 두 번째는 일반적인 웹 사이트에서 홈서치 서비스를 제공하는 것이다. 제한 검색은 각 웹 사이트의 정보를 중앙 데이타베이스에 저장하고, 검색 범위를 특정 범위로 한정시켜 검색 결과를 제공하는 방법으로, 이를 활용하면 일반적인 웹 사이트들도 저렴한 비용으로 방문자들에게 홈서치 서비스를 제공할 수 있다. 본 논문에서는 이러한 제한 검색 기능들과 홈서치 기능을 오디세우스 정보검색용 객체관계형 DBMS를 사용하여 실제로 어떻게 구현할 수 있는지에 대해 SQL 및 HTML 레벨에서 설명한다. 따라서, 본 논문에서 제안하는 구현 방법은 Oracle, MySQL등의 정보검색 기능이 제공되는 관계형 DBMS들에 대해 모두 적용될 수 있다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.14-28
• /
• 2009

The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.123-139
• /
• 2011

Web spam has a significant influence on the ranking quality of web search results because it promotes unimportant web pages. Therefore, web search engines need to filter web spam. web spam filtering is a concept that identifies spam pages - web pages contributing to web spam. TrustRank, Anti-TrustRank, Spam Mass, and Link Farm Spam are well-known web spam filtering algorithms in the research literature. The output of these algorithms depends upon the input seed. Thus, refinement in the input seed may lead to improvement in the quality of web spam filtering. In this paper, we propose seed refinement techniques for the four well-known spam filtering algorithms. Then, we modify algorithms, which we call modified spam filtering algorithms, by applying these techniques to the original ones. In addition, we propose a strategy to achieve better quality for web spam filtering. In this strategy, we consider the possibility that the modified algorithms may support one another if placed in appropriate succession. In the experiments we show the effect of seed refinement. For this goal, we first show that our modified algorithms outperform the respective original algorithms in terms of the quality of web spam filtering. Then, we show that the best succession significantly outperforms the best known original and the best modified algorithms by up to 1.38 times within typical value ranges of parameters in terms of recall while preserving precision.

• 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\%$ 정도로 줄일 수 있다.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.104-110
• /
• 2023

In the user-centered design paradigm, information systems are created entirely tailored to the users who will use them. When the functions of a complex system meet a simple user interface, users can use the system conveniently. While web personalization services are emerging as a major trend in portal services, portal companies are competing for a second service, such as introducing 'integrated communication platforms'. Until now, the role of the portal has been content and search, but this time, the goal is to create and provide the personalized services that users want through a single platform. Personalization service is a login-based cloud computing service. It has the characteristic of being able to enjoy the same experience at any time in any space with internet access. Personalized web services like this have the advantage of attracting highly loyal users, making them a new service trend that portal companies are paying attention to. Researchers spend a lot of time collecting research-related information by accessing multiple information sources. There is a need to automatically build interest information profiles for each researcher based on personal presentation materials (papers, research projects, patents). There is a need to provide an advanced customized information service that regularly provides the latest information matched with various information sources. Continuous modification and supplementation of each researcher's information profile of interest is the most important factor in increasing suitability when searching for information. As researchers' interest in unstructured information such as technology markets and research trends is gradually increasing from standardized academic information such as patents, it is necessary to expand information sources such as cutting-edge technology markets and research trends. Through this, it is possible to shorten the time required to search and obtain the latest information for research purposes. The interest information profile for each researcher that has already been established can be used in the future to determine the degree of relationship between researchers and to build a database. If this customized information service continues to be provided, it will be useful for research activities.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.320-324
• /
• 2008

웹 검색 결과 중, 어느 경우에나 첫 번째로 나타나는 결과 페이지가 모든 사용자에게 필요한 웹 페이지를 제공하지는 않는다. 그러한 경우, 사용자는 자신이 원하는 웹 페이지를 찾기 위해 질의를 수정하거나 다음 페이지로 넘기는 수고를 해야만 한다. 이러한 경우, 하위에 랭크 된 웹 페이지가 사용자에게 원하는 정보를 줄 수가 있는데, 본 논문에서는 하위 랭크이지만 사용자에게 원하는 정보를 제공할 수 있는 웹 페이지(Low-Ranked But, Potent Pages)를 효율적으로 찾을 수 있는 웹 검색 결과의 단계별 시각화를 제시한다. 실험에서는, 여러 질의를 통해 본 논문에서 제안하는 단계별 시각화 웹 검색을 평가한다.

• Restorative Dentistry and Endodontics
• /
• v.46 no.3
• /
• pp.46.1-46.9
• /
• 2021

The aim of this review was to evaluate the effects of different access cavity designs on endodontic treatment and tooth prognosis. Two independent reviewers conducted an unrestricted search of the relevant literature contained in the following electronic databases: PubMed, Science Direct, Scopus, Web of Science, and OpenGrey. The electronic search was supplemented by a manual search during the same time period. The reference lists of the articles that advanced to second-round screening were hand-searched to identify additional potential articles. Experts were also contacted in an effort to learn about possible unpublished or ongoing studies. The benefits of minimally invasive access (MIA) cavities are not yet fully supported by research data. There is no evidence that this approach can replace the traditional approach of straight-line access cavities. Guided endodontics is a new method for teeth with pulp canal calcification and apical infection, but there have been no cost-benefit investigations or time studies to verify these personal opinions. Although the purpose of MIA cavities is to reflect clinicians' interest in retaining a greater amount of the dental substance, traditional cavities are the safer method for effective instrument operation and the prevention of iatrogenic complications.

• Journal of the Korean Society for Library and Information Science
• /
• v.35 no.3
• /
• pp.151-172
• /
• 2001

Today, as we are going into digital information environment along with the development of information technology, there are changes in the style of information users. In particular. with the help of computer users can more easily access the original texts and approach to information providers than ever. At the same time, we are trying to use more efficiently some specialized contents in the web-pages. Contrary to traditional mediation-centered collection management, we start realizing that we are expected to bind selected contents with users who search these ones. In this study, I examined problems on collection management and proposed a more advanced content management skill as a solution for those problems. According to on-site questionnaires, The Main factors of user-centered content management are user factors, intermediary factors, and service ones.