Scalable semantic analytics on social networks for addressing the problem of conflict of interest detection

We present a query algebra that supports optimized access of Web services through service-oriented queries. The service query algebra is defined based on a formal service model that provides a high-level abstraction of Web services across an application domain. The algebra defines a set of algebraic operators. Algebraic service queries can be formulated using these operators. This allows users to query their desired services based on both functionality and quality. We provide the implementation of each algebraic operator. This enables the generation of Service Execution Plans (SEPs) that can be used by users to directly access services. We present an optimization algorithm by extending the Dynamic Programming (DP) approach to efficiently select the SEPs with the best user-desired quality. The experimental study validates the proposed algorithm by demonstrating significant performance improvement compared with the traditional DP approach.
Date: February 01, 2008
Book Title: ACM Transactions on the Web
Type: Article
Volume: 2
Number: 1
Publisher: Association of Computing Machinery
Note: (see http://portal.acm.org/citation.cfm?doid=1326561.1326567)
Downloads: 759

Has 1 soft copy


size 164175 bytes

Bibtex


@Article{Scalable_semantic_analytics_on_social_ne,
  author = "Boanerges Aleman-Meza and Meenakshi Nagarajan and Li Ding and Amit Sheth and Budak Arpinar and Anupam Joshi and Tim Finin",
  title = "{Scalable semantic analytics on social networks for addressing the problem of conflict of interest detection}",
  month = "February",
  year = "2008",
  note = "(see http://portal.acm.org/citation.cfm?doid=1326561.1326567)",
  number = "1",
  volume = "2",
  journal = "ACM Transactions on the Web",
  publisher = "Association of Computing Machinery",
}