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

筛选
英文 中文
CIMTDetect: A Community Infused Matrix-Tensor Coupled Factorization Based Method for Fake News Detection 基于社区注入矩阵-张量耦合分解的假新闻检测方法
Shashank Gupta, Raghuveer Thirukovalluru, Manjira Sinha, Sandya Mannarswamy
{"title":"CIMTDetect: A Community Infused Matrix-Tensor Coupled Factorization Based Method for Fake News Detection","authors":"Shashank Gupta, Raghuveer Thirukovalluru, Manjira Sinha, Sandya Mannarswamy","doi":"10.1109/ASONAM.2018.8508408","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508408","url":null,"abstract":"In this paper, we tackle the problem of fake news detection from social media by exploiting the presence of echo chamber communities (communities sharing same beliefs) that exist within the social network of the users. By modeling the echo-chambers as closely-connected communities within the social network, we represent a news article as a 3-mode tensor of the structure - <News, User, Community> and propose a tensor factorization based method to encode the news article in a latent embedding space preserving the community structure. We also propose an extension of the above method, which jointly models the community and content information of the news article through a coupled matrix-tensor factorization framework. We empirically demonstrate the efficacy of our method for the task of Fake News Detection over two real-world datasets.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"110 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130889431","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}
引用次数: 36
Information Requirements for National Level Cyber Situational Awareness 国家级网络态势感知的信息需求
Stefan Varga, J. Brynielsson, U. Franke
{"title":"Information Requirements for National Level Cyber Situational Awareness","authors":"Stefan Varga, J. Brynielsson, U. Franke","doi":"10.1109/ASONAM.2018.8508410","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508410","url":null,"abstract":"As modern societies become more dependent on IT services, the potential impact both of adversarial cyberattacks and non-adversarial service management mistakes grows. This calls for better cyber situational awareness-decision-makers need to know what is going on. The main focus of this paper is to examine the information elements that need to be collected and included in a common operational picture in order for stakeholders to acquire cyber situational awareness. This problem is addressed through a survey conducted among the participants of a national information assurance exercise conducted in Sweden. Most participants were government officials and employees of commercial companies that operate critical infrastructure. The results give insight into information elements that are perceived as useful, that can be contributed to and required from other organizations, which roles and stakeholders would benefit from certain information, and how the organizations work with creating cyber common operational pictures today. Among findings, it is noteworthy that adversarial behavior is not perceived as interesting, and that the respondents in general focus solely on their own organization.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131167779","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
A Framework for Data-Driven Physical Security and Insider Threat Detection 数据驱动的物理安全和内部威胁检测框架
Vasileios Mavroeidis, Kamer Vishi, A. Jøsang
{"title":"A Framework for Data-Driven Physical Security and Insider Threat Detection","authors":"Vasileios Mavroeidis, Kamer Vishi, A. Jøsang","doi":"10.1109/ASONAM.2018.8508599","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508599","url":null,"abstract":"This paper presents PSO, an ontological framework and a methodology for improving physical security and insider threat detection. PSO can facilitate forensic data analysis and proactively mitigate insider threats by leveraging rule-based anomaly detection. In all too many cases, rule-based anomaly detection can detect employee deviations from organizational security policies. In addition, PSO can be considered a security provenance solution because of its ability to fully reconstruct attack patterns. Provenance graphs can be further analyzed to identify deceptive actions and overcome analytical mistakes that can result in bad decision-making, such as false attribution. Moreover, the information can be used to enrich the available intelligence (about intrusion attempts) that can form use cases to detect and remediate limitations in the system, such as loosely-coupled provenance graphs that in many cases indicate weaknesses in the physical security architecture. Ultimately, validation of the framework through use cases demonstrates and proves that PS0 can improve an organization's security posture in terms of physical security and insider threat detection.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139417","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}
引用次数: 16
Link Prediction Measures in Various Types of Information Networks: A Review 不同类型信息网络中的链路预测方法综述
T. Jaya Lakshmi, S. Durga Bhavani
{"title":"Link Prediction Measures in Various Types of Information Networks: A Review","authors":"T. Jaya Lakshmi, S. Durga Bhavani","doi":"10.1109/ASONAM.2018.8508295","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508295","url":null,"abstract":"An information network is represented as a graph where nodes represent entities and edges represent interactions between nodes. There can be multiple types of nodes and edges in such networks giving rise to homogeneous, multi-relational and heterogeneous networks. Link prediction problem is defined as predicting edges that are more likely to be formed in the network at a future time. Many measures have been proposed in the literature for homogeneous networks. Extensions of many of these measures to heterogeneous networks are not available. Further, the measures need to be redefined in order to utilize the weight and time information available with the interactions. In this work, along with the logical grouping of the measures as topological, probabilistic and linear algebraic measures for all types of networks, we fill the gaps by defining the measures where ever they are not available in the literature. The empirical evaluation of each of these measures in different types of networks on the DBLP benchmark dataset is presented. An overall improvement of 12% is observed in prediction accuracy when temporal and heterogeneous information is efficiently utilized.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114807395","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
Characterizing Infrastructure Damage After Earthquake: A Split-Query Based IR Approach 地震后基础设施破坏特征:一种基于分割查询的红外方法
S. Priya, M. Bhanu, Sourav Kumar Dandapat, Kripabandhu Ghosh, Joydeep Chandra
{"title":"Characterizing Infrastructure Damage After Earthquake: A Split-Query Based IR Approach","authors":"S. Priya, M. Bhanu, Sourav Kumar Dandapat, Kripabandhu Ghosh, Joydeep Chandra","doi":"10.1109/ASONAM.2018.8508752","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508752","url":null,"abstract":"Retrieving relevant information from social media based on specific requirements has become a focus area for researchers. In this paper, we propose a framework for online retrieval of tweets providing information about possible infrastructure damages, caused due to earthquakes and use the same to determine a damage score for the possibly affected locations. Identifying such tweets would not only provide a holistic view of the affected areas but would also help in taking necessary relief actions. Existing works on this topic fail to effectively capture the semantic variation in the tweets, possibly due to poor content quality, thereby providing scopes for further improvement in the mechanisms involved. Our proposed technique relies on a novel split-query based mechanism along with a pseudo-relevance feedback approach to identify the relevant tweets. The pseudo-relevance feedback approach expands on an initial set of seed tweets obtained using a semi-automatic query generation mechanism that couples topic based clustering with human annotation. Empirical validation of our proposed method on a manually annotated ground truth data reveals a considerable improvement in precision, recall and mean average precision over several baseline methods.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828462","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
This Paper is About Lexical Propagation on Twitter. H*ckin Smart. 12/10. Would Accept! 这篇论文是关于Twitter上的词汇传播。H* kin Smart, 12/10。会接受!
J. Golbeck, C. Buntain
{"title":"This Paper is About Lexical Propagation on Twitter. H*ckin Smart. 12/10. Would Accept!","authors":"J. Golbeck, C. Buntain","doi":"10.1109/ASONAM.2018.8508445","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508445","url":null,"abstract":"This paper presents an observational study of lexical propagation across online social networking platforms. By focusing on the highly followed @dog_rates Twitter account, we explore how a popular account's unique style of language propagates outside of the account's immediate follower community within Twitter. Initial results show a strong relationship between the prevalence of this account's language-specific features and the account's followership and popularity. Expanding this research across platforms, we demonstrate consistency in these results outside Twitter, as the @dog_rates vernacular shows a similarly strong relationship between use on Reddit and the account's followership over time.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131841755","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
Development of a Social Network for Research Support and Individual Well-Being Improvement 研究支持与个人福祉改善之社会网路发展
Lucas V. A. Caldas, A. Jacob, S. S. C. Silva, F. Pontes, F. Lobato
{"title":"Development of a Social Network for Research Support and Individual Well-Being Improvement","authors":"Lucas V. A. Caldas, A. Jacob, S. S. C. Silva, F. Pontes, F. Lobato","doi":"10.1109/ASONAM.2018.8508365","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508365","url":null,"abstract":"The ways of communication and social interactions are changing drastically. Web users are becoming increasingly engaged with Online Social Networks (OSN), which has a significant impact on the relationship mechanisms between individuals and communities. Most OSN platforms have strict policies regarding data access, harming its usage in psychological and social phenomena studies; It is also impacting the development of computational methods to evaluate and improve social and individual well-being via the web. Aiming to fill this gap, we propose in this paper a platform that brings together social networks dynamics with forum features, altogether with gamification elements, targeting researchers interested in obtaining access to user's data their investigations.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132860428","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}
引用次数: 1
Shortest Path Distance Approximation Using Deep Learning Techniques 使用深度学习技术的最短路径距离逼近
Fatemeh Salehi Rizi, Jörg Schlötterer, M. Granitzer
{"title":"Shortest Path Distance Approximation Using Deep Learning Techniques","authors":"Fatemeh Salehi Rizi, Jörg Schlötterer, M. Granitzer","doi":"10.1109/ASONAM.2018.8508763","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508763","url":null,"abstract":"Computing shortest path distances between nodes lies at the heart of many graph algorithms and applications. Traditional exact methods such as breadth-first-search (BFS) do not scale up to contemporary, rapidly evolving today's massive networks. Therefore, it is required to find approximation methods to enable scalable graph processing with a significant speedup. In this paper, we utilize vector embeddings learnt by deep learning techniques to approximate the shortest paths distances in large graphs. We show that a feedforward neural network fed with embeddings can approximate distances with relatively low distortion error. The suggested method is evaluated on the Facebook, BlogCatalog, Youtube and Flickr social networks.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133175403","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}
引用次数: 25
Smart and Connected Water Resource Management Via Social Media and Community Engagement 通过社交媒体和社区参与进行智能互联水资源管理
L. Nguyen, R. Hewett, A. Namin, N. Alvarez, Cristina Bradatan, Fang Jin
{"title":"Smart and Connected Water Resource Management Via Social Media and Community Engagement","authors":"L. Nguyen, R. Hewett, A. Namin, N. Alvarez, Cristina Bradatan, Fang Jin","doi":"10.1109/ASONAM.2018.8508602","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508602","url":null,"abstract":"Water is a critical natural resource that has significant impacts on human living and society. Growing population and energy consumption exacerbate the scarcity of water and our ability to manage this resource. This demonstration paper presents WaterScope, a smart and connected platform for water resource management, which integrates multiple data sources such as water level data, social media data, and water related articles. Furthermore, the tool enables forecasting underground water levels, identifying water concerns, sharing knowledge and expertise among stakeholders, and thus bringing new insights to our understanding and insights of the water supplies and resource management. The prototype engages water stakeholders who face problems of similar nature but deal with the problem in an ad-hoc and isolated manner. The interactive WaterScope platform targets creating an interconnected virtual community that aims to improve water supply resilience.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"109 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116114171","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
SiNA: A Scalable Iterative Network Aligner 一个可扩展的迭代网络对齐器
Abdurrahman Yasar, B. Uçar, Ümit V. Çatalyürek
{"title":"SiNA: A Scalable Iterative Network Aligner","authors":"Abdurrahman Yasar, B. Uçar, Ümit V. Çatalyürek","doi":"10.1109/ASONAM.2018.8508468","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508468","url":null,"abstract":"Given two graphs, network alignment asks for a potentially partial mapping between the vertices of the two graphs. This arises in many applications where data from different sources need to be integrated. Recent graph aligners use the global structure of input graphs and additional information given for the edges and vertices. We present SINA, an efficient, shared memory parallel implementation of such an aligner. Our experimental evaluations on a 32-core shared memory machine showed that SINA scales well for aligning large real-world graphs: SINA can achieve up to 28.5x speedup, and can reduce the total execution time of a graph alignment problem with 2M vertices and 100M edges from 4.5 hours to under 10 minutes. To the best of our knowledge, SINA is the first parallel aligner that uses global structure and vertex and edge attributes to handle large graphs.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144526","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}
引用次数: 1
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学术文献互助群
群 号:481959085
Book学术官方微信