Sciweavers

248 search results - page 23 / 50
» Perturbation based Large Margin Approach for Ranking
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ESWS
2005
Springer
15 years 5 months ago
An Ontology-Based Information Retrieval Model
Semantic search has been one of the motivations of the Semantic Web since it was envisioned. We propose a model for the exploitation of ontologybased KBs to improve search over lar...
David Vallet, Miriam Fernández, Pablo Caste...
CIKM
2011
Springer
13 years 11 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
ICML
2007
IEEE
16 years 17 days ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng
CCECE
2006
IEEE
15 years 5 months ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne