Title
A semantic self-organising webpage-ranking algorithm using computational geometry across different knowledge domains
Abstract
In this paper we introduce a method for Web page-ranking, based on computational geometry to evaluate and test by examples, order relationships among web pages belonging to different knowledge domains. The goal is, through an organising procedure, to learn from these examples a real-valued ranking function that induces ranking via a convexity feature. We consider the problem of self-organising learning from numerical data to be represented by a well-fitted convex polygon procedure, in which the vertices correspond to descriptors representing domains of web pages. Results and statistical evaluation of procedure show that the proposed method may be characterised as accurate.
Year
DOI
Venue
2009
10.1504/IJKWI.2009.027924
I. J. Knowledge and Web Intelligence
Keywords
Field
DocType
computational geometry,well-fitted convex polygon procedure,web page,procedure show,webpage-ranking algorithm,convexity feature,organising procedure,different knowledge domain,web page-ranking,real-valued ranking function,internet,web pages,information retrieval
Data mining,Convexity,Web page,Vertex (geometry),Ranking,Information retrieval,Computer science,Computational geometry,Convex polygon,Web modeling,Social Semantic Web
Journal
Volume
Issue
Citations 
1
1/2
0
PageRank 
References 
Authors
0.34
24
4
Name
Order
Citations
PageRank
Marios Poulos110915.71
Sozon Papavlasopoulos2214.79
V. S. Belesiotis311.03
Nikolaos Korfiatis421715.15