Filters








46,363 Hits in 4.4 sec

RecService: Distributed Real-Time Graph Processing at Twitter

Ajeet Grewal, Jerry Jiang, Gary Lam, Tristan Jung, Lohith Vuddemarri, Quannan Li, Aaditya Landge, Jimmy Lin
2018 USENIX Workshop on Hot Topics in Cloud Computing  
Real-time recommendations are framed in terms of a user's social context and real-time events incident on that social context, generated from ad hoc point queries and long-lived standing queries.  ...  We present RecService, a distributed real-time graph processing engine that drives billions of recommendations on Twitter.  ...  ., influence accumulates over time), whereas real-time events are transient, since their value decays (which is the entire point of real-time recommendations).  ... 
dblp:conf/hotcloud/GrewalJLJVLLL18 fatcat:mjv25kif3zgopa4kbcq5vsg6pq

K-Hop Community Search Based On Local Distance Dynamics

2018 KSII Transactions on Internet and Information Systems  
Relying on a proposed local distance dynamics model, the distances among nodes change over time, where the nodes sharing the same community with the query node tend to gradually move together, while other  ...  Apart from the user-defined metric algorithm, how can we search the natural community that the query node belongs to?  ...  community for the query node from a large-scale graph within a short computation time.  ... 
doi:10.3837/tiis.2018.07.005 fatcat:rgmzzafponds3j4zof46jg5g5i

Query-Driven Sampling for Collective Entity Resolution [article]

Christan Grant, Daisy Zhe Wang, Michael L. Wick
2015 arXiv   pre-print
However, for large datasets this is an extremely expensive process.  ...  Finally, we show that query-driven ER algorithms can converge and return results within minutes over a database populated with the extraction from a newswire dataset containing 71 million mentions.  ...  MCMC scales with large real world models better than loopy belief propagation [40] .  ... 
arXiv:1508.03116v1 fatcat:2qnfqdc7x5e4pcw76rgap6zhyy

Targeted Influential Nodes Selection in Location-Aware Social Networks

Susu Yang, Hui Li, Zhongyuan Jiang
2018 Complexity  
Experimental study over three real-world social networks verified the seed quality of our framework, and the coarsening-based algorithm can provide superior efficiency.  ...  Given a target area and a location-aware social network, the location-aware influence maximization problem aims to find a set of seed users such that the information spread from these users will reach  ...  with the polygon queried and the fewer the number of polygon edges, the fewer the comparison times and the less time.  ... 
doi:10.1155/2018/6101409 fatcat:srsvyu5knrabrhf43p5wgkzgga

Deep Reinforcement Learning-Based Approach to Tackle Topic-Aware Influence Maximization

Shan Tian, Songsong Mo, Liwei Wang, Zhiyong Peng
2020 Data Science and Engineering  
We conducted experiments on generated graph instances and real-world social networks. The results show the superiority in performance and comparable quality of our framework.  ...  Based on this model, we can construct the solution according to the influence evaluations efficiently, rather than spending a high cost to compute the exact influence by considering the complex graph structure  ...  It focuses on maximizing the targeted influence over users who are relevant to the query topics under specific diffusion models.  ... 
doi:10.1007/s41019-020-00117-1 fatcat:spzg3smjjzhzhfwiixvqrhbvxe

On uncertain graphs modeling and queries

Arijit Khan, Lei Chen
2015 Proceedings of the VLDB Endowment  
While many classical graph algorithms such as reachability and shortest path queries become #P-complete, and hence, more expensive in uncertain graphs; various complex queries are also emerging over uncertain  ...  networks, such as pattern matching, information diffusion, and influence maximization queries.  ...  , 5] , and they were often targeted towards specific sub-problems (e.g., influence maximization [5] ), or towards specific sub-areas (e.g., social networks [1] ).  ... 
doi:10.14778/2824032.2824133 fatcat:xjaeoxqlqba4veng7nf7g7vqxu

Efficient Targeted Influence Maximization Based on Multidimensional Selection in Social Networks

Dong Jing, Ting Liu
2021 Frontiers in Physics  
However, in real applications, it is commonly required that only special nodes (target) in the network are expected to be influenced, which can use the same cost of placing seed nodes but influence more  ...  The influence maximization problem over social networks has become a popular research problem, since it has many important practical applications such as online advertising, virtual market, and so on.  ...  FIGURE 7 | 7 FIGURE 7 | The average time cost of targeted influence maximization algorithm for evaluating the randomly generated query groups over four datasets.  ... 
doi:10.3389/fphy.2021.768181 fatcat:ajceqrjmd5ef7lg32gdypvooxu

Real-time targeted influence maximization for online advertisements

Yuchen Li, Dongxiang Zhang, Kian-Lee Tan
2015 Proceedings of the VLDB Endowment  
In this paper, we propose a new problem, named Keyword-Based Targeted Influence Maximization (KB-TIM), to find a seed set that maximizes the expected influence over users who are relevant to a given advertisement  ...  To meet the instant-speed requirement, we propose two disk-based solutions that improve the query processing time by two orders of magnitude over the state-of-the-art solutions, while keeping the theoretical  ...  As mentioned, PMIA does not have any theoretical bound and is not applicable to very large graphs. In [13] , Inflex was proposed to achieve real-time performance.  ... 
doi:10.14778/2794367.2794376 fatcat:iaoo2v3izfd2fc5picu5vlrdee

Realtime analysis of information diffusion in social media

Io Taxidou, Peter Fischer
2013 Proceedings of the VLDB Endowment  
The goal of this thesis is to investigate real-time analysis methods on social media with a focus on information diffusion.  ...  Our high level goal is to investigate how information diffuses in real time on the underlying social network and the role of different users in the propagation process.  ...  graph state over long time.  ... 
doi:10.14778/2536274.2536328 fatcat:icunoeezlbcmha2wipnxave5pq

Targeted Influence Maximization Based on Cloud Computing over Big Data in Social Networks

Shiyu Chen, Xiaochun Yin, Qi Cao, Qianmu Li, Huaqiu Long
2020 IEEE Access  
These methods aim to find a seed set that maximizes the expected influence spread over target users who are relevant to given topics.  ...  Then, efficient algorithms with approximation guarantee are provided using a bounded number of queries to the graph structure.  ...  Step 9: Repeat Step 8 θ times and obtain θ sub-graphs of G. B. SEED SELECTION This section provides the algorithm for targeted influence maximization on the sampled graphs.  ... 
doi:10.1109/access.2020.2978010 fatcat:dfuusfu6hbdr5bj3baoxhn7gmm

Transient and Persistent RDF Views over Relational Databases in the Context of Digital Repositories [chapter]

Nikolaos Konstantinou, Dimitrios-Emmanuel Spanos, Nikolas Mitrou
2013 Communications in Computer and Information Science  
of query response times, especially when expensive SQL queries are involved.  ...  However, several factors need to be taken into account in doing so, among which is whether the transition needs to be materialized in real-time or in asynchronous time intervals.  ...  It would be advisable to prefer real-time query answering over transient RDF views when the data is subject to frequent changes, and less frequent queries (for example, such as in social networks).  ... 
doi:10.1007/978-3-319-03437-9_33 fatcat:d2q7eb5msrbatlfs3bnud5k4g4

NeMa

Arijit Khan, Yinghui Wu, Charu C. Aggarwal, Xifeng Yan
2013 Proceedings of the VLDB Endowment  
To query these networks, one often needs to identify the matches of a given query graph in a (typically large) network modeled as a target graph.  ...  Given a query graph and a target graph, the problem is to identify the (top-k) matches of the query graph with minimum costs in the target graph.  ...  To query these graphs, one often needs to identify the matches of a given query graph in a (typically large) target graph.  ... 
doi:10.14778/2535569.2448952 fatcat:erpi2nmrnzckrhqjfdsthfa6ke

Graph Summarization Methods and Applications: A Survey [article]

Yike Liu, Tara Safavi, Abhilash Dighe, Danai Koutra
2018 arXiv   pre-print
Finally, we discuss applications of summarization on real-world graphs and conclude by describing some open problems in the field.  ...  This survey is a structured, comprehensive overview of the state-of-the-art methods for summarizing graph data. We first broach the motivation behind, and the challenges of, graph summarization.  ...  In these cases, user studies and qualitative criteria may be employed. (5) Change over time. Ideally, graph summaries should evolve over time, since real data are usually dynamic.  ... 
arXiv:1612.04883v3 fatcat:fhg2g5eldfdgfkzoqdmbfl5er4

Massive scale cyber traffic analysis

Cliff Joslyn, Sutanay Choudhury, David Haglin, Bill Howe, Bill Nickless, Bryan Olsen
2013 First International Workshop on Graph Data Management Experiences and Systems - GRADES '13  
We describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages (SPARQL and Datalog), and use these examples to motivate  ...  TA involves observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to detect suspicious patterns.  ...  Fig. 6 shows this attack as a hybrid graph pattern. Over the time interval [1, 100] baseline bidirectional flow traffic is established between a bait machine and multiple targets.  ... 
doi:10.1145/2484425.2484428 dblp:conf/sigmod/JoslynCHHNO13 fatcat:sfuhybu64racji5lugpj64v7sy

Defending against Sybil Devices in Crowdsourced Mapping Services [article]

Gang Wang, Bolun Wang, Tianyi Wang, Ana Nika, Haitao Zheng, Ben Y. Zhao
2016 arXiv   pre-print
Over time, co-location edges combine to form large proximity graphs that attest to physical interactions between devices, allowing scalable detection of virtual vehicles.  ...  Real-time crowdsourced maps such as Waze provide timely updates on traffic, congestion, accidents and points of interest.  ...  Intuitively, real users will get more weights on their edges as they use Waze over time.  ... 
arXiv:1508.00837v2 fatcat:s2lphpripfa2hfv6qopybk27tq
« Previous Showing results 1 — 15 out of 46,363 results