Sciweavers

17329 search results - page 35 / 3466
» Improved non-approximability results
Sort
View
CIKM
2006
Springer
14 years 11 days ago
Re-ranking search results using query logs
This work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevan...
Ziming Zhuang, Silviu Cucerzan
ECIR
2010
Springer
13 years 10 months ago
Explicit Search Result Diversification through Sub-queries
Queries submitted to a retrieval system are often ambiguous. In such a situation, a sensible strategy is to diversify the ranking of results to be retrieved, in the hope that users...
Rodrygo L. T. Santos, Jie Peng, Craig Macdonald, I...
ACSW
2004
13 years 10 months ago
Experiences in Building a Tool for Navigating Association Rule Result Sets
Practical knowledge discovery is an iterative process. First, the experiences gained from one mining run are used to inform the parameter setting and the dataset and attribute sel...
Peter Fule, John F. Roddick
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CIKM
2004
Springer
14 years 2 months ago
Soft clustering criterion functions for partitional document clustering: a summary of results
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster simil...
Ying Zhao, George Karypis