Sciweavers

350 search results - page 37 / 70
» Discovering topical structures of databases
Sort
View
202
Voted
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 3 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
141
Voted
RCIS
2010
15 years 2 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
117
Voted
CHI
2002
ACM
16 years 4 months ago
Polyarchy visualization: visualizing multiple intersecting hierarchies
Hierarchy visualization has been a hot topic in the Information Visualization community for the last decade. An emerging new information structure is multiple intersecting hierarc...
George G. Robertson, Kim Cameron, Mary Czerwinski,...
153
Voted
UAI
1998
15 years 5 months ago
Inferring Informational Goals from Free-Text Queries: A Bayesian Approach
People using consumer software applications typically do not use technical jargon when querying an online database of help topics. Rather, they attempt to communicate their goals ...
David Heckerman, Eric Horvitz
182
Voted
SPIRE
2010
Springer
15 years 2 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi