Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
Measuring semantic similarity in the taxonomy of WordNet
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Text retrieval with more realistic concept matching and reinforcement learning
Information Processing and Management: an International Journal
Exploring GPU architectures to accelerate semantic comparison for intention-based search
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
| Hi-index | 0.00 |
Semantic Routed Network (SRN) can provide a scalable distributed solution for searching data in a large grid. In SRN, messages are routed in a overlay network based on the meaning of the message key. If the message key describes the desired data, then SRN nodes can be addressed and accessed by the description of their data content. The key challenges of materializing a SRN are: (1) designing a data structure which will represent complex descriptions of data objects; (2) computing similarity of descriptors; and (3) constructing a small world network topology that minimize the routing response time and maximize routing success, which depends on solving the first two problems. We present a design of a descriptor data structure and a technique to compare their similarity to address the first two problems.