Analyzing and Securing
Social Networks
Dr. Bhavani Thuraisingham
The University of Texas at Dallas
Introduction to the Course
January 18, 2013
Objective of the Unit
 This unit provides an overview of the course. The course describes
concepts, developments, challenges, and directions in analyzing
social networks and securing social networks
 Recommended Book for first part of the course:
 Social Networks and the Semantic Web by Peter Mika,
Springer 2007
 Focus for second part of the course
- Selected papers
on Analyzing and Securing Social Networks
from the ACM/IEEE ASONAM Conferences 2009-2012
Outline of the Unit
 Outline of Course
 Course Work
 Course Rules
 Contact
 Appendix
Course Schedule
 January 18, 2013
- Intro to course, Intro to social networks, Intro to cyber security
 January 25, 2013
 Intro to semantic web, Intro to data, info and knowledge
management
 February 1, 2013
 Data analytics, Social network analysis system example
 February 8-March1, 2013
- Chapters from the book by Peter Mika
- Additional Topics: XML Security, Hadoop/MapReduce /Cloud;
Location mining in social networks, Security and Privacy for
social networks
 March 1, 2013 – Lectures, review for exam #1
 March 8, 2013: Exam #1
Course Schedule
 March 15, 2013: Spring Break
 March 22, 2013 –Insider Threat Analysis (modeling insider
communication as graphs); Helpful suggestions for Programming
Project (StormRider, JenaHbase, SPARQL query processing in the
cloud)
 March 29 – April 12, 2013
 Lectures, Selected papers to read and present in class
(ASONAM 2009, 2010, 2011)
 April 19, 2013 – Guest Lectures
 April 26, 2013 – Selected papers, to read and present in class
(ASONAM 2012)
 May 3, 2013: Lectures, Review for exam #2
 May 10, 2013: Exam #2
Tentative Schedule









Assignment #1 due date: February 15, 2013
Assignment #2: due date: March 1, 2013 (new date: March 22, 2013)
Term Paper #1: February 22, 2013
Exam #1: March 8, 2013
Assignment #3: March 29, 2013 (new date: April 5, 2013)
Term paper #2: April 12, 2013 (new date: April 19, 2013)
Assignment #4: April 19, 2013 ( new date: April 26, 2013)
Programming Project: May 3, 2013
Exam #2: May 10, 2013
Course Work
 Two term papers; each worth 8 points
 Two exams each worth 24 points
 Programming project worth 12 points
 Four homework assignments each worth 6 points
 Total 100 points
Course Rules
 Course attendance is mandatory; unless permission is obtained
from instructor for missing a class with a valid reason
(documentation needed for medical emergency for student or a
close family member – e.g., spouse, parent, child). Attendance will
be collected every lecture. 3 points will be deducted out of 100 for
each lecture missed without approval.
 Each student will work individually
 Late assignments will not be accepted. All assignments have to be
turned in just after the lecture on the due date
 No make up exams unless student can produce a medical certificate
or give evidence of close family emergency
 Copying material from other sources will not be permitted unless the
source is properly referenced
 Any student who plagiarizes from other sources will be reported to
the appropriate UTD authroities
Contact
 For more information please contact
- Dr. Bhavani Thuraisingham
- Professor of Computer Science and
- Director of Cyber Security Research Center Erik Jonsson School
of Engineering and Computer Science EC31, The University of
Texas at Dallas Richardson, TX 75080
- Phone: 972-883-4738
- Fax: 972-883-2399
- Email: bhavani.thuraisingham@utdallas.edu
- URL:http://www.utdallas.edu/~bxt043000/
Assignment #1: Given 2/8/2013; Due: 2/15/2013
 Describe how Semantic Web Technologies may be used to
represent and reason about Social Networks.
 Describe with examples how Data Mining techniques may be
used to analyze social networks.
Assignment #2: Given 3/1/2013; Due: 3/22/2013
Prepare answers to help you in Exam #1
 Describe with an example application for enforcing access
control policies in online social networks
 Describe an approach that would determine whether the data
in a social network violates the privacy of an individual
 Describe how web services may be used to design an on-
line social network and show how XACML standard may be
used for access control.
Assignment #3: Given 3/29/2013; Due: 4/5/2013
 Describe with examples how large graphs could be used to
model communication between individuals and analyzed so
that insider threats can be detected
 Select a privacy preserving data mining techniques (e.g.,
randomization, perturbation) and explain how it can be
applied to social networks
Assignment #4: Given 4/12/2013; Due: 4/26//2013
 1. Write a critique of the paper
Preventing Private Information Inference Attacks on Social
Networks
This paper appears in:
Knowledge and Data Engineering, IEEE Transactions on
Author(s): Heatherly, R.
Vanderbilt University, Nashville
Kantarcioglu, M.; Thuraisingham, B.
Paper is on the IEEE Explorer web site
 2. Give your views on our (Dr. Bhavani’s team) Sentiment
Analysis web site
http://dml.utdallas.edu/SentimentMining/
Papers to Read for Exam #1
 Satyen Abrol, Latifur Khan: Tweethood: Agglomerative
Clustering on Fuzzy k-Closest Friends with Variable Depth for
Location Mining. SocialCom/PASSAT 2010: 153-160
 Elisa Bertino, Barbara Carminati, Elena Ferrari, Bhavani M.
Thuraisingham, Amar Gupta: Selective and Authentic ThirdParty Distribution of XML Documents. IEEE Trans. Knowl.
Data Eng. 16(10): 1263-1278 (2004) (upto section 6)
 Barbara Carminati, Elena Ferrari, Raymond Heatherly, Murat
Kantarcioglu, Bhavani M. Thuraisingham: A semantic web
based framework for social network access control. SACMAT
2009: 177-186
Useful optional papers to read on Security and
Access Control that would help
 Some useful papers on policy and access control (especially
the paper on RBAC)
- RBAC: Ravi S. Sandhu, Edward J. Coyne, Hal L. Feinstein,
Charles E. Youman: Role-Based Access Control Models. IEEE
Computer 29(2): 38-47 (1996)
- UCON: Jaehong Park, Ravi S. Sandhu: The UCONABC usage
control model. ACM Trans. Inf. Syst. Secur. 7(1): 128-174 (2004)
- Read the first 20 pages (sections 1, 2, 3)
- DCON: Roshan K. Thomas, Ravi S. Sandhu: Towards a Multidimensional Characterization of Dissemination Control. POLICY
2004: 197-200 (IEEE)
 Privacy: Rakesh Agrawal, Ramakrishnan Srikant: Privacy-
Preserving Data Mining. SIGMOD Conference 2000: 439-450
 Information on the web on XACML and Attribute-based
access control
Index to Lectures for Exam #1
 Lecture 1 – Introduction to Social networks
 Lecture 2 – Cyber Security Modules
 Lecture 3 – Data and Applications Security
 Lecture 4 – Data, Information and Knowledge Management
 Lecture 5 – Semantic Web
 Lecture 6 – Data Mining
 Lecture 7 – Location based Social Networks
 Lecture 8 – Semantic Web and Social Networks (Chapter 1 and 2)
 Lecture 9 – Secure Third Party Publication of XML Data
 Lecture 10 – Representing and Analyzing Social Networks (Chapter
3, 4, 5, 6)
 Lecture 11 – Hadoop/MapReduce Framework for possible
programming project
Index to Lectures for Exam #1
 Lecture 12 – Experimental Cloud Systems
 Lecture 13 – Case Studies for Semantic Social Network (Chapters 7,
8, 9, 10)
 Lecture 14 – Privacy
 Lecture 15 – Social Networks, Security and Privacy
Papers to Read for March 29, 2013
IEEE/ACM Joint
Conference
Advances in Social
Network Analysis
and Mining, 2009
(ASONAM)
Papers to Read for March 29, 2013
 Shin-Yan Chiou, Shih-Ying Chang, Ghita Mezzour, Adrian
Perrig, Hung-Min Sun:
A Trustable Reputation Scheme Based on Private
Relationships. 19-24
 David Kinzel, Micah Klettke, Paul Uppal, Naheed Visram,
Keivan Kianmehr, Reda Alhajj, Jon G. Rokne:
The Economic Benefits of Web Mining. 25-32
 Jiyang Chen, Osmar R. Zaïane, Randy Goebel:
Local Community Identification in Social Networks. 237-242
 Frank Nagle, Lisa Singh:
Can Friends Be Trusted? Exploring Privacy in Online Social
Networks. 312-315
Papers to Read for March 29, 2013
 Nico Schlitter, Tanja Falkowski:
Mining the Dynamics of Music Preferences from a Social
Networking Site. 243-248
 Joseph Bonneau, Jonathan Anderson, George Danezis:
Prying Data out of a Social Network. 249-254
 Petros Xanthopoulos, Ashwin Arulselvan, Vladimir Boginski,
Panos M. Pardalos:
A Retrospective Review of Social Networks. 300-305
 Sampson Pun, Amir H. Chinaei, Ken Barker:
Twins (1): Extending SQL to Support Corporation Privacy
Policies in Social Networks. 306-311
Papers to Read for April 5, 2013
IEEE/ACM Joint
Conference
Advances in Social
Network Analysis
and Mining, 2010
(ASONAM)
Papers to Read for April 5, 2013
 Lyta Penna, Andrew Clark, George M. Mohay:
A Framework for Improved Adolescent and Child Safety in
MMOs. 33-40
 B. K. Tripathy, G. K. Panda:
A New Approach to Manage Security against Neighborhood
Attacks in Social Networks. 264-269
 Pål Roe Sundsøy, Johannes Bjelland, Geoffrey Canright,
Kenth Engø-Monsen, Rich Ling:
Product Adoption Networks and Their Growth in a Large
Mobile Phone Network. 208-216
Papers to Read for April 5, 2013
 M. Saravanan, Garigipati Prasad, Karishma Surana, D.
Suganthi:
Labeling Communities Using Structural Properties. 217-224
 Uffe Kock Wiil, Jolanta Gniadek, Nasrullah Memon:
Measuring Link Importance in Terrorist Networks. 225-232
 Thomas Couronné, Alina Stoica, Jean-Samuel Beuscart:
Online Social Network Popularity Evolution: An Additive
Mixture Model. 346-350
 M. Omair Shafiq, Reda Alhajj, Jon G. Rokne:
Community Aware Personalized Web Search. 351-355
Papers to Read for April 12, 2013
IEEE/ACM Joint
Conference
Advances in Social
Network Analysis
and Mining, 2011
(ASONAM)
Papers to Read for April 12, 2013
 Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Social Network Anonymization via Edge Addition. 155-162
 Guido Barbian:
Assessing Trust by Disclosure in Online Social Networks. 163-170
 Mohammad A. Tayebi, Laurens Bakker, Uwe Glässer, Vahid
Dabbaghian:
Locating Central Actors in Co-offending Networks. 171-179
 Hsin-Chang Yang, Chung-Hong Lee:
Post-Level Spam Detection for Social Bookmarking Web Sites. 180185
 Sean Chester, Gautam Srivastava:
Social Network Privacy for Attribute Disclosure Attacks. 445-449
Papers to Read for April 12, 2013
 Kyung Soo Cho, Jae Yoel Yoon, Iee Joon Kim, Ji Yeon Lim, Seung
Kwan Kim, Ung-Mo Kim:
Mining Information of Anonymous User on a Social Network Service.
450-453
 Jenq-Haur Wang, Ming-Sheng Lin:
Using Inter-comment Similarity for Comment Spam Detection in
Chinese Blogs. 189-194
 Ruaylong Lee, Roozbeh Nia, Jason Hsu, Karl N. Levitt, Jeff Rowe,
Shyhtsun Felix Wu, Shaozhi Ye:
Design and Implementation of FAITH, An Experimental System to
Intercept and Manipulate Online Social Informatics. 195-202
 Koji Maruhashi, Fan Guo, Christos Faloutsos:
MultiAspectForensics: Pattern Mining on Large-Scale
Heterogeneous Networks with Tensor Analysis. 203-210
Papers to Read for April 26, 2013
IEEE/ACM Joint
Conference
Advances in Social
Network Analysis
and Mining, 2012
(ASONAM)
Papers to Read for April 26, 2013
 Anna Leontjeva, Konstantin Tretyakov, Jaak Vilo, Taavi Tamkivi:
Fraud Detection: Methods of Analysis for Hypergraph Data. 10601064
 Anshu Malhotra, Luam C. Totti, Wagner Meira Jr., Ponnurangam
Kumaraguru, Virgilio Almeida:
Studying User Footprints in Different Online Social Networks. 10651070
 Mauro Conti, Radha Poovendran, Marco Secchiero:
FakeBook: Detecting Fake Profiles in On-Line Social Networks. 10711078
 Ali Nazemian, Hoda Gholami, Fattaneh Taghiyareh:
An Improved Model of Trust-aware Recommender Systems Using
Distrust Metric. 1079-1084
Papers to Read for April 26, 2013
 Yue Wang, Xintao Wu, Jun Zhu, Yang Xiang:
On Learning Cluster Coefficient of Private Networks. 395-402
 Evangelos E. Papalexakis, Alex Beutel, Peter Steenkiste:
Network Anomaly Detection Using Co-clustering. 403-410
 Christine Task, Chris Clifton:
A Guide to Differential Privacy Theory in Social Network Analysis. 411-417
 Sean Chester, Jared Gaertner, Ulrike Stege, S. Venkatesh:
Anonymizing Subsets of Social Networks with Degree Constrained
Subgraphs. 418-422
 Maria Eleni Skarkala, Manolis Maragoudakis, Stefanos Gritzalis, Lilian Mitrou,
Hannu Toivonen, Pirjo Moen:
Privacy Preservation by k-Anonymization of Weighted Social Networks. 423428
 Özgür Kafali, Akin Günay, Pinar Yolum:
PROTOSS: A Run Time Tool for Detecting Privacy Violations in Online Social
Networks. 429-433
Index to Lectures for Exam #2
 Lecture 16: Insider Threat Detection (Guidance to assignment)
 Lecture 17: SPARQL Query Processing in the Cloud (Guidance to
assignment
 Lecture 18: Jena-Hbase (Guidance to assignment)
 Lecture 19: StormRider (Guidance to assignment)
 Lecture 20: ASONAM 2009 (March 29)
 Lecture 21: Dr. Abrol ‘s presentation on sentiment analysis
 Lecture 22: ASONAM 2010 (April 5)
 Lecture 23: ASONAM 2011 (April 12)
 Lecture 24: Guest Lectures, Mahut
 Lecture 25: ASONAM 2012 (April 26)
 Lecture 26: Dr. Mohan lecture, Revie
Papers to Read for Exam #2
 Shin-Yan Chiou, Shih-Ying Chang, Ghita Mezzour, Adrian Perrig,
Hung-Min Sun:
A Trustable Reputation Scheme Based on Private Relationships. 1924
 David Kinzel, Micah Klettke, Paul Uppal, Naheed Visram, Keivan
Kianmehr, Reda Alhajj, Jon G. Rokne:
The Economic Benefits of Web Mining. 25-32
 Jiyang Chen, Osmar R. Zaïane, Randy Goebel:
Local Community Identification in Social Networks. 237-242
 Nico Schlitter, Tanja Falkowski:
Mining the Dynamics of Music Preferences from a Social Networking
Site. 243-248
 Joseph Bonneau, Jonathan Anderson, George Danezis:
Prying Data out of a Social Network. 249-254
Papers to Read for Exam #2
 Lyta Penna, Andrew Clark, George M. Mohay:
A Framework for Improved Adolescent and Child Safety in MMOs.
33-40
 B. K. Tripathy, G. K. Panda:
A New Approach to Manage Security against Neighborhood Attacks
in Social Networks. 264-269
 Pål Roe Sundsøy, Johannes Bjelland, Geoffrey Canright, Kenth
Engø-Monsen, Rich Ling:
Product Adoption Networks and Their Growth in a Large Mobile
Phone Network. 208-216
 Thomas Couronné, Alina Stoica, Jean-Samuel Beuscart:
Online Social Network Popularity Evolution: An Additive Mixture
Model. 346-350
 M. Omair Shafiq, Reda Alhajj, Jon G. Rokne:
Community Aware Personalized Web Search. 351-355
Papers to Read for Exam #2
 Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Social Network Anonymization via Edge Addition. 155-162
 Guido Barbian:
Assessing Trust by Disclosure in Online Social Networks. 163-170
 Mohammad A. Tayebi, Laurens Bakker, Uwe Glässer, Vahid
Dabbaghian:
Locating Central Actors in Co-offending Networks. 171-179
 Sean Chester, Gautam Srivastava:
Social Network Privacy for Attribute Disclosure Attacks. 445-449
 Kyung Soo Cho, Jae Yoel Yoon, Iee Joon Kim, Ji Yeon Lim, Seung
Kwan Kim, Ung-Mo Kim:
Mining Information of Anonymous User on a Social Network Service.
450-453
Papers to Read for Exam #2
 Anna Leontjeva, Konstantin Tretyakov, Jaak Vilo, Taavi Tamkivi:
Fraud Detection: Methods of Analysis for Hypergraph Data. 10601064
 Mauro Conti, Radha Poovendran, Marco Secchiero:
FakeBook: Detecting Fake Profiles in On-Line Social Networks. 10711078
 Evangelos E. Papalexakis, Alex Beutel, Peter Steenkiste:
Network Anomaly Detection Using Co-clustering. 403-410
 Maria Eleni Skarkala, Manolis Maragoudakis, Stefanos Gritzalis,
Lilian Mitrou, Hannu Toivonen, Pirjo Moen:
Privacy Preservation by k-Anonymization of Weighted Social
Networks. 423-428
 Özgür Kafali, Akin Günay, Pinar Yolum:
PROTOSS: A Run Time Tool for Detecting Privacy Violations in
Online Social Networks. 429-433
