Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
1996
|
| Accesso online: | https://doi.org/10.5281/zenodo.19674379 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901959420674048 |
|---|---|
| author | Borghoff, Uwe M. Chevalier, Pierre-Yves Willamowski, Jutta |
| author_facet | Borghoff, Uwe M. Chevalier, Pierre-Yves Willamowski, Jutta |
| contents | <p>Information brokerage systems support distributed information gathering for data collections stored within the World Wide Web or for other on-line data repositories. These systems present a unified face of the underlying heterogeneity, both in terms of the access/search protocols and in terms of the data schemata. Typically, the user may input some values (e.g., interpreted as strings within a fulltext search), and may refine/relax them once she gets too many/little results for her query. Adaptiveness with respect to a refinement of attributes can improve the precision of the searches dramatically. This paper discusses adaptive refinement of attributepatterns together with its main implications in the context of the Constraint-Based Knowledge Broker system. It presents an implementation for distributed information gathering, and motivates design choices through concrete examples.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19674379 |
| institution | Zenodo |
| language | eng |
| publishDate | 1996 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Adaptive Refinement Of Search Patterns For Distributed Information Gathering Borghoff, Uwe M. Chevalier, Pierre-Yves Willamowski, Jutta <p>Information brokerage systems support distributed information gathering for data collections stored within the World Wide Web or for other on-line data repositories. These systems present a unified face of the underlying heterogeneity, both in terms of the access/search protocols and in terms of the data schemata. Typically, the user may input some values (e.g., interpreted as strings within a fulltext search), and may refine/relax them once she gets too many/little results for her query. Adaptiveness with respect to a refinement of attributes can improve the precision of the searches dramatically. This paper discusses adaptive refinement of attributepatterns together with its main implications in the context of the Constraint-Based Knowledge Broker system. It presents an implementation for distributed information gathering, and motivates design choices through concrete examples.</p> |
| title | Adaptive Refinement Of Search Patterns For Distributed Information Gathering |
| url | https://doi.org/10.5281/zenodo.19674379 |