http://www.cnr.it/ontology/cnr/individuo/prodotto/ID41949
Approximate queries by relaxing structural constraints in GIS (Articolo in rivista)
- Type
- Label
- Approximate queries by relaxing structural constraints in GIS (Articolo in rivista) (literal)
- Anno
- 2007-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/978-3-540-76292-8_46 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- D'Ulizia Arianna, Ferri Fernando, Grifoni Patrizia (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
- http://link.springer.com/content/pdf/10.1007%2F978-3-540-76292-8_46.pdf (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- Volume Title: Advances in Conceptual Modeling Foundations and Applications
ER 2007 Workshops CMLSA, FP-UML, ONISW, QoIS, RIGiM,SeCoGIS, Auckland, New Zealand, November 5-9, 2007. Proceedings (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
- Note
- Scopus (literal)
- Google Scholar (literal)
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- D'Ulizia Arianna, Ferri Fernando, Grifoni Patrizia: IRPPS-CNR (literal)
- Titolo
- Approximate queries by relaxing structural constraints in GIS (literal)
- Abstract
- In the Geographic Information System (GIS) domain the evaluation of similarity among geographical objects plays an important role. This paper proposes an approach based on semantic and structural similarities to provide more flexible matches between the query search condition expressed by the user and the possible answers provided by the system. The relaxation model considers with different weights the semantic similarity of geographical concepts, that is evaluated by adopting the information content approach, and the structural similarity of the attributes and types of geographical objects that is inspired by the maximum weighted matching problem in bipartite graphs.The aim of the proposed methodology is to relax structural query constraints, in order to obtain meaningful answers for imprecise or missing data. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di