Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017最新文献_第5页

Rearrange Social Overloaded Posts to Prevent Social Overload 重新安排社交超载的帖子，防止社交超载

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110078

Yun-Yen Chuang, Hung-Min Hsu, Tsui-Ying Lin, R. Chang

引用次数: 0

Unbiased Sampling of Social Media Networks for Well-connected Subgraphs 良好连接子图的社会媒体网络无偏抽样

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110141

Dong Wang, Zhenyu Li, Gareth Tyson, Zhenhua Li, Gaogang Xie

引用次数: 0

Efficient Implementation of Anchored 2-core Algorithm 锚定二核算法的高效实现

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3120959

Babak Tootoonchi, Venkatesh Srinivasan, Alex Thomo

{"title":"Efficient Implementation of Anchored 2-core Algorithm","authors":"Babak Tootoonchi, Venkatesh Srinivasan, Alex Thomo","doi":"10.1145/3110025.3120959","DOIUrl":"https://doi.org/10.1145/3110025.3120959","url":null,"abstract":"Often graph theory is used to model and analyze different behaviors of networks including social networks. Nowadays, social networks have become very popular and social network providers try to expand their networks by encouraging people to stay engaged and active. Studies show that engagement and activities of people in social networks influence engagement of their connections. This behavior has been modeled by the k-core problem in graph theory with the assumption that a person stays active in the network if he or she has k or more connections. In the above model if a person drops out, his or her friends can become discouraged and they might also drop out. An approach called anchored k-core algorithm has been introduced lately that prevents a cascade of drop-outs by finding nodes which have the most influence on their connections and rewarding them to stay in the network. In this work, an efficient implementation of the anchored 2-core approach has been proposed. The proposed implementation method was applied to a set of real world network data that includes very large graphs with millions of links. The results show that with only a few anchors, it is possible to save hundreds of nodes for the 2-core graph. Also, the execution time of our implementation is in order of minutes for huge datasets which proves the efficiency of our implementation.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"537 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133423773","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

Expertise Discovery in Decentralised Online Social Networks 分散式在线社交网络中的专业知识发现

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110048

S. Ara, S. Thakur, J. Breslin

引用次数: 2

Detecting Journalistic Relevance on Social Media: A two-case study using automatic surrogate features 在社交媒体上检测新闻相关性:使用自动替代特征的两个案例研究

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3122120

Á. Figueira, N. Guimarães

{"title":"Detecting Journalistic Relevance on Social Media: A two-case study using automatic surrogate features","authors":"Á. Figueira, N. Guimarães","doi":"10.1145/3110025.3122120","DOIUrl":"https://doi.org/10.1145/3110025.3122120","url":null,"abstract":"The expansion of social networks has contributed to the propagation of information relevant to general audiences. However, this is small percentage compared to all the data shared in such online platforms, which also includes private/personal information, simple chat messages and the recent called 'fake news'. In this paper, we make an exploratory analysis on two social networks to extract features that are indicators of relevant information in social network messages. Our goal is to build accurate machine learning models that are capable of detecting what is journalistically relevant. We conducted two experiments on CrowdFlower to build a solid ground truth for the models, by comparing the number of evaluations per post against the number of posts classified. The results show evidence that increasing the number of samples will result in a better performance on the relevancy classification task, even when relaxing in the number of evaluations per post. In addition, results show that there are significant correlations between the relevance of a post and its interest and whether is meaningfully for the majority of people. Finally, we achieve approximately 80% accuracy in the task of relevance detection using a small set of learning algorithms.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114142859","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

Of Bots and Humans (on Twitter) 机器人和人类(在Twitter上)

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110090

Z. Gilani, R. Farahbakhsh, Gareth Tyson, Liang Wang, J. Crowcroft

引用次数: 107

Identifying On-time Reward Delivery Projects with Estimating Delivery Duration on Kickstarter 在Kickstarter上通过估算交付时间来确定按时奖励交付项目

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110069

Thanh Tran, Kyumin Lee, Nguyen Vo, Hongkyu Choi

{"title":"Identifying On-time Reward Delivery Projects with Estimating Delivery Duration on Kickstarter","authors":"Thanh Tran, Kyumin Lee, Nguyen Vo, Hongkyu Choi","doi":"10.1145/3110025.3110069","DOIUrl":"https://doi.org/10.1145/3110025.3110069","url":null,"abstract":"In Crowdfunding platforms, people turn their prototype ideas into real products by raising money from the crowd, or invest in someone else's projects. In reward-based crowdfunding platforms such as Kickstarter and Indiegogo, selecting accurate reward delivery duration becomes crucial for creators, backers, and platform providers to keep the trust between the creators and the backers, and the trust between the platform providers and users. According to Kickstarter, 35% backers did not receive rewards on time. Unfortunately, little is known about on-time and late reward delivery projects, and there is no prior work to estimate reward delivery duration. To fill the gap, in this paper, we (i) extract novel features that reveal latent difficulty levels of project rewards; (ii) build predictive models to identify whether a creator will deliver all rewards in a project on time or not; and (iii) build a regression model to estimate accurate reward delivery duration (i.e., how long it will take to produce and deliver all the rewards). Experimental results show that our models achieve good performance -- 82.5% accuracy, 78.1 RMSE, and 0.108 NRMSE at the first 5% of the longest reward delivery duration.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127152264","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}

引用次数: 6

Organizational Tie (De)activation During Crisis 危机期间组织联系(De)的激活

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110032

Sean M. Fitzhugh, Arwen H. DeCostanza

{"title":"Organizational Tie (De)activation During Crisis","authors":"Sean M. Fitzhugh, Arwen H. DeCostanza","doi":"10.1145/3110025.3110032","DOIUrl":"https://doi.org/10.1145/3110025.3110032","url":null,"abstract":"Communication ties afford access to valuable information and resources, but obtaining these advantages requires the effort of forming and maintaining those ties. Preserving a balance between tie benefits and tie costs is essential for members of organizations that require coordination and continuous communication to execute complex tasks. Disrupted task environments exacerbate the challenge of maintaining this balance by 1) increasing the communication load necessary for efficient task execution and 2) increasing the cognitive load necessary for any one individual to carry out his/her duties. In this paper we examine email communication within a military organization performing multifaceted, interdependent tasks prior to and during a crisis event. Using a dynamic model of the evolving communication network, we assess how structural, individual, and tie-based attributes influence one's decision to preserve or dissolve outbound ties and either enhance or degrade an individual's appeal as a communication partner. We find evidence of outbound tie dissolution, particularly among those whose roles or knowledge suggest they would have important information to share, although we also find preservation of strategically valuable ties. The discrepancy between patterns of outbound and inbound tie dissolution suggests that active and passive ties may be subject to differential pressures towards preservation or dissolution.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007277","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

Context Similarity for Retrieval-Based Imputation 基于检索的上下文相似度估算

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3110161

Ahmad Ahmadov, Maik Thiele, Wolfgang Lehner, R. Wrembel

{"title":"Context Similarity for Retrieval-Based Imputation","authors":"Ahmad Ahmadov, Maik Thiele, Wolfgang Lehner, R. Wrembel","doi":"10.1145/3110025.3110161","DOIUrl":"https://doi.org/10.1145/3110025.3110161","url":null,"abstract":"Completeness as one of the four major dimensions of data quality is a pervasive issue in modern databases. Although data imputation has been studied extensively in the literature, most of the research is focused on inference-based approach. We propose to harness Web tables as an external data source to effectively and efficiently retrieve missing data while taking into account the inherent uncertainty and lack of veracity that they contain. Existing approaches mostly rely on standard retrieval techniques and out-of-the-box matching methods which result in a very low precision, especially when dealing with numerical data. We, therefore, propose a novel data imputation approach by applying numerical context similarity measures which results in a significant increase in the precision of the imputation procedure, by ensuring that the imputed values are of the same domain and magnitude as the local values, thus resulting in an accurate imputation. We use Dresden Web Table Corpus which is comprised of more than 125 million web tables extracted from the Common Crawl as our knowledge source. The comprehensive experimental results demonstrate that the proposed method well outperforms the default out-of-the-box retrieval approach.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878890","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

Comparing SVD and word2vec for analysis of malware forum posts 比较SVD和word2vec对恶意论坛帖子的分析

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 Pub Date : 2017-07-31 DOI: 10.1145/3110025.3116205

N. Alsadhan, D. Skillicorn, Richard Frank

引用次数: 0