Sciweavers

3133 search results - page 238 / 627
» Representing clusters for retrieval
Sort
View
SIGIR
2012
ACM
13 years 9 months ago
Mining query subtopics from search log data
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this pa...
Yunhua Hu, Ya-nan Qian, Hang Li, Daxin Jiang, Jian...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 10 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang

Publication
1763views
16 years 3 months ago
Reranking with Contextual dissimilarity measures from representational Bregman k-means
We present a novel reranking framework for Content Based Image Retrieval (CBIR) systems based on con-textual dissimilarity measures. Our work revisit and extend the method of Perro...
Olivier Schwander, Frank Nielsen
SAC
2006
ACM
16 years 19 days ago
Personalization and visualization on handheld devices
The small screen size of handheld mobile devices poses an inherent problem in visualizing data: very often it is too difficult and unpleasant to navigate through the plethora of p...
Dongsong Zhang, George Karabatis, Zhiyuan Chen, Bo...
SIGIR
2010
ACM
15 years 6 months ago
Scalability of findability: effective and efficient IR operations in large information networks
It is crucial to study basic principles that support adaptive and scalable retrieval functions in large networked environments such as the Web, where information is distributed am...
Weimao Ke, Javed Mostafa