Sciweavers

1681 search results - page 11 / 337
» Adaptive Clustering of Search Results
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
User Adaptive Clustering for Large Image Databases
Abstract--Searching large image databases is a time consuming process when done manually. Current CBIR methods mostly rely on training data in specific domains. When source and dom...
Mohammad Mehdi Saboorian, Mansour Jamzad, Hamid R....
SIGIR
2008
ACM
13 years 7 months ago
User adaptation: good results from poor systems
Several recent studies have found only a weak relationship between the performance of a retrieval system and the "success" achievable by human searchers. We hypothesize ...
Catherine L. Smith, Paul B. Kantor
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 1 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 2 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
GI
2005
Springer
14 years 1 months ago
Delivering a Personalized Result Set by the Adaptation of Preference Queries
: Personalization includes the adaptation of database queries according to the user’s needs, wishes and situation. We examine the influence of the dparameter as powerful personal...
Sven Döring, Annette Eberle, Timotheus Preisi...