This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fully Distributed Scheme for Discovery of Semantic Relationships
Oct.-Dec. 2013 (vol. 6 no. 4)
pp. 457-469
Juan Li, North Dakota State University, Fargo
Hui Wang, Stevens Institute of Technology, Hoboken
Samee Ullah Khan, North Dakota State University, Fargo
Qingrui Li, North Dakota State University, Fargo
Albert Y. Zomaya, The University of Sydney, Sydney
The availability of large volumes of Semantic Web data has created the potential of discovering vast amounts of knowledge. Semantic relation discovery is a fundamental technology in analytical domains, such as business intelligence and homeland security. Because of the decentralized and distributed nature of Semantic Web development, semantic data tend to be created and stored independently in different organizations. Under such circumstances, discovering semantic relations faces numerous challenges, such as isolation, scalability, and heterogeneity. This paper proposes an effective strategy to discover semantic relationships over large-scale distributed networks based on a novel hierarchical knowledge abstraction and an efficient discovery protocol. The approach will effectively facilitate the realization of the full potential of harnessing the collective power and utilization of the knowledge scattered over the Internet.
Index Terms:
Semantics,Peer to peer computing,Protocols,Resource description framework,Logic gates,Network topology,semantic relation,Distributed systems,distributed discovery,Semantic Web
Citation:
Juan Li, Hui Wang, Samee Ullah Khan, Qingrui Li, Albert Y. Zomaya, "A Fully Distributed Scheme for Discovery of Semantic Relationships," IEEE Transactions on Services Computing, vol. 6, no. 4, pp. 457-469, Oct.-Dec. 2013, doi:10.1109/TSC.2012.16
Usage of this product signifies your acceptance of the Terms of Use.