MATHEMATICAL METHODS IN ALGORITHM FOR WEBSITES POSITIONING
Journal Title: Silesian Journal of Pure and Applied Mathematics - Year 2016, Vol 6, Issue 1
Abstract
Nowadays it is more and more common to treat the Internet as one of the first sources of information. Given key words, different types of web search engines generate a list of websites ranked by priority (theoretically corresponding to the query). The page position on the list depends on many factors. The method presented herein is a version of a PageRank algorithm introduced by Google to designate one of them. The PageRank algorithm ranks a webpage, depending on the number and quality of links leading to it and thus determines its position on the list. In its simplest version, the method can operate using just the basic operations on matrices. This paper presents also the more advanced version based on probabilistic approach.
Authors and Affiliations
Katarzyna Adrianowicz, Iwona Nowak
Keywords
Related Articles
- EP ID EP179607
- DOI -
- Views 103
- Downloads 0
ESTIMATING RAPID FLOW TRANSIENTS USING EXTENDED KALMAN FILTER
Theoretical and numerical modeling of flow transients in pipelines is a challenging field of research. The governing flow equations constitute a system of nonlinear hyperbolic partial differential equations enforcing the...
THE MODES OF A MIXTURE OF TWO NORMAL DISTRIBUTIONS
Mixture distributions arise naturally where a statistical population contains two or more subpopulations. Finite mixture distributions refer to composite distributions constructed by mixing a number K of component distri...
IMPLICIT FINITE DIFFERENCE METHOD FOR THE SPACE FRACTIONAL HEAT CONDUCTION EQUATION WITH THE MIXED BOUNDARY CONDITION
This paper presents the numerical solution of the space fractional heat conduction equation with Neumann and Robin boundary conditions. In described equation the Riemann-Liouville fractional derivative is used. Considere...
THE TAYLOR TRANSFORMATION HYBRID METHOD APPLIED FOR SOLVING THE STEFAN PROBLEM
The paper presents the analytic-numerical hybrid method using, among others, the Taylor transformation, thanks to which the solution of the Stefan problem is replaced by the solution of a nonlinear system of equations.
STRONG SEQUENCES AND THEIR CONSEQUENCES IN SOCIAL CHOICE
One of the most famous theorems in social choice theory – Arrow impossibility theorem – was published in 1951. Since Arrowian paper most researchers tried to find different versions of this theorem not only for finite bu...