Sciweavers

394 search results - page 3 / 79
» Structure Preserving Semantic Matching
Sort
View
BIRTHDAY
1997
Springer
13 years 9 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich
TKDE
2010
153views more  TKDE 2010»
13 years 3 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
BDA
2007
13 years 6 months ago
BMatch: a Semantically Context-based Tool Enhanced by an Indexing Structure to Accelerate Schema Matching
Schema matching is a crucial task to gather information of the same domain. This is more true on the web, where a large number of data sources are available and require to be matc...
Fabien Duchateau, Zohra Bellahsene, Mathieu Roche
SIGIR
2004
ACM
13 years 10 months ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma
ICSOC
2003
Springer
13 years 10 months ago
Semantic Structure Matching for Assessing Web-Service Similarity
The web-services stack of standards is designed to support the reuse and interoperation of software components on the web. A critical step in the process of developing applications...
Yiqiao Wang, Eleni Stroulia