The symmetric eigenvalue problem
The symmetric eigenvalue problem
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Global Viewing of Heterogeneous Data Sources
IEEE Transactions on Knowledge and Data Engineering
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Learning to match ontologies on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
The PROMPT suite: interactive tools for ontology merging and mapping
International Journal of Human-Computer Studies
iMAP: discovering complex semantic matches between database schemas
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A divide-and-merge methodology for clustering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Web ontology segmentation: analysis, classification and use
Proceedings of the 15th international conference on World Wide Web
Constructing virtual documents for ontology matching
Proceedings of the 15th international conference on World Wide Web
Towards automatic merging of domain ontologies: The HCONE-merge approach
Web Semantics: Science, Services and Agents on the World Wide Web
Combining OWL ontologies using E-Connections
Web Semantics: Science, Services and Agents on the World Wide Web
A string metric for ontology alignment
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Partition-Based block matching of large class hierarchies
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Ontology change: Classification and survey
The Knowledge Engineering Review
Matching large ontologies: A divide-and-conquer approach
Data & Knowledge Engineering
Approximate Structure-Preserving Semantic Matching
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Rewrite techniques for performance optimization of schema matching processes
Proceedings of the 13th International Conference on Extending Database Technology
Discovering executable semantic mappings between ontologies
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Putting ontology alignment in context: usage scenarios, deployment and evaluation in a library case
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Techniques for discovering correspondences between ontologies
International Journal of Web and Grid Services
A concept hierarchy based ontology mapping approach
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
From mappings to modules: using mappings to identify domain-specific modules in large ontologies
Proceedings of the sixth international conference on Knowledge capture
Journal of Biomedical Informatics
Matching large ontologies based on reduction anchors
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Towards a More Scalable Schema Matching: A Novel Approach
International Journal of Distributed Systems and Technologies
| Hi-index | 0.01 |
Ontology matching is a crucial task to enable interoperation between Web applications using different but related ontologies. Today, most of the ontology matching techniques are targeted to find 1:1 mappings. However, block mappings are in fact more pervasive. In this paper, we discuss the block matching problem and suggest that both the mapping quality and the partitioning quality should be considered in block matching. We propose a novel partitioning-based approach to address the block matching issue. It considers both linguistic and structural characteristics of domain entities based on virtual documents, and uses a hierarchical bisection algorithm for partitioning. We set up two kinds of metrics to evaluate of the quality of block matching. The experimental results demonstrate that our approach is feasible.