11,448 Hits in 7.3 sec

Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs

Guanfeng Liu, Kai Zheng, Yan Wang, Mehmet A. Orgun, An Liu, Lei Zhao, Xiaofang Zhou
2015 2015 IEEE 31st International Conference on Data Engineering  
However, the existing GPM methods do not consider the multiple constraints on edges in GQ, which are commonly exist in various applications such as, crowdsourcing travel, social network based e-commerce  ...  Then, to address the efficiency issue in largescale MC-GPM, we propose a new concept called Strong Social Component (SSC), consisting of participants with strong social connections.  ...  Given a graph pattern query with multiple constraints, e.g., (B, D) of G Q4 in Fig. 2 , based on the social context index, we can quickly investigate if there exists an edge pattern matching in the data  ... 
doi:10.1109/icde.2015.7113297 dblp:conf/icde/LiuZWOLZZ15 fatcat:vi5jxtqzqjacjn4sbtgdzzrxs4

Expert Discovery and Interactions in Mixed Service-Oriented Systems

Daniel Schall, Florian Skopik, Schahram Dustdar
2012 IEEE Transactions on Services Computing  
ExpertHITS takes trust-relations and link properties in social networks into account to estimate the reputation of users.  ...  Our main contributions center around a context-sensitive trust-based algorithm called ExpertHITS inspired by the concept of hubs and authorities in web-based environments.  ...  The ExpertHITS calculation is performed online based on the weighted, trust-based interaction graph.  ... 
doi:10.1109/tsc.2011.2 fatcat:j7skohl3pjc3xl6n5qoovogysu

Pattern-based access control in a decentralised collaboration environment

Jeroen Werbrouck, Ruben Taelman, Ruben Verborgh, Pieter Pauwels, Jakob Beetz, Erik Mannens
2020 CEUR Workshop Proceedings  
As the building industry is rapidly catching up with digital advancements, and Web technologies grow in both maturity and security, a data-and Web-based construction practice comes within reach.  ...  The proposed method will be illustrated with an extension of a custom nodeJS Solid server.  ...  multiple requirements to visitors will be expressed and verified with more ease using a pattern-based approach.  ... 
doi:10.18154/rwth-2021-01701 fatcat:iqck5636w5b5ligdupa36zklai

Social Media Identity Deception Detection: A Survey [article]

Ahmed Alharbi, Hai Dong, Xun Yi, Zahir Tari, Ibrahim Khalil
2021 arXiv   pre-print
Social media have been growing rapidly and become essential elements of many people's lives. Meanwhile, social media have also come to be a popular source for identity deception.  ...  This article is expected to benefit both researchers and social media providers.  ...  Graph-Based Techniques. Kamhoua et al. [44] overcame identity cloning attacks by matching user profiles across multiple social media.  ... 
arXiv:2103.04673v1 fatcat:zf6xcn3pafcgfbxmoewc3yhhpi


2012 International Journal of Cooperative Information Systems  
In order to efficiently discover member compositions based on artifact dependencies, we introduce an indexing and discovery approach based on subgraph matching.  ...  Hence, technical dependencies of artifacts result in social dependencies of collaborating crowd members that create them.  ...  Trust in Social Networks. Social Trust 15,61-63 in service-oriented systems has become a very important research area.  ... 
doi:10.1142/s0218843012500050 fatcat:eqokcsansjgutmhc72n3wgqttq

Modeling and Mining of Dynamic Trust in Complex Service-Oriented Systems [chapter]

Florian Skopik, Daniel Schall, Schahram Dustdar
2011 Socially Enhanced Services Computing  
We argue that trust between members is essential for successful collaborations. Unlike a security perspective, we focus on the notion of social trust in collaborative networks.  ...  We show an interpretative rule-based approach to enable humans and services to establish trust based on interactions and experiences, considering their context and subjective perceptions.  ...  upon a predefined rule base, and updating the trust graph (EMA with a ¼ 0:25).  ... 
doi:10.1007/978-3-7091-0813-0_3 fatcat:5fbkqz67g5bljllro3hii6kzxy

Interaction-Driven Self-adaptation of Service Ensembles [chapter]

Christoph Dorn, Schahram Dustdar
2010 Lecture Notes in Computer Science  
Subsequent reconfiguration and replacement of services enables the ensemble to mature in parallel with the evolution of its user community.  ...  The software services in such systems cannot adapt to user needs based on autonomous principles alone.  ...  Along with the capability model, we have introduced a constraint matching and selection algorithm in [22] .  ... 
doi:10.1007/978-3-642-13094-6_31 fatcat:5viyzuh2draaxdwbezeikwriva

Modeling and mining of dynamic trust in complex service-oriented systems

Florian Skopik, Daniel Schall, Schahram Dustdar
2010 Information Systems  
We argue that trust between members is essential for successful collaborations. Unlike a security perspective, we focus on the notion of social trust in collaborative networks.  ...  We show an interpretative rule-based approach to enable humans and services to establish trust based on interactions and experiences, considering their context and subjective perceptions.  ...  upon a predefined rule base, and updating the trust graph (EMA with a ¼ 0:25).  ... 
doi:10.1016/ fatcat:wf6y5k255ndyjavsidu7b2rr5m

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

2020 KSII Transactions on Internet and Information Systems  
Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation.  ...  Then, we address the cluster formation problem via spectrum clustering with iterative operation.  ...  Then, we propose our weighted-interference minimizing oriented cluster formation scheme and stable rate-maximizing based matching algorithm in Section IV.  ... 
doi:10.3837/tiis.2020.05.007 fatcat:qduy6kekvjhyreaemugtvg42t4

KGRAM Versatile Inference and Query Engine for the Web of Linked Data

Olivier Corby, Alban Gaignard, Catherine Faron Zucker, Johan Montagnat
2012 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology  
This work describes the design of a versatile query system named KGRAM that supports (i) multiple query languages among which the SPARQL 1.1 standard, (ii) federation of multiple heterogeneous and distributed  ...  It also enables querying and reasoning through other forms of graph pattern matching such as Conceptual Graphs Homomorphism.  ...  AQL encompasses various existing query languages such as the Simple Conceptual Graph model [4] or conceptual graphs with constraints [2] .  ... 
doi:10.1109/wi-iat.2012.223 dblp:conf/webi/CorbyGFM12 fatcat:l3cki4p6vjfefc653wweejleva

Consistent Process Mining over Big Data Triple Stores

Antonia Azzini, Paolo Ceravolo
2013 2013 IEEE International Congress on Big Data  
The second uses mismatch values to extend data to be processed with a traditional map reduce algorithm.  ...  Big Data' techniques are often adopted in crossorganization scenarios for integrating multiple data sources to extract statistics or other latent information.  ...  Constraints on posts with text as content do not demonstrate high frequencies, while constraints on post with other contents do not have a strong support.  ... 
doi:10.1109/bigdata.congress.2013.17 dblp:conf/bigdata/AzziniC13 fatcat:oh4v4czmwrhhlgrtu4rxus35vi

SocialScope: Enabling Information Discovery on Social Content Sites [article]

Sihem Amer-Yahia, Cong Yu
2009 arXiv   pre-print
These community standards enable the open access to users' social profiles and connections by individual content sites and are bringing content-oriented sites and social networking sites ever closer.  ...  Recently, many content sites have started encouraging their users to engage in social activities such as adding buddies on Yahoo! Travel and sharing articles with their friends on New York Times.  ...  Graph patterns make it possible to achieve these steps more concisely. Figure 2 depicts a graph pattern showing a 'match' link followed by a 'visit' link.  ... 
arXiv:0909.2058v1 fatcat:dcc2knruj5ba3dwa2qanhawd5y

Organizational social structures for software engineering

Damian A. Tamburri, Patricia Lago, Hans van Vliet
2013 ACM Computing Surveys  
"Members Cohesion dependency graph" "three characteristics [of WGs] are central: [they have] multiple goals, multiple compositions, and multiple results".  ...  Based on our definitions such networks sit at the intersection between SNs and NoPs, since they address a specific practice but show a strong social connotation.  ... 
doi:10.1145/2522968.2522971 fatcat:nvgy2whzcrdibozvtcgzkjuhme

Special Issue on Foundations of Social Computing

Nicolas Kourtellis, Jeremy Blackburn, Cristian Borcea, Adriana Iamnitchi
2015 ACM Transactions on Internet Technology  
We present Prometheus, a socially-aware peer-to-peer service that collects social information from multiple sources into a multigraph managed in a decentralized fashion on user-contributed nodes, and exposes  ...  it through an interface implementing non-trivial social inferences while complying with user-defined access policies.  ...  Its directed, weighted, labeled and multi-edged social graph offers an aggregate representation of users' social state.  ... 
doi:10.1145/2700057 fatcat:s4cd7ssggfdvnlm4evfndtsmqi

A Connection-Centric Survey of Recommender Systems Research [article]

Saverio Perugini, Marcos Andre Goncalves, Edward A. Fox
2003 arXiv   pre-print
Finally, user modeling and the connection-centric viewpoint raise broadening and social issues--such as evaluation, targeting, and privacy and trust--which we also briefly address.  ...  We therefore take a connection-oriented viewpoint toward recommender systems research.  ...  Thus, one user may be matched against many topics and multiple users may be interested in the same topic. Users proceed to rate results.  ... 
arXiv:cs/0205059v2 fatcat:t45q7wvdmrg3badt2ioeagwasa
« Previous Showing results 1 — 15 out of 11,448 results