Sciweavers

1413 search results - page 108 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
ADMA
2006
Springer
167views Data Mining» more  ADMA 2006»
16 years 7 days ago
A Correlation Approach for Automatic Image Annotation
The automatic annotation of images presents a particularly complex problem for machine learning researchers. In this work we experiment with semantic models and multi-class learnin...
David R. Hardoon, Craig Saunders, Sándor Sz...
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
16 years 7 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 9 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
16 years 7 months ago
Indexing Uncertain Categorical Data
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, R...
ICDE
2010
IEEE
176views Database» more  ICDE 2010»
15 years 10 months ago
Efficient fuzzy type-ahead search in TASTIER
TASTIER is a research project on the new information-access paradigm called type-ahead search, in which systems find answers to a keyword query on-the-fly as users type in the quer...
Guoliang Li, Shengyue Ji, Chen Li, Jiannan Wang, J...