Sciweavers

28 search results - page 4 / 6
» A framework for determining necessary query set sizes to eva...
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 days 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
WWW
2003
ACM
14 years 6 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
CIKM
2005
Springer
13 years 10 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
PAA
2007
13 years 4 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
13 years 9 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder