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 65
- Downloads 0
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...
THE ULTRAMETRIC PROPERTIES OF BINARY DATASETS
Many multivariate algorithms commonly applied for binary datasets depend on a proper metric (i.e., dissimilarity function) imposed on binary vectors. In the following work the relationships between different metrics defi...
A STRONG CONVERGENCE RESULT FOR SYSTEMS OF NONLINEAR OPERATOR EQUATIONS INVOLVING TOTAL ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN UNIFORMLY CONVEX BANACH SPACES
We prove the strong convergence of an implicit iterative procedure to a solution of a system of nonlinear operator equations involving total asymptotically nonexpansive operators in uniformly convex Banach spaces.
NOTE ON SIMPLE LIE ALGEBRAS OF INFINITE MATRICES
We introduce Lie algebras of infinite N × N matrices, with coefficients in a commutative rings, which have nonzero entries only in finite number of rows and study its properties. We show that algebra of matrices with tra...
THE METHOD OF FINDING POINTS OF INTERSECTION OF TWO CUBIC BEZIER CURVES USING THE SYLVESTER MATRIX
Sylvester matrix is used to create a 9th degree polynomial from coefficients of two cubic Bezier curves. The real roots of this polynomial allow to compute points of intersection of aforementioned curves. An additional c...