Shih-Hung Wu, Yi-Hsiang Hsieh, Liang-Pu Chen, Ping-Che Yang, Liu Fanghuizhu
{"title":"Temporal Model of the Online Customer Review Helpfulness Prediction","authors":"Shih-Hung Wu, Yi-Hsiang Hsieh, Liang-Pu Chen, Ping-Che Yang, Liu Fanghuizhu","doi":"10.1145/3110025.3110156","DOIUrl":"https://doi.org/10.1145/3110025.3110156","url":null,"abstract":"Customer reviews provide opinions and relevant information that will affect the purchase behavior of other customers. Many studies focused on the prediction of the helpfulness of customer reviews to find the helpful reviews, which are traditionally determined by the helpful voting results. In our study, we find that the voting result of an online review is not a constant over time. Therefore, predicting the voting result based on the analysis of text is not enough; the temporal issue must be considered. We propose a system that can rank the reviews based on a set of linguistic features with a linear regression model. To evaluate our system, we collect Chinese custom reviews in eight product categories (books, digital cameras, tablet PC, backpacks, movies, men shoes, toys and cell phones) from Amazon.cn with the voting result on the helpfulness of the reviews. Since the voting result may be affected by voting time and total voting number, we define a new evaluation index and compare the regression results. The results show that the system has less prediction error when it takes the time information into the prediction model.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"60 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114116671","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}
S. Mridha, Sayan Ghosh, R. Singh, Sourangshu Bhattacharya, Niloy Ganguly
{"title":"Mining Twitter and Taxi Data for Predicting Taxi Pickup Hotspots","authors":"S. Mridha, Sayan Ghosh, R. Singh, Sourangshu Bhattacharya, Niloy Ganguly","doi":"10.1145/3110025.3110106","DOIUrl":"https://doi.org/10.1145/3110025.3110106","url":null,"abstract":"In recent times, people regularly discuss about poor travel experience due to various road closure incidents in the social networking sites. One of the fallouts of these road blocking incidents is the dynamic shift in regular taxi pickup locations. Although traffic monitoring from social media content has lately gained widespread interest, however, none of the recent works has tried to understand this relocation of taxi pickup hotspots during any road closure activity. In this work, we have tried to predict the taxi pickup hotspots, during various road closure incidents, using their past taxi pickup trend. We have proposed a two-step methodology. First, we identify and extract road closure information from social network posts. Second, leveraging the inferred knowledge, prediction of taxi pickup hotspot is done near the activity location with an average accuracy of ~ 86.04%, where the predicted locations are within an average radius of only 0.011 mile from the original hotspots.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"112 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":"117259437","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}
S. Rizzo, Flavio Bertini, D. Montesi, Carlo Stomeo
{"title":"Text Watermarking in Social Media","authors":"S. Rizzo, Flavio Bertini, D. Montesi, Carlo Stomeo","doi":"10.1145/3110025.3116203","DOIUrl":"https://doi.org/10.1145/3110025.3116203","url":null,"abstract":"One of the most shared content in Social Media (SM) is text, making it vulnerable to copy and authorship misappropriation. Due to the low data noise, watermark embedding is very hard. This problem is exacerbated in the context of SM, where the amount of data in a single message can be extremely small, like in Twitter. Firstly, in this paper we investigate whether SM do applies watermarks on the texts. Then, we propose a text watermarking method able to work on all the SM platforms considered, while ensuring visual indistinguishability and length preservation of the original text and robustness to copy and paste. We conduct an extended evaluation on eighteen different SM platforms by using 6,000 posts from six public figures' profiles.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"33 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":"130169940","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}
{"title":"Improved Stance Prediction in a User Similarity Feature Space","authors":"Kareem Darwish, Walid Magdy, Tahar Zanouda","doi":"10.1145/3110025.3110112","DOIUrl":"https://doi.org/10.1145/3110025.3110112","url":null,"abstract":"Predicting the stance of social media users on a topic can be challenging, particularly for users who never express explicit stances. Earlier work has shown that using users' historical or non-relevant tweets can be used to predict stance. We build on prior work by making use of users' interaction elements, such as retweeted accounts and mentioned hashtags, to compute the similarities between users and to classify new users in a user similarity feature space. We show that this approach significantly improves stance prediction on two datasets that differ in terms of language, topic, and cultural background.","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":"131931368","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}
{"title":"Representation and Analysis of Twitter Activity: A Dynamic Network Perspective","authors":"L. Falzon, Caitlin McCurrie, John Dunn","doi":"10.1145/3110025.3122118","DOIUrl":"https://doi.org/10.1145/3110025.3122118","url":null,"abstract":"Online interaction networks are highly dynamic. They provide opportunities to share information more widely and faster than ever before, but result in rather complicated trajectories of information flow that present new challenges for modeling and analysis. Collecting the right data, processing it appropriately and determining which networks to analyze are some of the challenges we face. The ease with which data can be sourced through Twitter's API has resulted in a disproportionate number of studies analyzing 'big data'. This focus has led researchers to overlook the importance of 'small data': traditional methods of data collection, such as survey and experimental studies. Clever data extraction and processing capabilities are absolutely necessary to deal with the enormous quantity of data generated by Internet-mediated interactions. However, the richness at the level of the individual may be overlooked if big data approaches are exclusively used, potentially resulting in inappropriate generalizations and conclusions. In this paper we study results from a qualitative study on Twitter users' behavior and combine them with dynamic network analysis to investigate the manifestations of Twitter relations.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"42 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":"123762886","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}
{"title":"Deep Paraphrase Detection in Indian Languages","authors":"Rupal Bhargava, Gargi Sharma, Yashvardhan Sharma","doi":"10.1145/3110025.3122119","DOIUrl":"https://doi.org/10.1145/3110025.3122119","url":null,"abstract":"This paper presents an approach to the problem of paraphrase identification in English and Indian languages using Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN). Traditional machine learning approaches used features that involved using resources such as POS taggers, dependency parsers, etc. for English. The lack of similar resources for Indian languages has been a deterrent to the advancement of paraphrase detection task in Indian languages. Deep learning helps in overcoming the shortcomings of traditional machine Learning techniques. In this paper, three approaches have been proposed, a simple CNN that uses word embeddings as input, a CNN that uses WordNet scores as input and RNN based approach with both LSTM and bi-directional LSTM.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"27 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":"127796047","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}
{"title":"Mapping Whole DNA Sequence on Variant Maps","authors":"Yuyuan Mao, Jeffrey Zheng, Wenjia Liu","doi":"10.1145/3110025.3110140","DOIUrl":"https://doi.org/10.1145/3110025.3110140","url":null,"abstract":"Whole DNA sequence is naturally related to big data streams, it is a challenge task to make a classification and visualization for whole DNA sequences. In this paper, a new mapping method for whole DNA sequence is proposed, and a special mapping scheme is used to transfer a whole DNA sequence as multiple 2D statistical probability maps. A sample case is selected from a night monkey species from south America (Aotus Nancymaae), interesting patterns are observed from relevant maps.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"57 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":"130681078","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}
Lei Qi, Rihui Li, J. Wong, Wallapak Tavanapong, David A. M. Peterson
{"title":"Social Media in State Politics: Mining Policy Agendas Topics","authors":"Lei Qi, Rihui Li, J. Wong, Wallapak Tavanapong, David A. M. Peterson","doi":"10.1145/3110025.3110097","DOIUrl":"https://doi.org/10.1145/3110025.3110097","url":null,"abstract":"Twitter is a popular online microblogging service that has become widely used by politicians to communicate with their constituents. Gaining understanding of the influence of Twitter in state politics in the United States cannot be achieved without proper computational tools. We present the first attempt to automatically classify tweets of state legislatures (policy makers at the state level) into major policy agenda topics defined by Policy Agendas Project (PAP), which was initiated to group national policies. We investigated the effectiveness of three popular machine learning algorithms, Support Vector Machine (SVM), Convolutional Neural Networks (CNN), and Long Short-Term Memory Network (LSTM). We proposed a new synthetic data augmentation method to further improve classification performance. Our experimental results show that CNN provides the best F1 score of 78.3%. The new data augmentation method improves the classification perfromance by about 2%. Our tool provides a good prediction of the top three popular PAP topics in each month, which is useful for tracking popular PAP topics over time and across states and for comparing with national policy agendas.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"36 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":"133894956","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}
Felicia Natali, Kathleen M. Carley, Feida Zhu, Binxuan Huang
{"title":"The Role of Different Tie Strength in Disseminating Different Topics on a Microblog","authors":"Felicia Natali, Kathleen M. Carley, Feida Zhu, Binxuan Huang","doi":"10.1145/3110025.3110130","DOIUrl":"https://doi.org/10.1145/3110025.3110130","url":null,"abstract":"The study of information flow typically does not distinguish the choices of tie strength on which the information flows. All receivers of the information are assumed to have the same potential to pass on the information. Modifying the SEIZ (susceptible, exposed, infected, skeptic) model, we discover that people choose to retweet strong or weak ties based on the topic. We made two modifications in the model. In the first modification (Model I), we assume that the contact rates of agents in different compartment and the probability of an agent transitioning from one compartment to another are different for strong ties and weak ties. In the second modification (Model II), we assume that only the probability of transitioning is different for strong ties and weak ties. We discover that people do not discriminate strong ties and weak ties when retweeting controversial topic, perhaps because this topic can both be personal and breaking news. On the other hand, people discriminate strong ties and weak ties when retweeting non-controversial topic. They prefer to retweet strong ties when the topic is donation, and kids, and weak ties when the topic is news on hurricane and music. Meanwhile, SEIZ model and its modifications are found to be inadequate to model tweets on event promotion.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"19 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":"127631078","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}
Vahid Behzadan, Amin Nourmohammadi, M. H. Gunes, M. Yuksel
{"title":"On Fighting Fire with Fire: Strategic Destabilization of Terrorist Networks","authors":"Vahid Behzadan, Amin Nourmohammadi, M. H. Gunes, M. Yuksel","doi":"10.1145/3110025.3119404","DOIUrl":"https://doi.org/10.1145/3110025.3119404","url":null,"abstract":"Terrorist organizations have social networks that enable them to recruit and operate around the world. This paper presents a novel computational framework for derivation of optimal destabilization strategies against dynamic social networks of terrorists. We develop a game-theoretic model to capture the distributed and complex dynamics of terrorist organizations, and introduce a technique for estimation of such dynamics from incomplete snapshots of target networks. Furthermore, we propose a mechanism for devising the optimal sequence of actions that drive the internal dynamics of targeted organizations towards an arbitrary state of instability. The performance of this framework is evaluated on a model of the Al-Qaeda network in 2001, verifying the efficacy of our proposals for counter-terrorism applications.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"16 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":"114341226","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}