Approximate information retrieval based on multielement bounds

Authors:
Jianjiang Lu;Dazhou Kang;Yafei Zhang;Yanhui Li
Affiliations:
Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China;School of Computer Science and Engineering, Southeast University, Nanjing 210096, China;Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China;School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
Venue:
Knowledge-Based Systems
Year:
2008

Citing 11
Cited 0

Logic for information technology

Logic for information technology
Mediators in the Architecture of Future Information Systems

Computer
Mind your vocabulary: query mapping across heterogeneous information sources

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
OBSERVER: An Approach for Query Processing in Global Information Systems Based on Interoperation Across Pre-Existing Ontologies

Distributed and Parallel Databases
Capabilities-based query rewriting in mediator systems

DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Introduction to Modern Information Retrieval

Introduction to Modern Information Retrieval
Approximate query mapping: Accounting for translation closeness

The VLDB Journal — The International Journal on Very Large Data Bases
Information Sharing on the Semantic Web

Information Sharing on the Semantic Web
Answering queries using views: A KRDB perspective for the semantic Web

ACM Transactions on Internet Technology (TOIT)
Information Retrieval and the Semantic Web

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 4 - Volume 04
A survey on ontology mapping

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ontology-based information systems can offer precision and effective information retrieval but suffer from the problem of ontology heterogeneity. Approximate information filtering approaches use approximations of concepts to solve this problem. Current methods only consider one-to-one concept subsumption relations, so cannot yield the closest approximations of concepts. No effective algorithm has been previously reported to find the closest approximations of concepts. This paper defines multielement least upper bounds and multielement greatest lower bounds that contain disjunctions or conjunctions of concepts. The approximations based on them are proved to be the closest possible approximations of concepts. Multielement bounds may contain much redundancy: this increases the expression complexity of the approximations of concepts. We also define simplified multielement bounds to remove redundancy, and provide effective algorithms to find them.