Sciweavers

37 search results - page 4 / 8
» Surrogate Ranking for Very Expensive Similarity Queries
Sort
View
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 1 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
WWW
2007
ACM
14 years 8 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
VLDB
2002
ACM
138views Database» more  VLDB 2002»
13 years 7 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
WWW
2008
ACM
14 years 8 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...