7215 search results - page 50 / 1443 » On the Consistency of Ranking Algorithms |
AIMS
2007
Springer
14 years 1 months ago
2007
Springer
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 ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This article arguments that rank correlation coefficients are powerful association measures and how can they be adopted by EDAs. A new EDA implements the proposed ideas: the Non-P...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
COR
2008
13 years 7 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...