<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Social Interaction Based Audience Segregation for Online Social Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Javed Ahmed</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guido Governatori</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leendart van der Torre</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serena Villata</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CIRSFID, University of Bologna</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>INRIA Sophia Antipolis</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>NICTA QRL Brisbane</institution>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Luxembourg</institution>
          ,
          <country country="LU">Luxembourg</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Online social networking is the latest craze that has captured the attention of masses, people use these sites to communicate with their friends and family. These sites o er attractive means of social interactions and communications, but also raise privacy concerns. This paper examines user's abilities to control access to their personal information posted in online social networks. Online social networks lack common mechanism used by individuals in their real life to manage their privacy. The lack of such mechanism signi cantly a ects the level of user control over their self presentation in online social networks. In this paper, we present social interaction based audience segregation model for online social networks. This model mimics real life interaction patterns and makes online social networks more privacy friendly. Our model uses type, frequency, and initiation factor of social interactions to calculate friendship strength. The main contribution of the model is that it considers set of all possible interactions among friends and assigns a numerical weight to each type of interaction in order to increase or decrease its contribution in calculation of friendship strength based on its importance in the development of relationship ties.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Online social networks (OSNs) have experienced exponential growth in recent
years. OSNs are the top most visited sites on the Internet.5 According to Nielsen,6
OSNs are the fourth most popular activity on the Internet nowadays. The key
breakthrough brought by OSNs is that these sites promote the vision of a
humancentric web, where network of people and their interests become the primary
source of information, which resides entirely on social networking services [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Online social networks are one of the most popular fora for self representation
and user interactions. Individuals join social networks to present themselves. In
OSNs users can present themselves by constructing a pro le. A pro le is a digital
5 Alexa http:/www.alexa.com/topsites
6 Nielsen http://www.nielsen.com/
representation of an OSN user. A Pro le contains huge amount of personal
information about the user. Additionally, these users are engaged in various social
interactions with other users. All these activities are recorded on these platforms
which can be easily analyzed, manipulated, systematized, formalized, classi ed,
and aggregated [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This poses a serious privacy threat to OSN users, and that
is the main reason privacy is hotly debated topic in research literature [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. There are several dimensions of privacy threats in online social
networks such as privacy threats related to OSNs users[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], third party applications
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and OSN service providers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In this paper, we are addressing the issue of
privacy threats related to OSN users.
      </p>
      <p>
        Tremendous growth of online social networks resulted in fundamental shift
in status of end users. Individual end users become content managers instead
of just being content consumers. Today, for every single piece of data shared on
OSNs, the uploader must decide which of his friends should be able to access
the data. In OSNs, term "friend" has become all-encompassing, it has become
increasingly di cult for users to control which friends get to see what personal
information. Several studies on Facebook usage have shown that the average
number of friends per user is approximately 150. Anyone can make a request
to join a user's friend circle{family members, colleagues, classmates,
acquaintances, strangers etc. Current literature support the claim that users are willing
to add strangers to their friend circle [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. However, allowing strangers to join
user's friend circle can lead to a number of privacy risks [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Most of the OSNs
provide users with binary relational ties (e.g., friends or stranger) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. This
binary indicator provides only a coarse indication of the nature of the relationship.
In reality human relationships are much more complicated than a single binary
relational tie. There is need for segregation of friends according to the strength of
relational ties. Some of the social networking sites have begun providing
friendlists feature, in order to help users in organizing a large friend network into
groups. Grouping several hundred friends into di erent lists, however, can be
a laborious process; on what basis should users construct the friend-lists? And
even if the user were to group friends into lists, are these lists meaningful for
setting privacy policies? To alleviate the burden of constructing meaningful lists
manually, we propose interaction based audience segregation model for online
social networks. The estimation of friendship interaction intensity among OSN
users and its classi cation based on di erent level of intensity can be quite
useful for identifying privacy threat from individuals added as friends. The social
web is kind of virtual society that exhibits many of the characteristics of real
societies in term of forming relationships and how those relationships are
utilized. In real societies, the relationship strength is a crucial factor for individuals
while deciding the boundaries of their privacy. Moreover, this subjective feeling
is quite e ciently utilized by humans to decide various other privacy related
aspects such as what to reveal and whom to reveal.
      </p>
      <p>The main question for this research is how interactions of users determine
tie strength and implement privacy in online social networks. More speci cally,
we want to explore whether a users interaction with his friends can be used as
a basis for making data access decision for that users. To answer this question,
we need to understand nature of privacy in online social networks and dynamics
of interactions intensity for OSN users. We break main research question into
three sub questions:
{ How to measure privacy risk associated with social graph of OSN users?
{ How to construct interaction graph by quantifying users interactions in OSN?
{ How to segregate audience on the basis of interaction graph in OSN?</p>
      <p>First research question help to quantify the privacy risk attributed to friend
relationship in online social networks. We show that risky friends can reveal
user personal information unintentionally in online social networks. For
example, Javed and Serena are friends in online social network. Serena is very careful
about the privacy. She adopts a policy that conceals all her friends from public.
On the other hand, Javed, adopts a weaker policy that allows any users to view
his friends. In this case, Serena's relationship with Javed can still be learned
through Javed. We say that privacy con ict occurs as Serena's restrictive
policy is violated by Javed's weaker privacy policy. This shows that the user can
only control one direction of a an inherently bidirectional relationship. Second
research question deals with user's interaction patterns in online social networks.
We show that users tend to interact mostly with small subset of friends, often
having no interactions with majority of their friends in online social networks.
This cast doubts on the practice of extracting meaningful relationships from
social graphs. We suggest interaction based model for validating user relationships
in online social networks. Third research question deals with audience
segregation. We consider social interactions as currency to estimate friendship strength
and perform audience segregation. Providing users with audience segregation
mechanism would improve the quality of interactions and self presentations. Rest
of the paper is organized as follows. In section 2, we present characterization of
privacy in OSNs. Impact analysis of various social interactions is presented in
section 3. We discuss interaction based audience segregation and present model
to compute the interaction intensity in section 4. Section 5 discuss the related
literature. Finally, we conclude the paper with future research direction.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Privacy in Online Social Networks</title>
      <p>
        With emergence of the Web 2.0, a new debate started about the meaning and
value of privacy. According to some researchers privacy has been undermined by
online social networks, even some of them claim that it no longer exist.7 The
concept of privacy is so intricate that there is no universal de nition of it. One
of the oldest de nitions of privacy is "the right to be let alone". Warren and
Brandeis were one of the rst authors who recognize the multidimensionality
of privacy concept [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Privacy on the web in general revolves mostly around
7 Do Social Networks Brings the End of
http://www.scienti camerican.com/article/do-social-networks-bring/
Privacy?
information privacy. The information privacy is an individual's claim to control
the terms under which personal information is acquired, disclosed or used [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
With emergence of the social web, where users collaborate and share personal
information, we need to de ne privacy in ne grained manner to address existing
issues from multiparty perspectives. The de nition of privacy should be able to
address the privacy concerns related to OSN users, third party applications, and
OSN service providers.
      </p>
      <p>
        Palen et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] de ned privacy in very precise manner. This de nition gives
some idea of various realms in which privacy issue may occur. The authors
classify three boundaries of privacy with which OSNs users are struggling.
Disclosure Boundary It deals with managing private and public scope of
uploaded information.
      </p>
      <p>Identity Boundary It deals with managing self representation with speci c
audience.</p>
      <p>Temporal Boundary It deals with managing past actions with future
expectations; user behavior may change over time.</p>
      <p>The users have a scope in mind when they upload personal information in
online social networks. This scope is de ned by disclosure, identity, and temporal
boundaries. The privacy is breached when information is moved beyond its
intended scope either accidentally or maliciously. Simply a breach can occur when
information is shared with a party for whom it was not intended, it can also
happen when information is abused for di erent purpose than was intended, or
when information is accessed after its intended lifetime.</p>
      <p>
        Another very comprehensive concept of privacy is given by Patil et al. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
The authors present legal, social and technical perspectives from which the
notion of privacy is commonly described and analyzed.
      </p>
      <p>Normative from this perspective, privacy is an ethical concept. Privacy is
viewed as right of individual and thus as a matter of freedom.</p>
      <p>Social from this perspective, privacy has psychological and culture roots.
Privacy is socially constructed based on the behavior and interactions of
individuals as they conduct their day-to-day a airs.</p>
      <p>Technical the technical perspective views privacy in terms of the functional
characteristics of digital systems. Privacy is thus treated as the desire for
selective and adequate control over data and information.</p>
      <p>Note that three perspectives of privacy are not mutually exclusive but
interdependent. Normative focuses on laws and policies aiming to protect the individual
from cooperations, governments and other individuals. European data protection
framework is an example which promotes informational self determination
emphasizing an individual's right to control the collection and use of personal data.
Technical dimension of privacy aims at translating norms and regulations into
technical speci cations. The Platform for Privacy Preferences Project (P3P) is
one of the examples for enhancing the individual's ability to control information
disclosure by technical means. Social dimension of privacy focuses on managing
social relationships and boundaries between public and private life. Privacy is
breached if personal information is available outside its intended context.</p>
      <p>
        Netter et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] breaks the concept of privacy into a set of characteristics
that aim at analyzing the OSN privacy from multiparty perspectives. The
privacy risks associated with online social networks are mainly from OSNs users,
third party applications, or OSNs service providers. Each characteristic address
privacy risk related to one of these stakeholders.
      </p>
      <p>Audience Segregation This characteristic describes that each individual
performs multiple and possibly con icting roles in everyday life and it needs to
segregate the audience for each role, in way that people from one audience
cannot witness a role performance that is intended for another audience. In
current online social networks almost all friends are treated equally, As a
result, privacy is threatened because a large audience might have access to
personal information. This characteristic deals mainly with social web users.
Data Sovereignty It describes to what extent an individual is able to control
the processing of its personal data. In case of online social networks personal
data is available in structured manner. It can easily be copied, linked,
aggregated, and transferred. This characteristic deals mainly with OSNs service
providers and third party applications.</p>
      <p>Data Transience This characteristic revolves around the loss of personal
information over time. In computer mediated communication permanency of
personal information poses great challenge to privacy, whereas data
transience can be considered as typical characteristic of real world
communication. This characteristic deals mainly with OSNs service providers and third
party applications.</p>
      <p>Protection against pro ling It describes an individual's ability to prevent
an adversary from collecting, aggregating and link personal data in order
to create a digital dossier. The current landscape of online social networks
poses this threat at large scale. This characteristic deals with OSNs service
providers and third party applications.</p>
      <p>Privacy Awareness It describes that an individual's awareness for privacy
risks is a prerequisite for privacy preserving behavior. The characteristic
deals with all stakeholders at social level.</p>
      <p>Transparency It describes transparency of processing and dissemination
practices. This characteristic deals mainly with OSNs service providers and third
party applications.</p>
      <p>Enforcement It describes an individual's means to bring privacy preference
into force. This characteristic deals with OSNs service providers at legal
level.</p>
      <p>This paper focuses only on audience segregation characteristic to preserve
three boundaries of privacy de ned by Palen et al. The audience segregation is
main characteristic that deals with OSNs users. A comprehensive solution to
address the privacy risks associated with OSNs users can not be developed without
taking into consideration importance of audience segregation. We consider social
interactions as currency to estimate friendship strength and perform audience
segregation. In this paper, we develop a mathematical model for this purpose.
The issues related to third party applications and OSNs service providers are
not in the scope of this paper.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Social Interactions in Online Social Networks</title>
      <p>
        Online social networks are popular for interaction, communication and
collaboration between friends. The properties of social interactions have been studied
by many researchers. Facebook data team recently showed that a typical
Facebook user communicates with a small subset of their entire friends network, but
maintains relationships with a group that is two times larger.8 Wilson et al.[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]
propose the interaction graph, a model for representing user relationships based
on user interactions. The authors show that interaction activity on Facebook
is signi cantly skewed towards a small portion of each user's social links. This
nding casts doubt on the assumption that all social links imply equally
meaningful friend relationships. Burke et al.[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] study the role of user interactions on
Facebook. The authors quantify usage of visible actions (such as wall posts and
comments) and also silent actions (such as pro le visits). They show that, di
erent from high levels of content consumption, high levels of direct communication
among users is usually associated with greater feelings of emotional support from
close friends. Jiang et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] show that latent (or silent) interactions are much
more prevalent and frequent than visible interactions. Gao et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] attempt to
characterize and detect malicious forms of interactions in online social networks.
      </p>
      <p>In this section our main goal is to identify impact of various types of
interactions provided by online social networks. OSNs provide a variety of social
interactions. These interactions can play important role to estimate friend strength.
There are several interaction factors that can be considered to identify their
impact in developing relationship ties. These factors include type of interaction,
frequency of interaction, and initiation of interaction. The type of interaction
is quite important factor in order to estimate friendship strength. Online social
networks provide numerous types of interactions such as messages, wall posting,
comments, tagging, chatting etc, some of these interactions are real time and
the others are non-real time. An individual chooses an interaction type on
basis of relationship with target audience. Hence, the interaction type de nes the
intimacy, openness, sensitivity as well as strength of relationship between
communicating parties. The interaction frequency refers to total occurrences of each
type of interaction between an individual and his friends within certain period
of time. This factor helps to understand that users are willing to interact with
each other over a period of time. The interaction initiation factor is very
important to understand strength of relationship. We further categorize this aspect in
following manner.</p>
      <p>User Initiated Interactions When the user initiate interaction with his friend
it is termed as user initiated interactions. These interactions have more
8 Maintained Relationships on Facebook
http://overstated.net/2009/03/09/maintainedrelationships-on-facebook
weight in developing relationship strength because the user is willing to
communicate and collaborate with his friend.</p>
      <p>Friend Initiated Interactions When an individual friend initiate interaction
with the user it is termed as friend initiated interactions. These interactions
have less weight in developing relationship strength because willingness of
communication and collaboration is coming from the friend.</p>
      <p>As discussed earlier, the selection of interaction type gives an indication of
nature of relationship among users. Some the interaction types are preferred to
communicate with close friends, whereas the others to interact with ordinary
friends. Hence, all interaction types cannot be given similar weight in estimation
of relationship strength. Each interaction type is given a numerical weight in
order to increase or decrease its contribution in development relationship strength.
We consider social interaction as a very strong indicator for friend segregation.
Our model uses type, frequency, and interaction initiation factor to calculate
interaction intensity that can be useful in audience segregation. The term audience
segregation is explained in following section before presentation of our audience
segregation model.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Audience Segregation in Online Social Networks</title>
      <p>
        Social web users privacy issues can be addressed by providing users with tools
that help them manage their personal content in more privacy friendly
manner. In everyday life individuals have control over what kind of information is
presented to di erent audiences. Mirroring or mimicking this real life strategy,
we propose interaction based audience segregation model for online social
networks. The term "audience segregation" was coined by Go man [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] as part of
a perspective on the ways in which identities are constructed and expressed in
interactions between human beings in everyday context. According to Go man,
whenever individuals engage in interactions with others they perform roles, with
which they hope to present a favorable image of themselves. One of the key
elements of Go man's perspective on identity is the fact that individuals attempt
to present self-images that both are consistent and coherent. To accomplish this,
performers engage in audience segregation. While Go man's idea of audience
segregation didn't originally relate directly to privacy, it is easy to see that
audience segregation and privacy are, in fact, closely linked. Another quite similar
conclusion is drawn by Nissenbaum [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] that is privacy revolves around
contextual integrity. According to this view privacy revolves around person's ability to
keep audience separate and to compartmentalize his social life.
      </p>
      <p>
        Current online social networks don't provide users ne grained mechanism to
separate and manage various audiences. Many social networks sites only provide
their users the option to collect one list of contacts, called "friends". Some of
the social networks o er functionality of creating separate lists which require
user's time and e orts. Studies show that managing di erent lists is a burden
to many users and rarely applied [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. Given the fact that Facebook users, for
instance, on average have 150 friends, this necessarily con ates di erent contexts.
Providing OSN users a mechanism which mimic real life interaction patterns to
larger extent would improve self presentation, and reduce privacy risks. It will
also enable users to avoid social convergence, and provide users opportunity to
present di erent sides of themselves to di erent audiences.
4.1
      </p>
      <p>Social Interaction Based Audience Segregation Model
In online social networks individuals are connected with diverse audience such as
friends, family members, distant relatives, colleagues, old schoolmate etc. Some
of them are intimately known to user, whereas others are distant, loose, or even
unknown connections. This is main reason users want to make distinctions
between the types of information they want to share with these di erent categories
of connections, and give di erent connections access to di erent content.
Social interaction based audience segregation can play vital role to achieve this
objective.</p>
      <p>Social interaction based audience segregation model considers an individual
user u has n number of friends, f1; f2; f3; ; fn. The user and his friends can
interact with each other by k type of di erent interactions [t1; t2; ; tk], either
initiated by user or his/her friend. Each type of interaction ti is assigned a weight
wi0 on the basis of its importance in developing friendship strength. Following
vector w0 represents the weights of all interactions:
and w0 is normalized as:
where K = Pk
i=0 wi0.</p>
      <p>w0 = [w10; w20; w30; :::; wk0]
w =</p>
      <p>The frequency of all k type interactions is also considered separately for user
initiated and friend initiated interactions on basis of their repeated occurrences
in communication. Let ai be the frequency of interaction ti and let Fu;j be the
vector representing the frequency of all k type of interactions initiated by the
user u to user j given as:</p>
      <p>Fu;j = [a1; a2; a3; :::; ak]
where 1 j n. Similarly, Fj;u represents the frequency of all type of
interactions between user u and j initiated by j. The interaction intensity is calculated
by multiplication of each type of interactions frequency ai by its respective weight
wi and accumulation of all such interaction types separately for user initiated
interactions and friend initiated interactions. That is the interaction intensity of
user u with his friend j is computed as:
(1)
(2)
(3)
I(u;j) =
k
X Fu;j (i)
i=0</p>
      <p>wi
I(j;u) =
k
X Fj;u(i)
i=0
wi
where Fu;j (i) is the interaction frequency of interaction type ti and wi is
normalized weight as described above. Similarly, interaction intensity I(j; u) of user
j with u is computed.</p>
      <p>Finally, user and friend initiated interactions are multiplied by their respective
weights and accumulated to generate interaction intensity value of user u with
his friend j</p>
      <p>Tj =</p>
      <p>I(u;j) + (1
) I(j;u)
Where 0 1 and ; 1 are respective weight for user and friend initiated
interactions.</p>
      <p>There are three main contributions of this model. First, it considers all
possible of set interactions among friends. Secondly, the model considers the direction
of interaction either from user to friend or vice versa. Finally, it assigns
numerical weight to all interaction types based on their importance in the development
of friendship strength.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Related Literature</title>
      <p>
        One of the research studies closely related to our work is done by Lerone et al.
[
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. The author has introduced interaction count based approach to determine
relationship strength. The author simply takes into consideration three types
of interactions and count them in order to calculate relationship strength. The
interaction intensity model by Lerone et al. [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] do not di erentiate interactions
on the basis of initiative. Hence, it is possible that a malicious user intentionally
spam interactions to get access to sensitive pro le data. Our model takes into
consideration this issue and resolves it by assign more weight to interactions
initiated by user himself. Our model has another advantage over [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] that it
considers all interaction types o ered by online social networks.
      </p>
      <p>
        Waqar et al. [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] extended work of [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] by applying data mining model to
calculate relationship strength, Whereas, the model is not validated on real OSNs
data. The author also conducted online survey to analyze Facebook user's
interaction behavior with their friends. Xiang et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] proposed a model to infer
relationship strength based on pro le similarity and interaction activity. Lizi
et al. [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] proposed interaction ranking based trustworthy friend
recommendation model. Another interesting work by the author [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] proposed trust ranking
based recommendation model for suggesting the most trustworthy community
members. The author investigated four new interaction attributes that in uence
trust in virtual communities. A recent work related to friend recommendation
is done by Zhao et al.[
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. The author proposed scalable and explainable friend
recommendation model for social network systems.
      </p>
      <p>
        The majority of online social networks o er second degree access which means
a friend of a friend is able to access the user's personal information. According to
Cuneyt et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] friends can be source of privacy risk because this relationship
always implies the release of some personal information not only to friends, but
also to friends of a friend, which are strangers for the users. Another interesting
fact demonstrated by Frank et al. [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] that more users are willing to divulge
personal details to an adversary if there is a mutual friend connected to the
adversary and the user. Christo et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] shows that users tend to interact
mostly with small subset of friends, often having no interactions with up to
50 percent of their friends. The author suggests a model for representing user
relationships based on user interactions. These works supports our idea that all
friends should not be give equal access to user personal information, but access
to personal information should be administrated based on interaction frequency
among users.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future Work</title>
      <p>In this paper, We proposed social interaction based audience segregation model
which mimic real life interaction patterns to larger extent. We also identi ed
the impact of various social interactions available to users in online social
networks. There are three main contributions of our model. First of all, it consider
all possible of set interactions among friends. Secondly, the model considers the
direction of interaction either from user to friend or vice versa. Finally, all
interaction types are assigned a numerical weight in order to increase or decrease
its contribution in interaction intensity calculation based on its importance in
the development of relationship ties. Our future plans include implementation
of this model.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>George</given-names>
            <surname>Pallis</surname>
          </string-name>
          , Demetrios Zeinalipour-Yazti, and
          <string-name>
            <given-names>Marios D</given-names>
            <surname>Dikaiakos</surname>
          </string-name>
          .
          <article-title>Online social networks: status and trends</article-title>
          .
          <source>In New Directions in Web Data Management</source>
          <volume>1</volume>
          , pages
          <fpage>213</fpage>
          {
          <fpage>234</fpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Bibi van den Berg, Stefanie Potzsch, Ronald Leenes,
          <article-title>Katrin Borcea-P tzmann, and Filipe Beato. Privacy in social software</article-title>
          .
          <source>In Privacy and Identity Management for Life</source>
          , pages
          <volume>33</volume>
          {
          <fpage>60</fpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Justin</given-names>
            <surname>Lee</surname>
          </string-name>
          Becker and
          <string-name>
            <given-names>Hao</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Measuring privacy risk in online social networks</article-title>
          .
          <source>PhD thesis</source>
          , University of California, Davis,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Catherine</given-names>
            <surname>Dwyer</surname>
          </string-name>
          , Starr Roxanne Hiltz, and
          <string-name>
            <given-names>Katia</given-names>
            <surname>Passerini</surname>
          </string-name>
          .
          <article-title>Trust and privacy concern within social networking sites: A comparison of facebook and myspace</article-title>
          .
          <source>In AMCIS, page 339</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ai</surname>
            <given-names>Ho</given-names>
          </string-name>
          , Abdou Maiga, and
          <article-title>Esma Ameur. Privacy protection issues in social networking sites</article-title>
          .
          <source>In Computer Systems and Applications</source>
          ,
          <year>2009</year>
          .
          <article-title>AICCSA 2009</article-title>
          . IEEE/ACS International Conference on, pages
          <volume>271</volume>
          {
          <fpage>278</fpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Giles</given-names>
            <surname>Hogben</surname>
          </string-name>
          .
          <article-title>Security issues and recommendations for online social networks</article-title>
          .
          <source>ENISA position paper</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Balachander</given-names>
            <surname>Krishnamurthy</surname>
          </string-name>
          and
          <string-name>
            <given-names>Craig E</given-names>
            <surname>Wills</surname>
          </string-name>
          .
          <article-title>Characterizing privacy in online social networks</article-title>
          .
          <source>In Proceedings of the rst workshop on Online social networks</source>
          , pages
          <volume>37</volume>
          {
          <fpage>42</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Chi</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Jinyuan Sun, Xiaoyan Zhu, and
          <string-name>
            <given-names>Yuguang</given-names>
            <surname>Fang</surname>
          </string-name>
          .
          <article-title>Privacy and security for online social networks: challenges and opportunities</article-title>
          . Network, IEEE,
          <volume>24</volume>
          (
          <issue>4</issue>
          ):
          <volume>13</volume>
          {
          <fpage>18</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Ralph</given-names>
            <surname>Gross</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Acquisti</surname>
          </string-name>
          .
          <article-title>Information revelation and privacy in online social networks</article-title>
          .
          <source>In Proceedings of the 2005 ACM workshop on Privacy in the electronic society</source>
          , pages
          <volume>71</volume>
          {
          <fpage>80</fpage>
          . ACM,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <article-title>Javed Ahmed and Zubair Ahmed Shaikh</article-title>
          .
          <article-title>Privacy issues in social networking platforms: comparative study of facebook developers platform and opensocial</article-title>
          .
          <source>In Computer Networks and Information Technology (ICCNIT)</source>
          , 2011 International Conference on, pages
          <volume>179</volume>
          {
          <fpage>183</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Cuneyt Gurcan Akcora, Barbara Carminati, and
          <string-name>
            <given-names>Elena</given-names>
            <surname>Ferrari</surname>
          </string-name>
          .
          <article-title>Risks of friendships on social networks</article-title>
          .
          <source>arXiv preprint arXiv:1210.3234</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Rongjing</surname>
            <given-names>Xiang</given-names>
          </string-name>
          , Jennifer Neville, and
          <string-name>
            <given-names>Monica</given-names>
            <surname>Rogati</surname>
          </string-name>
          .
          <article-title>Modeling relationship strength in online social networks</article-title>
          .
          <source>In Proceedings of the 19th international conference on World wide web</source>
          , pages
          <volume>981</volume>
          {
          <fpage>990</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Samuel</surname>
            <given-names>D</given-names>
          </string-name>
          <string-name>
            <surname>Warren</surname>
            and
            <given-names>Louis D</given-names>
          </string-name>
          <string-name>
            <surname>Brandeis</surname>
          </string-name>
          .
          <article-title>The right to privacy</article-title>
          .
          <source>Harvard law review</source>
          , pages
          <volume>193</volume>
          {
          <fpage>220</fpage>
          ,
          <year>1890</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>Jerry</given-names>
            <surname>Kang</surname>
          </string-name>
          .
          <article-title>Information privacy in cyberspace transactions</article-title>
          .
          <source>Stanford Law Review</source>
          , pages
          <volume>1193</volume>
          {
          <fpage>1294</fpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Leysia</given-names>
            <surname>Palen</surname>
          </string-name>
          and
          <string-name>
            <given-names>Paul</given-names>
            <surname>Dourish</surname>
          </string-name>
          .
          <article-title>Unpacking privacy for a networked world</article-title>
          .
          <source>In Proceedings of the SIGCHI conference on Human factors in computing systems</source>
          , pages
          <volume>129</volume>
          {
          <fpage>136</fpage>
          . ACM,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>Sameer</given-names>
            <surname>Patil</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alfred</given-names>
            <surname>Kobsa</surname>
          </string-name>
          .
          <article-title>Privacy considerations in awareness systems: designing with privacy in mind</article-title>
          .
          <source>In Awareness Systems</source>
          , pages
          <fpage>187</fpage>
          {
          <fpage>206</fpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Michael</surname>
            <given-names>Netter</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Herbst</surname>
          </string-name>
          , and Gunther Pernul.
          <article-title>Analyzing privacy in social networks{an interdisciplinary approach</article-title>
          . In Privacy, security,
          <source>risk and trust (passat)</source>
          ,
          <source>2011 ieee third international conference on and 2011 ieee third international conference on social computing (socialcom)</source>
          , pages
          <fpage>1327</fpage>
          {
          <fpage>1334</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Christo</surname>
            <given-names>Wilson</given-names>
          </string-name>
          , Bryce Boe, Alessandra Sala, Krishna PN Puttaswamy, and
          <string-name>
            <surname>Ben</surname>
            <given-names>Y Zhao.</given-names>
          </string-name>
          <article-title>User interactions in social networks and their implications</article-title>
          .
          <source>In Proceedings of the 4th ACM European conference on Computer systems</source>
          , pages
          <volume>205</volume>
          {
          <fpage>218</fpage>
          .
          <string-name>
            <surname>Acm</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Moira</surname>
            <given-names>Burke</given-names>
          </string-name>
          , Cameron Marlow, and Thomas Lento.
          <article-title>Social network activity and social well-being</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems</source>
          , pages
          <year>1909</year>
          {
          <year>1912</year>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Jing</surname>
            <given-names>Jiang</given-names>
          </string-name>
          , Christo Wilson, Xiao Wang, Wenpeng Sha, Peng Huang,
          <string-name>
            <given-names>Yafei</given-names>
            <surname>Dai</surname>
          </string-name>
          , and Ben Y Zhao.
          <article-title>Understanding latent interactions in online social networks</article-title>
          .
          <source>ACM Transactions on the Web (TWEB)</source>
          ,
          <volume>7</volume>
          (
          <issue>4</issue>
          ):
          <fpage>18</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Hongyu</surname>
            <given-names>Gao</given-names>
          </string-name>
          , Jun Hu, Christo Wilson,
          <string-name>
            <given-names>Zhichun</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Yan</given-names>
            <surname>Chen</surname>
          </string-name>
          , and Ben Y Zhao.
          <article-title>Detecting and characterizing social spam campaigns</article-title>
          .
          <source>In Proceedings of the 10th ACM SIGCOMM conference on Internet measurement</source>
          , pages
          <volume>35</volume>
          {
          <fpage>47</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Erving</surname>
          </string-name>
          <article-title>Go man. The presentation of self in everyday life</article-title>
          .
          <year>1959</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>Helen</given-names>
            <surname>Nissenbaum</surname>
          </string-name>
          .
          <article-title>Privacy as contextual integrity</article-title>
          . Wash. L. Rev.,
          <volume>79</volume>
          :
          <fpage>119</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Joan Morris DiMicco and David R Millen.</surname>
          </string-name>
          <article-title>Identity management: multiple presentations of self in facebook</article-title>
          .
          <source>In Proceedings of the 2007 international ACM conference on Supporting group work</source>
          , pages
          <volume>383</volume>
          {
          <fpage>386</fpage>
          . ACM,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <article-title>Lerone Banks and Shyhtsun Felix Wu</article-title>
          .
          <article-title>All friends are not created equal: An interaction intensity based approach to privacy in online social networks</article-title>
          .
          <source>In Computational Science and Engineering</source>
          ,
          <year>2009</year>
          . CSE'09. International Conference on, volume
          <volume>4</volume>
          , pages
          <fpage>970</fpage>
          {
          <fpage>974</fpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Waqar</surname>
            <given-names>Ahmad</given-names>
          </string-name>
          , Asim Riaz, Henric Johnson, and
          <string-name>
            <given-names>Niklas</given-names>
            <surname>Lavesson</surname>
          </string-name>
          .
          <article-title>Predicting friendship intensity in online social networks</article-title>
          .
          <source>In 21st International Tyrrhenian Workshop on Digital Communications</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Lizi</surname>
            <given-names>Zhang</given-names>
          </string-name>
          , Hui Fang, Wee Keong Ng, and Jie Zhang. Intrank:
          <article-title>Interaction rankingbased trustworthy friend recommendation</article-title>
          .
          <source>In Trust, Security and Privacy in Computing and Communications (TrustCom)</source>
          ,
          <year>2011</year>
          IEEE 10th International Conference on, pages
          <volume>266</volume>
          {
          <fpage>273</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Lizi</surname>
            <given-names>Zhang</given-names>
          </string-name>
          , Cheun Pin Tan,
          <string-name>
            <given-names>Siyi</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Hui</given-names>
            <surname>Fang</surname>
          </string-name>
          , Pramodh Rai, Yao Chen, Rohit Luthra, Wee Keong Ng,
          <string-name>
            <surname>and Jie Zhang.</surname>
          </string-name>
          <article-title>The in uence of interaction attributes on trust in virtual communities</article-title>
          .
          <source>In Advances in User Modeling</source>
          , pages
          <volume>268</volume>
          {
          <fpage>279</fpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Zhao</surname>
            <given-names>Du</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lantao Hu</surname>
          </string-name>
          , Xiaolong Fu, and Yongqi Liu.
          <article-title>Scalable and explainable friend recommendation in campus social network system</article-title>
          .
          <source>In Frontier and Future Development of Information Technology in Medicine and Education</source>
          , pages
          <volume>457</volume>
          {
          <fpage>466</fpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <given-names>Frank</given-names>
            <surname>Nagle</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lisa</given-names>
            <surname>Singh</surname>
          </string-name>
          .
          <article-title>Can friends be trusted? exploring privacy in online social networks</article-title>
          .
          <source>In Social Network Analysis and Mining</source>
          ,
          <year>2009</year>
          . ASONAM'09. International Conference on Advances in, pages
          <volume>312</volume>
          {
          <fpage>315</fpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>