Sciweavers

1117 search results - page 127 / 224
» Querying structured data in an unstructured P2P system
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Versatile structural disambiguation for semantic-aware applications
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 20 days ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
WWW
2007
ACM
15 years 10 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
ESWS
2009
Springer
15 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...