Personne

Martin Veselý

Cette personne n’est plus à l’EPFL

Publications associées (6)

Selection and Aggregation of Ranking Criteria for Retrieval from Scientific Publication Databases

Selection and aggregation of ranking criteria became an important topic in information retrieval as search is getting more specialized and as volume of electronically available information grows. In this context, document ranking has undergone a shift from ...

EPFL2012

Rank Aggregation in Scientific Publication Databases Based on Logistic Regression

Martin Rajman, Martin Veselý

The goal of the d-Rank project is to study rank aggregation in scientific publication databases. In our work we focus in particular on document ranking in the domain of particle physics and we work with the collection of CERN publications called the CERN D ...

2009

Ranking in scientific publication databases involves a variety of additional resources that are usually not applied in standard general purpose search engines. Moreover, community-specific expectations of users influence the perception of the adequacy of r ...

2008

Using Bibliographic Knowledge for Ranking in Scientific Publication Databases

Martin Rajman, Martin Veselý

Document ranking for scientific publications involves a variety of specialized resources (e.g. author or citation indexes) that are usually difficult to use within standard general purpose search engines that usually operate on large-scale heterogeneous do ...

IOS2008

In the present report we describe the research work that has been carried out in the scope of the first 2 year phase of the d-Rank project. ...

2008

Making Statistical Data More Easily Accessible on the Web : Results of the StatSearch Case Study

Martin Rajman, Martin Veselý

In this paper we present the results of the StatSearch case study that aimed at providing enhanced access to statistical data available on the Web. In the scope of this case study we developed a prototype of an information access tool combining uerybased s ...

2005

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search