• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.268-274
• /
• 2005

Since introduction of the PageRank technique, it is known that it ranks web pages effectively In spite of its usefulness, we found a computational drawback, which we call norm-leak, that PageRank values become smaller than they should be in some cases. We present an improved PageRank algorithm that computes the PageRank values of the web pages correctly as well as its efficient implementation. Experimental results, in which over 67 million real web pages are used, are also presented.

• Kyungpook Mathematical Journal
• /
• v.49 no.1
• /
• pp.183-193
• /
• 2009

Pseudo-rank functions on Rickart *-rings are introduced and their properties are studied.

• Journal of Korean Academy of Nursing Administration
• /
• v.9 no.4
• /
• pp.529-539
• /
• 2003

Purpose : The objective of this research is to explore the job satisfaction of clinical nurses by the rank of nurse staffing in order to provide effective management for nurses. Method : The research has been conducted on three hundred twenty nurses working at tertiary eight hospitals which were from 2nd rank of nurse staffing to 5th. rank of nurse staffing in Seoul, from August 1 to September 30 of 2003, through survey. For the experimental tools, used Park-Yoon's job satisfaction for nurses(1992) which was modified Stamp's job satisfaction test(1978). The acquired data were analyzed through SPSS program using descriptive method, $x^2$-test, ANCOVA, and LSD. Results : Overall job satisfaction of nurses showed fairly high level of 3.17; in the order of high score, 3.84 for interaction, 3.00 for autonomy, 2.63 for administration. Analysis based of the rank of nurse staffing showed that hospitals of 2nd rank and 3rd. rank of nurse staffing which were higher ratio of patient vs nurse were more satisfied with nurses' job satisfaction than other nurses who were 4th. rank and 5th. rank of nurse staffing. Conclusion : The result of this study revealed that hospital which was higher the rank of nurse staffing was more influenced of nurses' job satisfaction and especially interaction, administration and autonomy which were sub-category of job satisfaction were different among the ranks of nurse staffing.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.745-754
• /
• 2002

The Google search site (http://www.google.com), which was introduced in 1998, implemented the PageRank algorithm for the first time. PageRank is a ranking method based on the link structure of the Web pages. Even though PageRank has been implemented and being used in various commercial search engines, implementation details did not get documented well, primarily due to business reasons. Implementation techniques introduced in [4,8] are not sufficient to produce PageRank values of Web pages. This paper explains the techniques[4,8], and suggests major data structure and four implementation techniques in order to apply the PageRank algorithm. The paper helps understand the methods of applying PageRank algorithm by means of showing a real system that produces PageRank values of Web pages.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.157-163
• /
• 2018

People who use SNS publish their diverse ideas on SNS every day. The data posted on the SNS contains many people's thoughts and opinions. In particular, popular keywords served on Twitter compile the number of frequently appearing words in user posts and rank them. However, this method is sensitive to unnecessary data simply by listing duplicate words. The proposed method determines the ranking based on the topic of the word using the relationship diagram between words, so that the influence of unnecessary data is less and the main word can be stably extracted. For the performance comparison in terms of the descending keyword rank and the ratios of meaningless keywords among high rank 20 keywords, we make a comparison between the proposed scheme which is based on morphological analysis and PageRank, and the existing scheme which is based on the number of appearances. As a result, the proposed scheme and the existing scheme have included 55% and 70% of meaningless keywords among high rank 20 keywords, respectively, where the proposed scheme is improved about 15% compared with the existing scheme.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.467-474
• /
• 2018

To organize and document the contents of meetings and discussions is very important in various tasks. However, in the past, people had to manually organize the contents themselves. In this paper, we describe the development of a system that generates the meeting minutes automatically using the TextRank algorithm. The proposed system records all the utterances of the speaker in real time and calculates the similarity based on the appearance frequency of the sentences. Then, to create the meeting minutes, it extracts important words or phrases through a non-supervised learning algorithm for finding the relation between the sentences in the document data. Especially, we improved the performance by introducing the keyword weighting technique for the TextRank algorithm which reconfigured the PageRank algorithm to fit words and sentences.

• The Korean Journal of Applied Statistics
• /
• v.37 no.2
• /
• pp.239-253
• /
• 2024

This research applies both point-wise and pair-wise learning strategies within the learning-to-rank (LTR) framework to predict horse race rankings in Seoul. Specifically, for point-wise learning, we employ a linear model and random forest. In contrast, for pair-wise learning, we utilize tools such as RankNet, and LambdaMART (XGBoost Ranker, LightGBM Ranker, and CatBoost Ranker). Furthermore, to enhance predictions, race records are standardized based on race distance, and we integrate various datasets, including race information, jockey information, horse training records, and trainer information. Our results empirically demonstrate that pair-wise learning approaches that can reflect the order information between items generally outperform point-wise learning approaches. Notably, CatBoost Ranker is the top performer. Through Shapley value analysis, we identified that the important variables for CatBoost Ranker include the performance of a horse, its previous race records, the count of its starting trainings, the total number of starting trainings, and the instances of disease diagnoses for the horse.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.1
• /
• pp.149-157
• /
• 2006

The purpose of this study is to search for location potential in Busan metropolitan city and to support decision-making in land use policy. As basis work for the analysis of the location potential, we build rank-map database by using the 11 index. And then by using rank-map, we carried out the location potential ($P_i$) analysis. As a result, we found that many commercial use located in Rank 1 to 2. Also, Rank 4-7 must be made an un-commercial use in assignment of land use zone. These data can be effectively used for land use plan in Busan metropolitan city as the basis data.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.179-185
• /
• 2017

Document summarization aims to generate a summary that is consistent and contains the highly related sentences in a document. In this study, we implemented for document summarization that extracts highly related sentences from a whole document by considering both similarities and entailment relations between sentences. Accordingly, we proposed a new algorithm, TextRank-NLI, which combines a Recurrent Neural Network based Natural Language Inference model and a Graph-based ranking algorithm used in single document extraction-based summarization task. In order to evaluate the performance of the new algorithm, we conducted experiments using the same datasets as used in TextRank algorithm. The results indicated that TextRank-NLI showed 2.3% improvement in performance, as compared to TextRank.

• Journal of Korean Society for Quality Management
• /
• v.41 no.4
• /
• pp.709-724
• /
• 2013

Purpose: The purpose of this study is to examine five evaluation models constructed by different normalization and aggregation methods in terms of the volatility of rankings and rank reversals. We also explore how the volatility of rankings of the five models changes and how often the rank reversals occur when the outliers are removed. Methods: We used data published in the Complete University Guide 2014. Two universities with missing values were excluded from the data. The university rankings were derived by using the five models, and then each model's volatility of rankings was measured. The box-plot was used to detect outliers. Results: Model 1 has the lowest volatility among the five models whether or not the outliers are included. Model 5 has the lowest number of rank reversals. Model 3, which has been used by many institutions, appears to be in the middle among the five in terms of the volatility and the rank reversals. Conclusion: The university rankings vary from one evaluation model to another depending on what normalization and aggregation methods are used. No single model exhibits clear superiority over others in both the volatility and the rank reversal. The findings of this study are expected to provide a stepping stone toward a superior model which is both reliable and robust.