Sciweavers

49 search results - page 7 / 10
» A Graph-Theoretic Framework for Semantic Distance
Sort
View
SEMWEB
2010
Springer
14 years 7 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
15 years 3 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
ICMCS
2007
IEEE
132views Multimedia» more  ICMCS 2007»
15 years 4 months ago
An SVM Framework for Genre-Independent Scene Change Detection
We present a novel genre-independent SVM framework for detecting scene changes in broadcast video. Our framework works on content from a diverse range of genres by allowing sets o...
Naveen Goela, Kevin W. Wilson, Feng Niu, Ajay Diva...
NAACL
2010
14 years 7 months ago
Learning Dense Models of Query Similarity from User Click Logs
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...