Sciweavers

3152 search results - page 5 / 631
» Retrieval of Partial Documents
Sort
View
EDBT
2002
ACM
179views Database» more  EDBT 2002»
14 years 11 months ago
Efficient Complex Query Support for Multiversion XML Documents
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo,...
EDBT
2006
ACM
106views Database» more  EDBT 2006»
14 years 11 months ago
DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
IR
2000
13 years 10 months ago
Exploiting the Similarity of Non-Matching Terms at Retrieval Time
In classic InformationRetrieval systems a relevant document will not be retrieved in response to a query if the document and query representations do not share at least one term. T...
Fabio Crestani
ICML
2008
IEEE
14 years 11 months ago
Semi-supervised learning of compact document representations with deep networks
Finding good representations of text documents is crucial in information retrieval and classification systems. Today the most popular document representation is based on a vector ...
Marc'Aurelio Ranzato, Martin Szummer
SAC
2006
ACM
14 years 4 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach