{"title":"Dynamic user-level affect analysis in social media: Modeling violence in the Dark Web","authors":"Shuo Zeng, Mingfeng Lin, Hsinchun Chen","doi":"10.1109/ISI.2011.5984041","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984041","url":null,"abstract":"Affect represents a person's emotions toward objects, issues or other persons. Recent years have witnessed a surge in studies of users' affect in social media, as marketing literature has shown that users' affect influences decision making. The current literature in this area, however, has largely focused on the message level, using text-based features and various classification approaches. Such analyses not only overlook valuable information about the user who posts the messages, but also fail to consider that users' affect may change over time. To overcome these limitations, we propose a new research design for social media affect analysis by specifically incorporating users' characteristics and the time dimension. We illustrate our research design by applying it to a major Dark Web forum of international Jihadists. Empirical results show that our research design allows us to draw on theories from other disciplines, such as social psychology, to provide useful insights on the dynamic change of users' affect in social media.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129282404","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}
Fatih Özgül, Claus Atzenbeck, Ahmet Çelik, Z. Erdem
{"title":"Incorporating data sources and methodologies for crime data mining","authors":"Fatih Özgül, Claus Atzenbeck, Ahmet Çelik, Z. Erdem","doi":"10.1109/ISI.2011.5983995","DOIUrl":"https://doi.org/10.1109/ISI.2011.5983995","url":null,"abstract":"This paper investigates sources of crime data mining, methodologies for knowledge discovery, by pointing out which forms knowledge discovery is suitable for which methodology. Furthermore, it identifies which data sources should be used for which knowledge discovery form in crime data mining. Similarities and differences between crime data mining methodologies show that some forms of knowledge discovery are suitable for particular crime data mining methodologies. It is offered that selecting the appropriate methodology depends on whether general or specific tasks required or high volume of crime data to be prepared.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117312979","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":"Clustering algorithm-based control charts","authors":"J. Kang, S. Kim","doi":"10.1109/ISI.2011.5984096","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984096","url":null,"abstract":"Hotelling's T2 control chart is widely used as a representative method to efficiently monitor multivariate processes. However, they have some parametric restrictions that may not be applicable for modern manufacturing systems complicated. In the present study we propose a clustering algorithm-based control chart that overcomes the limitation posed by the parametric assumption in existing control chart methods. The simulation results showed that the proposed clustering algorithm-based control charts outperformed Hotelling's T2 control charts especially when process data follow the nonnormal distributions.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115779463","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":"Enhancing unlinkability in Vehicular Ad Hoc Networks","authors":"H. Weerasinghe, Huirong Fu, S. Leng, Ye Zhu","doi":"10.1109/ISI.2011.5983992","DOIUrl":"https://doi.org/10.1109/ISI.2011.5983992","url":null,"abstract":"Communication messages in Vehicular Ad-hoc Networks (VANETs) can be used to track movement of vehicles. In this paper, we address the problem of movement tracking and enhance location privacy without affecting security and safety of vehicles. By considering unique characteristics of VANETs, we firstly propose a synchronized pseudonym changing protocol based on the concept of forming groups among neighboring vehicles. Secondly, we analytically evaluate the anonymity and unlinkability of the proposed protocol. Finally, we do a series of simulations to evaluate the performance of our protocol in real VANET environments such as Manhattan and Urban. Simulation results show that our protocol is feasible and produces excellent performances. The main advantages of our protocol compared with the existing approaches include: 1) it makes larger anonymity set and higher entropy; 2) it reduces the tracking probability; 3) it can be used in both safety and non-safety communications; and 4) Vehicles need not suspend regular communication for changing pseudonyms.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114287598","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}
Duo-Yong Sun, Shu-Quan Guo, Ben-xian Li, Xiao-Peng Liu
{"title":"Study on covert networks of terrorists based on interactive relationship hypothesis","authors":"Duo-Yong Sun, Shu-Quan Guo, Ben-xian Li, Xiao-Peng Liu","doi":"10.1109/ISI.2011.5984045","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984045","url":null,"abstract":"Rapid development of social network theory provides new perspective for the study of behavior of terrorist organizations. Due to the covertness of terrorist activities, the absence of individuals and relationships often occurs in the construction of interpersonal relationship network of terrorists using social network theory, thus affecting the effectiveness of analysis. This paper proposes a method for constructing covert terrorist networks based on interactive relationship records and combining hypothesis and inference, and carries out empirical study combining typical terrorist activities within the borders. Study results show that key figures and missing figures obtained according to analysis and evaluation of constructed networks are consistent with reality. This shows that the combination of hypothesis and inference and interpersonal relationship records is a feasible way to improve the construction of terrorist social network model.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115628779","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":"Supervised term weighting for sentiment analysis","authors":"Tam T. Nguyen, Kuiyu Chang, S. Hui","doi":"10.1109/ISI.2011.5984056","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984056","url":null,"abstract":"Vector space text classification is commonly used in intelligence applications such as email and conversation analysis. In this paper we propose a supervised term weighting scheme called tƒ × KL (term frequency Kullback-Leibler), which weights each word proportionally to the ratio of its document frequency across the positive and negative class. We then generalize tƒ × KL to effectively deal with class imbalance, which is very common in real world intelligence analysis. The generalized tƒ × KL weights each word according to the ratio of the positive and negative class conditioned word probabilities instead of the raw document frequencies. Results on four classification datasets show tƒ × KL to perform consistently better than the baseline tƒ ×idƒ and 4 other supervised term weighting schemes, including the recently proposed tƒ × rƒ (term frequency relevance frequency). The generalized tƒ × KL was found to be extremely robust in dealing with highly skewed class distributions, beating the second runner-up by more than 20% on a dataset that has only 10% positive training examples. The generalized tƒ × KL is thus an effective and robust term weighting scheme that can significantly improve binary classification performance in sentiment analysis and intelligence applications.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"61 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126768928","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":"Privacy preserving two-party k-means clustering over vertically partitioned dataset","authors":"Zhenmin Lin, J. Jaromczyk","doi":"10.1109/ISI.2011.5983998","DOIUrl":"https://doi.org/10.1109/ISI.2011.5983998","url":null,"abstract":"We propose a secure approximate comparison protocol and develop a practical privacy-preserving two-party k-means clustering algorithm over vertically partitioned dataset. Experiments with to real datasets show that the accuracy of clustering achieved with our privacy preserving protocol is similar to the standard (non-secure) kmeans function in MATLAB.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372343","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}
Edith Felix, Olivier Delande, F. Massacci, F. Paci
{"title":"Managing changes with legacy security engineering processes","authors":"Edith Felix, Olivier Delande, F. Massacci, F. Paci","doi":"10.1109/ISI.2011.5984064","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984064","url":null,"abstract":"Managing changes in Security Engineering is a difficult task: the analyst must keep the consistency between security knowledge such as assets, attacks and treatments to stakeholders' goals and security requirements. Research-wise the usual solution is an integrated methodology in which risk, security requirements and architectural solutions are addressed within the same tooling environment and changes can be easily propagated.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125036246","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":"A geographic analysis of P2P-TV viewership","authors":"Zhihong Jiang, Hui Wang, Yubao Zhang, Pei Li","doi":"10.1109/ISI.2011.5984120","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984120","url":null,"abstract":"A promising P2P application, P2P-TV, has attracted hundreds of thousands of Chinese viewers. These viewers who are located in different regions represent groups with distinct cultures. However, little existing research has provided sufficient insights into the societal impact of P2P-TV systems, from the viewpoint of geographic distribution of viewers. In this paper, we analyze geographic distribution of viewers of three most popular P2P-TV systems simultaneously, PPLive, PPStream and UUSee. With more than 20 GB worth of log data from three different P2P-TV systems, we have completed a thorough investigation of geographic distribution of viewers. We also seek to explore the potential correlation between viewer population density and economic development level and find that there is indeed a highly negative correlation between them.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126453850","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":"The analysis of military intelligence early warning based on open source intelligence","authors":"Jiwei Song","doi":"10.1109/ISI.2011.5984775","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984775","url":null,"abstract":"This paper deals with military intelligence early warning mechanism based on open sources with the following four modules: collection module, processing module, analysis module and preventive action development module. It could be used by operation commanders and intelligence personnel to guide the collection, tracking, monitoring and analyzing of crisis signals. Thus it helps them to develop preventive actions.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"22 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125782432","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}