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

Authors: Boanerges Aleman-Meza, Meenakshi Nagarajan, Li Ding, Amit Sheth, Budak Arpinar, Anupam Joshi, and Tim Finin

Journal: ACM Transactions on the Web

Date: February 01, 2008

Abstract: 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.

Type: Article

Address: New York

Publisher: Association of Computing Machinery

Note: (see http://portal.acm.org/citation.cfm?doid=1326561.1326567)

Number: 1

Volume: 2

Tags: semantic web, trust, social network analysis

Google Scholar: L64c_LP71W0J

Number of Google Scholar citations: 14 [show citations]

Number of downloads: 1387

Available for download as

size: 164175 bytes

Related Projects:

Past Project

 Semantic Discovery: Discovering Complex Relationships in Semantic Web.

Bookmark at: Digg | Del.icio.us | Connotea | CiteULike