This report presents novel algorithms to use eye movements as an implicit relevance feedback in order to improve the performance of the searches. The algorithms are evaluated on "Transport Rank Five" Dataset which were previously collected in Task 8.3. We demonstrated that simple linear combination or tensor product of eye movement and image features can improve the retrieval accuracy

Auer, Peter

Gunn, Steve

Hardoon, David

Kaski, Samuel

Klami, Arto

Leung, Alex

Pasupa, Kitsuchart

Saunders, Craig

Szedmak, Sandor

Southampton (e-Prints Soton)

English

a. Tensor products of hilbert space eect algebras.

An Introduction to Support Vector Machines and other kernel-based learning methods.

Can eyes reveal interest? Implicit queries from gaze patterns. User Modeling and UserAdapted Interaction,

Can relevance of images be inferred from eye movements?

Combining eye movements and collaborative  for proactive information retrieval.

Database of eye-movement recordings.

Eye movements as implicit relevance feedback.

Eye movements in reading and information processing: 20 years of research.

Fast hands-free writing by gaze direction.

Image ranking with implicit feedback from eye movements.

Inferring relevance from eye movements: Feature extraction.

Information retrieval by inferring implicit queries from eye movements.

IR evaluation methods for retrieving highly relevant documents.

Kernel methods for predicting protein-protein interactions.

Learning to rank images from eye movements.

Nonparametric statistics for the behavioral sciences.

Optimizing search engines using clickthrough data. In

Passive Eye Monitoring: Algorithms, Applications and Experiments.

Perceptual image retrieval using eye movements.

PicSOM{content-based image retrieval with self-organizing maps.

Predicting co-complexed protein pairs from heterogeneous data.

Predicting protein-protein interactions using signature products.

Sample mean based index policies with O(log n) regret for the multiarmed bandit problem.

The PASCAL Visual Object Classes Challenge

Thore Graepel, and Klaus Obermayer. Large margin rank boundaries for ordinal regression.

Using con bounds for exploitation-exploration trade-os.

Ranking algorithms for implicit feedback