Sciweavers

79 search results - page 10 / 16
» Applications of Quick-Combine for Ranked Query Models
Sort
View
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
CIKM
2009
Springer
13 years 10 months ago
Answer typing for information retrieval
Answer typing is commonly thought of as finding appropriate responses to given questions. We extend the notion of answer typing to information retrieval to ensure results contain...
Christopher Pinchak, Davood Rafiei, Dekang Lin
CIKM
2009
Springer
14 years 2 months ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
13 years 11 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...