Sciweavers

209 search results - page 23 / 42
» Query result clustering for object-level search
Sort
View
MICAI
2005
Springer
14 years 1 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
SIGIR
2009
ACM
14 years 2 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
WWW
2008
ACM
14 years 8 months ago
Which "Apple" are you talking about ?
In a higher level task such as clustering of web results or word sense disambiguation, knowledge of all possible distinct concepts in which an ambiguous word can be expressed woul...
Mandar Rahurkar, Dan Roth, Thomas S. Huang
CVDB
2005
ACM
13 years 9 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...
IPPS
2006
IEEE
14 years 1 months ago
A method to improve structural modeling based on conserved domain clusters
—Homology modeling requires an accurate alignment between a query sequence and its homologs with known three-dimensional (3D) information. Current structural modeling techniques ...
Fa Zhang, Lin Xu, Bo Yuan