Scalable Semantic Analytics on Social Networks for Addressing the Problem of Conflict of Interest Detection

被引:17
作者
Aleman-Meza, Boanerges [1 ]
Nagarajan, Meenakshi [2 ]
Ding, Li [3 ]
Sheth, Amit [2 ]
Arpinar, I. Budak [1 ]
Joshi, Anupam [4 ]
Finin, Tim [4 ]
机构
[1] Univ Georgia, Dept Comp Sci, LSDIS Lab, Athens, GA 30602 USA
[2] Wright State Univ, Coll Engn & Comp Sci, Kno e sis Ctr, Dayton, OH 45435 USA
[3] Stanford Univ, Dept Comp Sci, AI Lab, Stanford, CA 94305 USA
[4] Univ Maryland, Dept Comp Sci & Elect Engn, Baltimore, MD 21250 USA
关键词
Semantic Web; social networks; conflict of interest; peer review process; semantic analytics; entity disambiguation; data fusion; semantic associations; ontologies; RDF; DBLP; swetoDblp;
D O I
10.1145/1326561.1326568
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we demonstrate the applicability of semantic techniques for detection of Conflict of Interest (COI). We explain the common challenges involved in building scalable Semantic Web applications, in particular those addressing connecting-the-dots problems. We describe in detail the challenges involved in two important aspects on building Semantic Web applications, namely, data acquisition and entity disambiguation (or reference reconciliation). We extend upon our previous work where we integrated the collaborative network of a subset of DBLP researchers with persons in a Friend-of-a-Friend social network (FOAF). Our method finds the connections between people, measures collaboration strength, and includes heuristics that use friendship/affiliation information to provide an estimate of potential COI in a peer-review scenario. Evaluations are presented by measuring what could have been the COI between accepted papers in various conference tracks and their respective program committee members. The experimental results demonstrate that scalability can be achieved by using a dataset of over 3 million entities (all bibliographic data from DBLP and a large collection of FOAF documents).
引用
收藏
页数:29
相关论文
共 54 条
[1]  
Adamic L. A., 2003, First Monday, V8, DOI 10.5210/fm.v8i6.1057
[2]   Ranking complex relationships on the semantic Web [J].
Aleman-Meza, B ;
Halaschek-Wiener, C ;
Arpinar, IB ;
Ramakrishnan, C ;
Sheth, AP .
IEEE INTERNET COMPUTING, 2005, 9 (03) :37-44
[3]   SwetoDblp ontology of computer science publications [J].
Aleman-Meza, Boanerges ;
Hakimpour, Farshad ;
Arpinar, I. Budak ;
Sheth, Amit P. .
JOURNAL OF WEB SEMANTICS, 2007, 5 (03) :151-155
[4]  
ALEMANMEZA B, 2006, P 15 INT C WORLD WID, P407
[5]  
Anderson R., 1998, P 1 INT WORKSH REC A
[6]  
[Anonymous], 1998, Social Structures: A Network Approach
[7]  
[Anonymous], P 12 INT WORLD WID W
[8]  
ANYANWU K, 2007, P 14 INT WORLD WID W
[9]  
Aswani N, 2006, LECT NOTES COMPUT SC, V4273, P329
[10]  
Barabasi A.L., 2002, The formula: the universal laws of success