Sciweavers

2018 search results - page 22 / 404
» Magnitude-preserving ranking algorithms
Sort
View
IJCAI
2007
13 years 11 months ago
ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines
Recommender systems are an emerging technology that helps consumers to find interesting products. A recommender system makes personalized product suggestions by extracting knowle...
Marco Gori, Augusto Pucci
ICML
2003
IEEE
14 years 10 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
ICITA
2005
IEEE
14 years 3 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
ICPADS
2005
IEEE
14 years 3 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
AIMS
2007
Springer
14 years 4 months ago
Improving Anomaly Detection Event Analysis Using the EventRank Algorithm
Abstract. We discuss an approach to reducing the number of events accepted by anomaly detection systems, based on alternative schemes for interest-ranking. The basic assumption is ...
Kyrre M. Begnum, Mark Burgess