Proxy Cache Replacement Algorithms: A History-Based Approach
World Wide Web
No Quadrangulation is Extremely Odd
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
A Data Mining Algorithm for Generalized Web Prefetching
IEEE Transactions on Knowledge and Data Engineering
Using latent semantic indexing to filter spam
Proceedings of the 2003 ACM symposium on Applied computing
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Caching in Web memory hierarchies
Proceedings of the 2004 ACM symposium on Applied computing
Web taxonomy integration using support vector machines
Proceedings of the 13th international conference on World Wide Web
Web taxonomy integration through co-bootstrapping
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
ICML '06 Proceedings of the 23rd international conference on Machine learning
Tensor space model for document analysis
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Analysis of Caching and Replication Strategies for Web Applications
IEEE Internet Computing
Exploring the bounds of web latency reduction from caching and prefetching
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Mining customer knowledge for product line and brand extension in retailing
Expert Systems with Applications: An International Journal
Towards the semantic extraction of digital signatures for librarian image-identification purposes
Journal of the American Society for Information Science and Technology
Journal of Artificial Intelligence Research
Supervised latent semantic indexing using adaptive sprinkling
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Prediction in wireless networks by Markov Chains
IEEE Wireless Communications
Hi-index | 0.00 |
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.