• Journal of the Korean Society for information Management
• /
• v.40 no.4
• /
• pp.403-428
• /
• 2023

This study investigates the development path and intellectual structure of data literacy research, aiming to identify emerging topics in the field. A comprehensive search for data literacy-related articles on the Web of Science reveals that the field is primarily concentrated in Education & Educational Research and Information Science & Library Science, accounting for nearly 60% of the total. Citation network analysis, employing the PageRank algorithm, identifies key papers with high citation impact across various topics. To accurately trace the development path of data literacy research, an enhanced PageRank main path algorithm is developed, which overcomes the limitations of existing methods confined to the Education & Educational Research field. Keyword bibliographic coupling analysis is employed to unravel the intellectual structure of data literacy research. Utilizing the PNNC algorithm, the detailed structure and clusters of the derived keyword bibliographic coupling network are revealed, including two large clusters, one with two smaller clusters and the other with five smaller clusters. The growth index and mean publishing year of each keyword and cluster are measured to pinpoint emerging topics. The analysis highlights the emergence of critical data literacy for social justice in higher education amidst the ongoing pandemic and the rise of AI chatbots. The enhanced PageRank main path algorithm, developed in this study, demonstrates its effectiveness in identifying parallel research streams developing across different fields.

• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.2
• /
• pp.119-143
• /
• 2011

This study identifies the characteristics of recent citation-based indicators for assessing a single paper in the context of their co-relationships. Five predefined indicators were examined with three variants of h-index which are convened in this study; the formers are PageRank, SCEAS Rank, CCI, f-value, and single paper h-index and the latters are $h_S$-index, h1-index, and $h_S$1-index. The correlation analysis and cluster analysis were performed to group the indicators by common characteristics, after which the indicators were calculated with the dataset from KSCI DB. The results show statistical evidence that distinguishes h-index type indicators from others. The characteristics of the indicators were verified with citation frequency factors using correlation analysis. Finally, the implications for applications and further studies are discussed.

• Journal of the Korean Statistical Society
• /
• v.15 no.1
• /
• pp.9-25
• /
• 1986

In this paper we propose a distribution-free rank test for ordered alternatives in a randomized block design and investigate the properties of the proposed test. The proposed test is an extension of the Page test to allow replications in each cell. Some asymptotic properties including ARE's are investigated. A small sample Monte Carlo study was performed to compare the powers of the test considered in this paper for small samples. The results show that our proposed test is robust and efficient in the case of equally-spaced treatment effects.

• Journal of Information Technology Applications and Management
• /
• v.13 no.4
• /
• pp.167-180
• /
• 2006

Websites in the Internet are uncontrollable domain and various contents in websites lead people's activities and thoughts and new business paradigms for the future. These phenomena are from expanding the social network based on the endless growth of information technology. Websites are composed with many of links and communicating and expanding their virtual area by links, inbound, outbound, onsite, and of offsite links. Research and practice in digital information on the web have focused on finding and measuring artifacts, factors and attributes of web structure and contents from the perspective that information is a resource and property of products and services. Websites links is one of the core artifacts for understanding the virtual area. This study identifies the role of web link structure and webpage keyword as artifacts and examines their relationships by webpage rank by a minimal hub as performance in the business websites that are serving tourism information. Discovering relationships of links provides managerial insights on organizations virtual activities and systematic understandings about digitalized organizational information in the information use environment.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2010.08a
• /
• pp.15-20
• /
• 2010

최근 Web of Science에 도입된 Eigenfactor지수와 논문 영향력 지수(Article Influence Score), 그리고 Scopus에 도입된 SJR 지수는 구글의 PageRank 알고리즘과 같은 네트워크 분석 방식의 인용지수이다. 국내 인용 색인 데이터베이스는 인용 링크가 외부로 향하는 비율과 자기 인용 비율이 높으므로 기존의 네트워크 인용 지수 산출 방식을 그대로 적용하기에는 어려움이 많다. 이 연구에서는 국내 인용색인DB에 대해서 대표적인 네트워크 인용 지수인 저널 페이지랭크를 시험적으로 측정해보고 국내 학술지의 상황을 고려한 개선방안을 모색하였다.

• Asia pacific journal of information systems
• /
• v.17 no.4
• /
• pp.31-59
• /
• 2007

We frequently use search engines to find relevant information in the Web but still end up with too much information. In order to solve this problem of information overload, ranking algorithms have been applied to various domains. As more information will be available in the future, effectively and efficiently ranking search results will become more critical. In this paper, we propose a ranking algorithm for the Semantic Web resources, specifically RDF resources. Traditionally, the importance of a particular Web page is estimated based on the number of key words found in the page, which is subject to manipulation. In contrast, link analysis methods such as Google's PageRank capitalize on the information which is inherent in the link structure of the Web graph. PageRank considers a certain page highly important if it is referred to by many other pages. The degree of the importance also increases if the importance of the referring pages is high. Kleinberg's algorithm is another link-structure based ranking algorithm for Web pages. Unlike PageRank, Kleinberg's algorithm utilizes two kinds of scores: the authority score and the hub score. If a page has a high authority score, it is an authority on a given topic and many pages refer to it. A page with a high hub score links to many authoritative pages. As mentioned above, the link-structure based ranking method has been playing an essential role in World Wide Web(WWW), and nowadays, many people recognize the effectiveness and efficiency of it. On the other hand, as Resource Description Framework(RDF) data model forms the foundation of the Semantic Web, any information in the Semantic Web can be expressed with RDF graph, making the ranking algorithm for RDF knowledge bases greatly important. The RDF graph consists of nodes and directional links similar to the Web graph. As a result, the link-structure based ranking method seems to be highly applicable to ranking the Semantic Web resources. However, the information space of the Semantic Web is more complex than that of WWW. For instance, WWW can be considered as one huge class, i.e., a collection of Web pages, which has only a recursive property, i.e., a 'refers to' property corresponding to the hyperlinks. However, the Semantic Web encompasses various kinds of classes and properties, and consequently, ranking methods used in WWW should be modified to reflect the complexity of the information space in the Semantic Web. Previous research addressed the ranking problem of query results retrieved from RDF knowledge bases. Mukherjea and Bamba modified Kleinberg's algorithm in order to apply their algorithm to rank the Semantic Web resources. They defined the objectivity score and the subjectivity score of a resource, which correspond to the authority score and the hub score of Kleinberg's, respectively. They concentrated on the diversity of properties and introduced property weights to control the influence of a resource on another resource depending on the characteristic of the property linking the two resources. A node with a high objectivity score becomes the object of many RDF triples, and a node with a high subjectivity score becomes the subject of many RDF triples. They developed several kinds of Semantic Web systems in order to validate their technique and showed some experimental results verifying the applicability of their method to the Semantic Web. Despite their efforts, however, there remained some limitations which they reported in their paper. First, their algorithm is useful only when a Semantic Web system represents most of the knowledge pertaining to a certain domain. In other words, the ratio of links to nodes should be high, or overall resources should be described in detail, to a certain degree for their algorithm to properly work. Second, a Tightly-Knit Community(TKC) effect, the phenomenon that pages which are less important but yet densely connected have higher scores than the ones that are more important but sparsely connected, remains as problematic. Third, a resource may have a high score, not because it is actually important, but simply because it is very common and as a consequence it has many links pointing to it. In this paper, we examine such ranking problems from a novel perspective and propose a new algorithm which can solve the problems under the previous studies. Our proposed method is based on a class-oriented approach. In contrast to the predicate-oriented approach entertained by the previous research, a user, under our approach, determines the weights of a property by comparing its relative significance to the other properties when evaluating the importance of resources in a specific class. This approach stems from the idea that most queries are supposed to find resources belonging to the same class in the Semantic Web, which consists of many heterogeneous classes in RDF Schema. This approach closely reflects the way that people, in the real world, evaluate something, and will turn out to be superior to the predicate-oriented approach for the Semantic Web. Our proposed algorithm can resolve the TKC(Tightly Knit Community) effect, and further can shed lights on other limitations posed by the previous research. In addition, we propose two ways to incorporate data-type properties which have not been employed even in the case when they have some significance on the resource importance. We designed an experiment to show the effectiveness of our proposed algorithm and the validity of ranking results, which was not tried ever in previous research. We also conducted a comprehensive mathematical analysis, which was overlooked in previous research. The mathematical analysis enabled us to simplify the calculation procedure. Finally, we summarize our experimental results and discuss further research issues.

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.21-45
• /
• 2023

This study presents a machine learning program designed to identify impactful papers in the field of mathematics education. To achieve this objective, we examined the impact of papers from a scientific econometrics perspective, developed a mathematics education research network, and defined the impact of mathematics education research using PageRank, a network centrality index. We developed a machine learning model to determine the impact of mathematics education research and identified the journals with the highest percentage of impactful articles to be the Journal for Research in Mathematics Education (25.66%), Educational Studies in Mathematics (22.12%), Zentralblatt für Didaktik der Mathematik (8.46%), Journal of Mathematics Teacher Education (5.8%), and Journal of Mathematical Behaviour (5.51%). The results of the machine learning program were similar to the findings of previous studies that were read and evaluated qualitatively by experts in mathematics education. Significantly, the AI-assisted impact evaluation of mathematics education research, which typically requires significant human resources and time, was carried out efficiently in this study.

• Asia pacific journal of information systems
• /
• v.21 no.2
• /
• pp.89-116
• /
• 2011

In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

• Journal of Technology Innovation
• /
• v.27 no.4
• /
• pp.1-19
• /
• 2019

This study presents a new method to evaluate patents by public R&D program using patent citation network analysis. I used forward citation, degree centrality, betweenness centrality and page rank as the dependent variables which represents the quality of patents. I used primary independent variable as a dummy of public R&D program and controlled patents characteristics, applicant characteristics, technological characteristics and year effect. The empirical result shows that the patents of public R&D program is superior to other patents in regard to the number of forward citation, the degree centrality, the betweenness centrality and the page rank. This empirical result implies that patents of public R&D program directly and effectively connects technologies. Also patents from public R&D program connects important technologies.

• Journal of the Korean Society for information Management
• /
• v.31 no.3
• /
• pp.153-179
• /
• 2014

This study explores the characteristics of centrality measures for analyzing researchers' impact and structural positions in research collaboration networks. We investigate four binary network centrality measures (degree centrality, closeness centrality, betweenness centrality, and PageRank), and seven existing weighted network centrality measures (triangle betweenness centrality, mean association, weighted PageRank, collaboration h-index, collaboration hs-index, complex degree centrality, and c-index) for research collaboration networks. And we propose SSR, which is a new weighted centrality measure for collaboration networks. Using research collaboration data from three different research domains including architecture, library and information science, and marketing, the above twelve centrality measures are calculated and compared each other. Results indicate that the weighted network centrality measures are needed to consider collaboration strength as well as collaboration range in research collaboration networks. We also recommend that when considering both collaboration strength and range, it is appropriate to apply triangle betweenness centrality and SSR to investigate global centrality and local centrality in collaboration networks.