Sciweavers

3020 search results - page 73 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 8 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ADC
2003
Springer
173views Database» more  ADC 2003»
15 years 11 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
16 years 23 days ago
Index-Supported Similarity Search Using Multiple Representations
Similarity search in complex databases is of utmost interest in a wide range of application domains. Often, complex objects are described by several representations. The combinatio...
Johannes Aßfalg, Michael Kats, Hans-Peter Kr...
DCC
2000
IEEE
15 years 10 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
SIGIR
2009
ACM
16 years 24 days ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero