Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The Chimaera Ontology Environment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
The Knowledge Engineering Review
Automatic acquisition of hyponyms from large text corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Automatic information extraction from large websites
Journal of the ACM (JACM)
Extracting relations from large text collections
Extracting relations from large text collections
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
Description logics with approximate definitions precise modeling of vague concepts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Integrating multiple internet directories by instance-based learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A survey of schema-based matching approaches
Journal on Data Semantics IV
Matching unstructured vocabularies using a background ontology
EKAW'06 Proceedings of the 15th international conference on Managing Knowledge in a World of Networks
Using Semantic Distances for Reasoning with Inconsistent Ontologies
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Ten Challenges for Ontology 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
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
ICAC '09 Proceedings of the 6th international conference on Autonomic computing
A gauss function based approach for unbalanced ontology matching
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Cost efficient, adaptive reasoning strategies for pervasive service discovery
Proceedings of the 2009 international conference on Pervasive services
Investigation of the accuracy of search engine hit counts
Journal of Information Science
Emergence of consensus and shared vocabularies in collaborative tagging systems
ACM Transactions on the Web (TWEB)
Journal of Information Science
Improving accuracy for identifying related PubMed queries by an integrated approach
Journal of Biomedical Informatics
Stop word and related problems in web interface integration
Proceedings of the VLDB Endowment
Actively Learning Ontology Matching via User Interaction
ISWC '09 Proceedings of the 8th International Semantic Web Conference
A Weighted Approach to Partial Matching for Mobile Reasoning
ISWC '09 Proceedings of the 8th International Semantic Web Conference
On the discovery of subsumption relations for the alignment of ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
CSR: discovering subsumption relations for the alignment of ontologies
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Measuring intrinsic quality of semantic search based on feature vectors
International Journal of Metadata, Semantics and Ontologies
Techniques for discovering correspondences between ontologies
International Journal of Web and Grid Services
A spatio-temporal framework for related topic search in micro-blogging
AMT'10 Proceedings of the 6th international conference on Active media technology
Experiments with Google news for filtering newswire articles
CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments
Service-based semantic collaboration in networked systems: a conceptual perspective
The evolution of conceptual modeling
A prediction model for web search hit counts using word frequencies
Journal of Information Science
Towards the taxonomy-oriented categorization of yellow pages queries
ACM Transactions on Internet Technology (TOIT)
A feature-free search query classification approach using semantic distance
Expert Systems with Applications: An International Journal
Using web mining for discovering spatial patterns and hot spots for spatial generalization
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Building Multi-Modal Relational Graphs for Multimedia Retrieval
International Journal of Multimedia Data Engineering & Management
Data Linking for the Semantic Web
International Journal on Semantic Web & Information Systems
Relatedness between vocabularies on the Web of data: A taxonomy and an empirical study
Web Semantics: Science, Services and Agents on the World Wide Web
Relational term-suggestion graphs incorporating multipartite concept and expertise networks
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.01 |
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains where concepts are inherently vague and ill-defined, and cannot be given a crisp definition. A notion of approximate concept mapping is required in such domains, but until now, no such notion is vailable. The first contribution of this paper is a definition for approximate mappings between concepts. Roughly, a mapping between two concepts is decomposed into a number of submappings, and a sloppiness value determines the fraction of these submappings that can be ignored when establishing the mapping. A potential problem of such a definition is that with an increasing sloppiness value, it will gradually allow mappings between any two arbitrary concepts. To improve on this trivial behaviour, we need to design a heuristic weighting which minimises the sloppiness required to conclude desirable matches, but at the same time maximises the sloppiness required to conclude undesirable matches. The second contribution of this paper is to show that a Google based similarity measure has exactly these desirable properties. We establish these results by experimental validation in the domain of musical genres. We show that this domain does suffer from ill-defined concepts. We take two real-life genre hierarchies from the Web, we compute approximate mappings between them at varying levels of sloppiness, and we validate our results against a handcrafted Gold Standard. Our method makes use of the huge amount of knowledge that is implicit in the current Web, and exploits this knowledge as a heuristic for establishing approximate mappings between ill-defined concepts.