2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)最新文献

筛选
英文 中文
Two phase transitions in the adaptive voter model based on the homophily principle 基于同质性原则的自适应选民模型的两个相变
Takashi Ishikawa
{"title":"Two phase transitions in the adaptive voter model based on the homophily principle","authors":"Takashi Ishikawa","doi":"10.1109/ASONAM.2014.6921579","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921579","url":null,"abstract":"Dynamics on and of networks are two basic processes that drive coevolving networks such as online social networks. The paper investigates the mechanism of coevolving networks using a generalized adaptive voter model based on related work and the homophily principle which is known as a driving mechanism to form community structure in social networks. The proposed model has mechanisms for dynamics on and of coevolving networks, which are node state change via social interactions and link rewiring based on homophily. The numerical simulation of the proposed model reveals that there exists two phase transitions for the parameters adaptability and homophily. This observation implies that the nature of the homophily principle lies in the adaptive mechanism in the proposed model.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115213349","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}
引用次数: 0
On the endogenesis of Twitter's Spritzer and Gardenhose sample streams 论推特的Spritzer和Gardenhose样本流的内生
Dennis Kergl, R. Roedler, Sebastian Seeber
{"title":"On the endogenesis of Twitter's Spritzer and Gardenhose sample streams","authors":"Dennis Kergl, R. Roedler, Sebastian Seeber","doi":"10.1109/ASONAM.2014.6921610","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921610","url":null,"abstract":"Many recent publications deal with trend analysis, event detection or opinion mining on social media data. Twitter, as the most important microblogging service, is often in the focus of these works, as it offers free access to big volumes of data. The free access, on that many publications rely, is composed of a random subset of the complete public status stream. Publications rely particularly on the uniform distribution of tweets in this sample stream, and therefore, till today, one has to trust in the statement of Twitter that the sample data is indeed uniformly distributed1. In our research on the technical properties of Twitter's streaming data, we found evidence for discovering the method used by Twitter to decide which tweets will show up in the random sample streams. A deeper insight into this process leads to the possible reasons of why Twitter chose the presented sampling method. For this purpose we provide an overview of how Twitter's unique tweet IDs are generated and explain the regularities of each part of a tweet ID. This results also in some information about the tweet ID generating infrastructure of Twitter and what kind of knowledge can possibly be derived from small features like the tweet ID.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114357424","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}
引用次数: 35
Understanding South Asian Violent Extremist Group-group interactions 了解南亚暴力极端主义团体-团体间的互动
D. Skillicorn, Francesca Spezzano, V. S. Subrahmanian, M. Garber
{"title":"Understanding South Asian Violent Extremist Group-group interactions","authors":"D. Skillicorn, Francesca Spezzano, V. S. Subrahmanian, M. Garber","doi":"10.1109/ASONAM.2014.6921660","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921660","url":null,"abstract":"The South Asian Violent Extremist Group (SAVE) dataset describes 500 interactions between 30 South Asian terrorist groups over a 20-year period. We analyze 4 types of interactions between these groups (financial, logistical, operational, and political) via 4 network-theoretic techniques: spectral decomposition and Simmelian ties in an undirected version of the network, and PageRank and betweenness centrality on directed versions of the network. We identify the major players in both the provision and the flows through this network for each type of support. Our analysis shows that the five entities most involved in providing and facilitating all forms of support are Al Qaeda, the Pakistani Inter-Services Intelligence Agency, the Taliban, Lashkar-e-Taiba, and Tehreek-e-Taliban Pakistan.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127571321","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
Using triads to identify local community structure in social networks 利用三合会识别社会网络中的本地社区结构
Justin Fagnan, Osmar R Zaiane, Denilson Barbosa
{"title":"Using triads to identify local community structure in social networks","authors":"Justin Fagnan, Osmar R Zaiane, Denilson Barbosa","doi":"10.1109/ASONAM.2014.6921568","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921568","url":null,"abstract":"We present our novel community mining algorithm that uses only local information to accurately identify communities, outliers, and hubs in social networks. The main component of our algorithm is the T metric, which evaluates the relative quality of a community by considering the number of internal and external triads (3-node cliques) it contains. Furthermore we propose an intuitive statistical method based on our T metric, which correctly identifies outlier and hub nodes within each discovered community. Finally, we evaluate our approach on a series of ground-truth networks and show that our method outperforms the state-of-the-art in community mining algorithms.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125343221","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}
引用次数: 17
Gossip-based partitioning and replication for Online Social Networks 基于八卦的在线社交网络分区和复制
Muhammad Anis Uddin Nasir, Fatemeh Rahimian, Sarunas Girdzijauskas
{"title":"Gossip-based partitioning and replication for Online Social Networks","authors":"Muhammad Anis Uddin Nasir, Fatemeh Rahimian, Sarunas Girdzijauskas","doi":"10.1109/ASONAM.2014.6921557","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921557","url":null,"abstract":"Online Social Networks (OSNs) have been gaining tremendous growth and popularity in the last decade, as they have been attracting billions of users from all over the world. Such networks generate petabytes of data from the social interactions among their users and create many management and scalability challenges. OSN users share common interests and exhibit strong community structures, which create complex dependability patterns within OSN data, thus, make it difficult to partition and distribute in a data center environment. Existing solutions, such as, distributed databases, key-value stores and auto scaling services use random partitioning to distribute the data across a cluster, which breaks existing dependencies of the OSN data and may generate huge inter-server traffic. Therefore, there is a need for intelligent data allocation strategy that can reduce the network cost for various OSN operations. In this paper, we present a gossip-based partitioning and replication scheme that efficiently splits OSN data and distributes the data across a cluster. We achieve fault tolerance and data locality, for one-hop neighbors, through replication. Our main contribution is a social graph placement strategy that divides the social graph into predefined size partitions and periodically updates the partitions to place socially connected users together. To evaluate our algorithm, we compare it with random partitioning and a state-of-the-art solution SPAR. Results show that our algorithm generates up to four times less replication overhead compared to random partitioning and half the replication overhead compared to SPAR.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126921408","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}
引用次数: 5
Research on the selecting mechanism of individual interactive object for online social network 在线社交网络中个体交互对象选择机制研究
Yu-Xiao Pang, Shiyu Du
{"title":"Research on the selecting mechanism of individual interactive object for online social network","authors":"Yu-Xiao Pang, Shiyu Du","doi":"10.1109/ASONAM.2014.6921681","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921681","url":null,"abstract":"The exploration of the mechanism of human behavior becomes very hot and interesting due to its importance and complexity. With the improvement of network technology, online social networks have developed rapidly and changed the traditional way of people's communication. Large amount of data of user behavior is recorded, which gives us an opportunity to study the mechanism of human behavior. In this paper, we mainly research on the selecting mechanism of individual on online social networks. First of all, we put forward the individual interactive model used for explaining how an individual choose his interactive object on online social network based on the sociology, psychology and network theory. Then, to fit the data requirement of this model, we crawl and collect the data from actual online platforms. Furthermore, simulation and empirical study have been completed in two different platforms respectively to verify the accuracy of this model. Finally, we gained high level prediction accuracy rate to predict people's interactive behavior in future periods, which brings great significance in relative study area.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151168","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}
引用次数: 4
Question difficulty evaluation by knowledge gap analysis in Question Answer communities 基于知识缺口分析的问答社区问题难度评价
Chih-Lu Lin, Ying-Liang Chen, Hung-Yu kao
{"title":"Question difficulty evaluation by knowledge gap analysis in Question Answer communities","authors":"Chih-Lu Lin, Ying-Liang Chen, Hung-Yu kao","doi":"10.1109/ASONAM.2014.6921606","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921606","url":null,"abstract":"The Community Question Answer (CQA) service is a typical forum of Web 2.0 that shares knowledge among people. There are thousands of questions that are posted and solved every day. Because of the various users of the CQA service, question search and ranking are the most important topics of research in the CQA portal. In this study, we addressed the problem of identifying questions as being hard or easy by means of a probability model. In addition, we observed the phenomenon called knowledge gap that is related to the habit of users and used a knowledge gap diagram to illustrate how much of a knowledge gap exists in different categories. To this end, we proposed an approach called the knowledge-gap-based difficulty rank (KG-DRank) algorithm, which combines the user-user network and the architecture of the CQA service to find hard questions. We used f-measure, AUC, MAP, NDCG, precision@Top5 and concordance analysis to evaluate the experimental results. Our results show that our approach leads to better performance than other baseline approaches across all evaluation metrics.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100493","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}
引用次数: 10
A fuzzy clustering algorithm to detect criminals without prior information 一种无先验信息的模糊聚类算法
Changjun Fan, Kaiming Xiao, Bao-Xin Xiu, Guodong Lv
{"title":"A fuzzy clustering algorithm to detect criminals without prior information","authors":"Changjun Fan, Kaiming Xiao, Bao-Xin Xiu, Guodong Lv","doi":"10.1109/ASONAM.2014.6921590","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921590","url":null,"abstract":"Crime analysis has been widely studied, but problem of identifying conspirators through communication network analysis is still not well resolved. In this paper, we proposed a fuzzy clustering algorithm to detect hidden criminals from topic network, which took no use of individuals' prior identity information. We first built up a local suspicion calculation from nodes' neighboring information (node and edge); and then with global information, we employed the fuzzy k-means clustering algorithm, and made the membership to suspicious group as the global suspicion degree. Experiments showed it works well on identification: known suspects gained relative high values and known innocents got relative low values.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124905573","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
A novel algorithm for community detection and influence ranking in social networks 一种新的社交网络社区检测与影响力排序算法
Wenjun Wang, W. Street
{"title":"A novel algorithm for community detection and influence ranking in social networks","authors":"Wenjun Wang, W. Street","doi":"10.1109/ASONAM.2014.6921641","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921641","url":null,"abstract":"Community detection and influence analysis are significant notions in social networks. We exploit the implicit knowledge of influence-based connectivity and proximity encoded in the network topology, and propose a novel algorithm for both community detection and influence ranking. Using a new influence cascade model, the algorithm generates an influence vector for each node, which captures in detail how the node's influence is distributed through the network. Similarity in this influence space defines a new, meaningful and refined connectivity measure for the closeness of any pair of nodes. Our approach not only differentiates the influence ranking but also effectively finds communities in both undirected and directed networks, and incorporates these two important tasks into one integrated framework. We demonstrate its superior performance with extensive tests on a set of real-world networks and synthetic benchmarks.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124327247","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}
引用次数: 27
An analysis of positivity and negativity attributes of users in twitter 推特用户的积极与消极属性分析
M. Roshanaei, Shivakant Mishra
{"title":"An analysis of positivity and negativity attributes of users in twitter","authors":"M. Roshanaei, Shivakant Mishra","doi":"10.1109/ASONAM.2014.6921611","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921611","url":null,"abstract":"Effect of mood and emotion on a person's behavior and his/her interactions with other people has been studied for a long time. Positivity and negativity of a person are two important attributes of emotion and mood. Social media is a very important platform from which we can glean the positivity and negativity attributes of a user based on his/her message postings and interactions with other users. In this paper, we study and analyze a Twitter dataset of more than 130,000 users to understand the nature of their positivity and negativity attributes. We measure behavioral attributes by sentiment analysis relating to social personal concern and psychological process. We observe that social media contains useful behavioral cues to classify users into positive and negative groups based on network density and degree of social activity either in information sharing or emotional interaction and social awareness. We believe that our findings will be useful in developing tools for predicting positive and negative users and help provide the best recommendation towards helping negative users through online social media.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062117","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信