2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)最新文献_第6页

Beyond friendships and followers: The Wikipedia social network 超越友谊和追随者:维基百科社交网络

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808840

Johanna Geiß, Andreas Spitz, Michael Gertz

引用次数: 14

Detection of top-k central nodes in social networks: A compressive sensing approach 社交网络中top-k中心节点的检测:一种压缩感知方法

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808811

H. Mahyar

{"title":"Detection of top-k central nodes in social networks: A compressive sensing approach","authors":"H. Mahyar","doi":"10.1145/2808797.2808811","DOIUrl":"https://doi.org/10.1145/2808797.2808811","url":null,"abstract":"In analysing the structural organization of a social network, identifying important nodes has been a fundamental problem. The concept of network centrality deals with the assessment of the relative importance of a particular node within the network. Most of the traditional network centrality definitions have a high computational cost and require full knowledge of network topological structure. On the one hand, in many applications we are only interested in detecting the top-k central nodes of the network with the largest values considering a specific centrality metric. On the other hand, it is not feasible to efficiently identify central nodes in a large real-world social network via calculation of centrality values for all nodes. As a result, recent years have witnessed increased attention toward the challenging problem of detecting top k central nodes in social networks with high accuracy and without full knowledge of network topology. To this end, we in this paper present a compressive sensing approach, called CS-TopCent, to efficiently identify such central nodes as a sparsity specification of social networks. Extensive simulation results demonstrate that our method would converge to an accurate solution for a wide range of social networks.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130124891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Query-based graph cuboid outlier detection 基于查询的图长方体离群点检测

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2810061

Ayushi Dalmia, Manish Gupta, Vasudeva Varma

{"title":"Query-based graph cuboid outlier detection","authors":"Ayushi Dalmia, Manish Gupta, Vasudeva Varma","doi":"10.1145/2808797.2810061","DOIUrl":"https://doi.org/10.1145/2808797.2810061","url":null,"abstract":"Various projections or views of a heterogeneous information network can be modeled using the graph OLAP (On-line Analytical Processing) framework for effective decision making. Detecting anomalous projections of the network can help the analysts identify regions of interest from the graph specific to the projection attribute. While most previous studies on outlier detection in graphs deal with outlier nodes, edges or subgraphs, we are the first to propose detection of graph cuboid outliers. Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice. A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query. The GCOutlier detection task is clearly challenging because: (1) finding matches for the query (subgraph isomorphism) is NP-hard; (2) number of matches for the query can be very high; and (3) number of cuboids can be large. We provide an approximate solution to the problem by computing only a fraction of the total matches originating from a select set of candidate nodes and including a select set of edges, chosen smartly. We perform extensive experiments on synthetic datasets to showcase the execution time versus accuracy trade-off. Experiments on real datasets like Four Area and Delicious containing thousands of nodes reveal interesting GCOutliers.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Voting algorithm in the play Julius Caesar 《凯撒大帝》中的投票算法

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2810064

Zvi Lotker

{"title":"Voting algorithm in the play Julius Caesar","authors":"Zvi Lotker","doi":"10.1145/2808797.2810064","DOIUrl":"https://doi.org/10.1145/2808797.2810064","url":null,"abstract":"This paper suggests a voting algorithm for predicting people's choices. Usually, once a new algorithm is offered, one needs to prove the soundness of the algorithm, i.e., showing that the algorithm does the thing it is set up to do. But in the case of election prediction algorithms it's not clear how to prove their soundness. This paper offers a way to deal with this problem by analysing the social networks of plays, following Shakespeare dictum: \"all the world is a stage, and all the men and women merely players\", As you like it, act I scene VII. The advantage of this approach is clear. The story of Julius Caesar is part of our collective memory. We learn the leading characters views and opinions throughout the play. For example, we know that Brutus was against Caesar, while Antony supported Caesar, and opposed Brutus. By generating the social graph from a play, the problems of soundness is solved, which makes the process more scientific. The voting algorithm needs anchors for each party. The anchors are the characters/nodes whose opinions are clear and known. In the case of the play Julius Caesar, the anchors are Brutus and Cassius for the conspirators and Antony and Octavius for the supporters of Caesar. After the anchors were identified the voting algorithm uses simple random walks, to divide the network of characters into two parties. Now it is possible to examine the output of the voting algorithm and see that indeed the algorithm works correctly.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129497939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

From coincidence to purposeful flow? Properties of transcendental information cascades 从巧合到有目的的心流?先验信息级联的性质

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2809393

Markus Luczak-Rösch, Ramine Tinati, M. V. Kleek, N. Shadbolt

{"title":"From coincidence to purposeful flow? Properties of transcendental information cascades","authors":"Markus Luczak-Rösch, Ramine Tinati, M. V. Kleek, N. Shadbolt","doi":"10.1145/2808797.2809393","DOIUrl":"https://doi.org/10.1145/2808797.2809393","url":null,"abstract":"In this paper, we investigate a method for constructing cascades of information co-occurrence, which is suitable to trace emergent structures in information in scenarios where rich contextual features are unavailable. Our method relies only on the temporal order of content-sharing activities, and intrinsic properties of the shared content itself. We apply this method to analyse information dissemination patterns across the active online citizen science project Planet Hunters, a part of the Zooniverse platform. Our results lend insight into both structural and informational properties of different types of identifiers that can be used and combined to construct cascades. In particular, significant differences are found in the structural properties of information cascades when hashtags as used as cascade identifiers, compared with other content features. We also explain apparent local information losses in cascades in terms of information obsolescence and cascade divergence; e.g., when a cascade branches into multiple, divergent cascades with combined capacity equal to the original.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130198905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Incorporating big data and social sensors in a novel early warning system of dengue outbreaks 将大数据和社会传感器纳入新型登革热疫情预警系统

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808883

Chung-Hong Lee, Hsin-Chang Yang, Shih-Jan Lin

{"title":"Incorporating big data and social sensors in a novel early warning system of dengue outbreaks","authors":"Chung-Hong Lee, Hsin-Chang Yang, Shih-Jan Lin","doi":"10.1145/2808797.2808883","DOIUrl":"https://doi.org/10.1145/2808797.2808883","url":null,"abstract":"In this work, an \"analytical data model of mosquito vector\" was developed to perform analytical computation to the character of the dengue vectors. Our goal is to investigate a way to understand how the temporal trend of collected dataset correlates with the incidence dengue as identified by national health authorities. Based upon the mosquito-vector big data collections, we investigate how changes in some specific variables such as rainfall, temperature, and humidity can dramatically affect the population of mosquito vectors, in order to provide early warnings of dengue outbreaks. Thus, our system will collectively collect online sensing data of the variables and store them in a database, in order to combine the historical big data as training datasets for analytical computation. Also, the developed model is able to merge the experimental datasets with current hot-topic information which is relevant to mosquito vectors obtained from data of social sensors (i.e. social messages). The experimental data show that our system is of great potentials in providing early warnings of dengue outbreaks.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Local community detection via flow propagation 通过流传播检测本地社区

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808892

C. Panagiotakis, H. Papadakis, P. Fragopoulou

引用次数: 5

Influence propagation over large scale social networks 影响在大型社交网络上的传播

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808888

G. Cordasco, L. Gargano, A. A. Rescigno

{"title":"Influence propagation over large scale social networks","authors":"G. Cordasco, L. Gargano, A. A. Rescigno","doi":"10.1145/2808797.2808888","DOIUrl":"https://doi.org/10.1145/2808797.2808888","url":null,"abstract":"We study the influence diffusion problem in online social networks. Formally, given a network represented by a directed graph G = (V, E), we consider a process of influence diffusion in G that proceeds as follows: Initially only the vertices of a given S ⊆ V are influenced; subsequently, at each round, the set of influenced vertices is augmented by all the vertices in the network that have a sufficiently large number of already influenced incoming neighbors. The question is to find a small subset of vertices that can influence the whole network (target set). This is a widely studied problem that abstracts many phenomena in the social, economic, biological, and physical sciences. It is known to be hard to approximate within a factor of 2log1-εn, for any ε > 0, and n = |V|. Despite the above negative result, some efficient heuristics have been recently proposed in the literature. In this paper, we present a scalable, fast, and simple algorithm (MTS) for the influence diffusion problem. Experiments conducted over real-world social networks show that the proposed algorithm produces solutions that substantially outperform those obtained by previously published algorithms. Experiments also show that the performances of the analyzed algorithms (measured by the normalized target set size) correlates positively with the strength of communities of a network (measured by the network modularity). Such correlation is even stronger using the results provided by the MTS algorithm, showing that the proposed MTS algorithm better exploits situations in which the community structure of the networks allows some influence between different communities.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124259136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Actions are louder than words in social media 在社交媒体上，行动比语言更响亮

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2809376

R. Korolov, Justin Peabody, Allen Lavoie, Sanmay Das, M. Magdon-Ismail, W. Wallace

{"title":"Actions are louder than words in social media","authors":"R. Korolov, Justin Peabody, Allen Lavoie, Sanmay Das, M. Magdon-Ismail, W. Wallace","doi":"10.1145/2808797.2809376","DOIUrl":"https://doi.org/10.1145/2808797.2809376","url":null,"abstract":"We study the relationship between the level of chatter on a social medium (like TWitter) and the level of the observed actions related to the chatter. For example, in a disaster, how does relief-donation chatter on Twitter correlate with the dollar amount received? One hypothesis is that a fraction of those who act will also tweet about it, which implies linear scaling, action ∝ chatter. On the other hand, if there is a contagion effect (those who tweet about donation incite others to donate) and these incited donors tend to be \"quiet\" and not broadcast their actions, then we expect superlinear scaling action ∝ chatterγ where γ > 1. We show, using a simple model, that the degree sequence of the social media \"follower\" network plays a key role in determining the scaling exponent γ. For random graphs and power-law graphs, the scaling exponent is at or near 2 (quadratic amplification). We empirically validate the model's predictions using location-paired donation and social media data from U.S. states after Hurricane Sandy. Understanding the scaling behavior that relates social-media chatter to real physical actions is an important step for estimating the extent of a response and for determining social-media strategies to affect the response.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127728149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30

Modeling and utilizing dynamic influence strength for personalized promotion 建模并利用动态影响力进行个性化推广

2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) Pub Date : 2015-08-25 DOI: 10.1145/2808797.2808897

Ya-Wen Teng, Chih-Hua Tai, Philip S. Yu, Ming-Syan Chen

{"title":"Modeling and utilizing dynamic influence strength for personalized promotion","authors":"Ya-Wen Teng, Chih-Hua Tai, Philip S. Yu, Ming-Syan Chen","doi":"10.1145/2808797.2808897","DOIUrl":"https://doi.org/10.1145/2808797.2808897","url":null,"abstract":"As the social networking websites arise, the social network has become an important vehicle for sharing information and exerting influences. For the widespread utilization of social influences, a lot of works such as influence maximization and innovation promotion have been studied on various diffusion models. However, to the best of our knowledge, none of the existing works has incorporated the interplay between the intensity of interest and influence strength, which has been widely observed in social sciences, into the diffusion model. To fulfill this gap, in this paper, we propose the ID model that is able to capture the dynamic influence strength owing to the interplay. Under this ID model, we address the novel utilization of dynamic influence strength for personalized promotion to grow the intensity of a target individual's interest in an issue. In particular, to have the cost of promotion minimized, we introduce a novel Algorithm ISES to search for the least number of individuals as seeds in the promotion strategy. The ISES algorithm is able to identify the cost-effective solution by adopting the backtracking search and employing pruning strategies. On the real dataset of DBLP, the experiments demonstrate the effectiveness of ISES.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129160935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7