• Title/Summary/Keyword: ranking algorithm

Search Result 200, Processing Time 0.025 seconds

An Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks

  • Kim, Jawon;Ahn, Hyun;Park, Minjae;Kim, Sangguen;Kim, Kwanghoon Pio
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1454-1466
    • /
    • 2016
  • This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • 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.

Item Selection By Estimated Profit Ranking Based on Association Rule (연관규칙을 이용한 상품선택과 기대수익 예측)

  • Hwang, In-Soo
    • Asia pacific journal of information systems
    • /
    • v.14 no.4
    • /
    • pp.87-97
    • /
    • 2004
  • One of the most fundamental problems in business is ranking items with respect to profit based on historical transactions. The difficulty is that the profit of one item comes from its influence on the sales of other items as well as its own sales, and that there is no well-developed algorithm for estimating overall profit of selected items. In this paper, we developed a product network based on association rule and an algorithm for profit estimation and item selection using the estimated profit ranking(EPR). As a result of computer simulation, the suggested algorithm outperforms the individual approach and the hub-authority profit ranking algorithm.

Face Detection using Distance Ranking (거리순위를 이용한 얼굴검출)

  • Park, Jae-Hee;Kim, Seong-Dae
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.363-366
    • /
    • 2005
  • In this paper, for detecting human faces under variations of lighting condition and facial expression, distance ranking feature and detection algorithm based on the feature are proposed. Distance ranking is the intensity ranking of a distance transformed image. Based on statistically consistent edge information, distance ranking is robust to lighting condition change. The proposed detection algorithm is a matching algorithm based on FFT and a solution of discretization problem in the sliding window methods. In experiments, face detection results in the situation of varying lighting condition, complex background, facial expression change and partial occlusion of face are shown

  • PDF

Contingency Ranking Algorithm Using Voltage Stability (전압안정성를 고려한 전력계통의 상정사고 선택 앨고리즘)

  • Park, Kyu-Hong;Cho, Yang-Haeng;Jung, Leen-Hark
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.105-107
    • /
    • 2002
  • This paper presents a algorithm for contingency ranking using the real power ratio. The fundamemtal cause of voltage collapse is considered due to excessive power trnsfer through the line. To obtain contingency ranking, maximum real power tansferred to the load is obtained when load impedance $Z_r$ equal to line impedance $Z_s$. This algorithm is verified by simulation on a 6-bus test system.

  • PDF

Contingency Ranking Algorithm Using Voltage Stability (전압안정성를 고려한 전력계통의 상정사고 선택 엘고리즘)

  • Park, Kyu-Hong;Cho, Yang-Haeng;Jung, Ieen-Hark
    • Proceedings of the KIEE Conference
    • /
    • 2002.06a
    • /
    • pp.146-148
    • /
    • 2002
  • This paper presents a algorithm for contingency ranking using the real power ratio, The fundamemtal cause of voltage collapse is considered due to excessive power trnsfer through the line To obtain contingency ranking, maximum real power tansferred to the load is obtained when load $impedance^{Z_r}$ equal to line $impedance^{Z_s}$, This algorithm is verified by simulation on a 6-bus test system.

  • PDF

A Method for Determining All the k Most Vital Arcs in the Maximum Flow Problem by Ranking of Cardinality Cuts (절단기수의 나열을 통한 최대유통문제에서 모든 k-치명호를 찾는 방법)

  • Ahn, Jae-Geun;Chung, Ho-Yeon;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.2
    • /
    • pp.184-191
    • /
    • 1999
  • The k most vital arcs (k-MVA) of a maximum flow problem is defined as those k arcs whose simultaneous removal from the network causes the greatest decrease in the throughput capability of the remaining system between a specified pair of nodes. In this study, we present a method for determining all the k-MVA in maximum flow problem using a minimal cardinality cut algorithm and k-th minimal cut ranking algorithm. For ranking cardinality cuts, we use Hamacher's ranking algorithm for cut capacity and by comparing present residual capacity of cardinality cut with expected residual capacity of next cardinality cut, we also present termination condition for this algorithm. While the previous methods cannot find all the alternatives for this problem, a method presented here has advantage of determining all the k-MVA.

  • PDF

A Generic Multi-Level Algorithm for Prioritized Multi-Criteria Decision Making

  • G., AlShorbagy;Eslam, Hamouda;A.S., Abohamama
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.25-32
    • /
    • 2023
  • Decision-making refers to identifying the best alternative among a set of alternatives. When a set of criteria are involved, the decision-making is called multi-criteria decision-making (MCDM). In some cases, the involved criteria may be prioritized by the human decision-maker, which determines the importance degree for each criterion; hence, the decision-making becomes prioritized multi-criteria decision-making. The essence of prioritized MCDM is raking the different alternatives concerning the criteria and selecting best one(s) from the ranked list. This paper introduces a generic multi-level algorithm for ranking multiple alternatives in prioritized MCDM problems. The proposed algorithm is implemented by a decision support system for selecting the most critical short-road requests presented to the transportation ministry in the Kingdom of Saudi Arabia. The ranking results show that the proposed ranking algorithm achieves a good balance between the importance degrees determined by the human decision maker and the score value of the alternatives concerning the different criteria.

Performance Analysis of an Estimated Closeness Centrality Ranking Algorithm in Large-Scale Workflow-supported Social Networks (대규모 워크플로우 소셜 네트워크의 추정 근접 중심도 랭킹 알고리즘 성능 분석)

  • Kim, Jawon;Ahn, Hyun;Kim, Kwanghoon
    • Journal of Internet Computing and Services
    • /
    • v.16 no.3
    • /
    • pp.71-77
    • /
    • 2015
  • This paper implements an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks and performance analyzes of the algorithm. Existing algorithm has a time complexity problem which is increasing performance time by network size. This problem also causes ranking process in large-scale workflow-supported social networks. To solve such problems, this paper conducts comparison analysis on the existing algorithm and estimated results by applying estimated-driven RankCCWSSN(Rank Closeness Centrality Workflow-supported Social Network). The RankCCWSSN algorithm proved its time-efficiency in a procedure about 50% decrease.

Performance Evaluations of Text Ranking Algorithms

  • Kim, Myung-Hwi;Jang, Beakcheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.123-131
    • /
    • 2020
  • The text ranking algorithm is a representative method for keyword extraction, and its importance is emphasized highly. In this paper, we compare the performance of recent research and experiments with TF-IDF, SMART, INQUERY and CCA algorithms, which are used in text ranking algorithm.. After explaining each algorithm, we compare the performance of each algorithm based on the data collected from news and Twitter. Experimental results show that all of four algorithms can extract specific words from news data equally. However, in the case of Twitter, CCA has the best performance to extract specific words, and INQUERY shows the worst performance. We also analyze the accuracy of the algorithm through six comparison metrics. The experimental results present that CCA shows the best accuracy in the news data. In case of Twitter, TF-IDF and CCA show similar performance and demonstrate good performance.