Sciweavers

2100 search results - page 106 / 420
» Learning to rank on graphs
Sort
View
WEBI
2010
Springer
15 years 4 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet
ISBI
2009
IEEE
16 years 1 months ago
Bridging the Semantic Gap Using Ranking Svm for Image Retrieval
One of the main challenges for Content-Based Image Retrieval (CBIR) is to achieve meaningful mappings between the high-level semantic concepts and the low-level visual features in...
Haiying Guan, Sameer Antani, L. Rodney Long, Georg...
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 6 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
AIMS
2007
Springer
16 years 14 days 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
ICASSP
2010
IEEE
15 years 6 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel