Sciweavers

119 search results - page 15 / 24
» Comparing the sensitivity of information retrieval metrics
Sort
View
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
15 years 4 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
72
Voted
CVPR
2000
IEEE
15 years 11 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang
IPM
2006
64views more  IPM 2006»
14 years 9 months ago
Text mining without document context
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan
CIKM
2010
Springer
14 years 8 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
APSEC
2003
IEEE
15 years 2 months ago
Understanding How the Requirements Are Implemented in Source Code
For software maintenance and evolution, a common problem is to understand how each requirement is implemented in the source code. The basic solution of this problem is to find the...
Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun