<!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>Approximating Social Ties Based on Call Logs: Whom Should We Prioritize?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mohammad Erfan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alim Ul Gias</string-name>
          <email>alim@iit.du.ac.bd</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sheikh Muhammad Sarwar</string-name>
          <email>smsarwar@iit.du.ac.bd</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kazi Sakib</string-name>
          <email>sakib@iit.du.ac.bd</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Information Technology University of Dhaka</institution>
          ,
          <addr-line>Dhaka-1000</addr-line>
          ,
          <country country="BD">Bangladesh</country>
        </aff>
      </contrib-group>
      <fpage>28</fpage>
      <lpage>39</lpage>
      <abstract>
        <p>Telecommunication service providers could analyze the call logs of individual users to provide personalized services like recommending Friends and Family (FnF) numbers, that could be registered for having lower tariff during communication. However, suggesting such numbers is not simple as the decision making process can often be misled by factors like overall talk-time or call frequency. This paper proposes a technique to assist mobile phone users for effectively identifying FnF numbers using the underlying social network of a call graph. It resembles to a star network, having the user at the center, where each of the edges are weighted using three call log attributes: call duration, call location and call period. The weighted call graph is then used to calculate user's social closeness based on which FnF numbers are suggested. The experiment was conducted on a set of real life data and it is seen that the proposed technique can effectively suggest FnF numbers with an Fmeasure value of 0.67.</p>
      </abstract>
      <kwd-group>
        <kwd>Social network</kwd>
        <kwd>mobile phone call graph</kwd>
        <kwd>call log attributes</kwd>
        <kwd>social closeness</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Personalized services can be defined as context-specific services to each
individual client [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Since mobile phone can always be carried by the client, it has the
potential to be an ideal medium of such personalization. This potential allows
telecommunication service providers to offer multiple personalized services like
customized ring tone suggestions or different location based information.
Providing such services can increase the popularity of the service providers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and
help them to sustain in the competitive market. Thus, it is high time
telecommunication companies focused more on providing personalized services to each
user for eventually increasing their overall revenue.
      </p>
      <p>
        Recommending Friends and Family (FnF) numbers [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], that can be registered
by the user for having lower call rate, could be an example of customized personal
services. To provide such service, it is essential to retrieve each users’ calling
pattern by analyzing their respective call logs. However, analysis and interpretation
of these call logs is particularly difficult and introduces major research issues [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
A possible solution could be, utilizing the underlying social network [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] of those
call logs. Nevertheless, constructing such network involves multiple challenges
like relative prioritization of in and out degrees, and assigning weight to edges
by using different call log attributes.
      </p>
      <p>
        Although multiple research has been conducted based on mobile phone call
logs, none has focused directly to provide personalized services to each individual
user. There have been some work that focus on investigating social ties based on
different call attributes [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Some of the researchers have focused on predicting
user behavior [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and community dynamics [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Moreover, there are works which
forecast incoming calls [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and correlate international calls with the
exportimport business of the country [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. However, it is arguable that whether these
state of the arts can be used to provide effective personalized services that can
satisfy each individual user.
      </p>
      <p>This paper proposes a methodology to create a weighted call graph based on
individual call logs and use the graph’s underlying social network for predicting
FnF numbers. To weight the edges, three call log attributes are used which are
call duration, call period and call location. The technique empirically measures
the effect of these attributes towards social closeness and calculates their relative
significance. The summation of these relative significances, that prevents any of
the attributes being predominated, is considered as the weight. A closeness score
is then calculated by aggregating the product of the weights with values respect
to their call being either incoming or outgoing. This score is used by the method
to rank and suggest numbers for registering as FnF.</p>
      <p>The method was implemented and its performance was evaluated based on
a real life dataset. The dataset includes all required call log attributes along
with a user provided score which indicates the strength of social tie with the
person of that particular call. These scores were considered as the ground truth
when weights for edges of the graph are being learned. The social closeness was
then measured, based on which numbers were ranked, to predict FnF numbers.
The performance of the proposed technique was compared along with traditional
approaches based on overall talk-time and call frequency. It seen that the method
outperforms the call frequency and overall talk-time based approaches with 38%
and 10% higher F-measure value.</p>
      <p>Rest of the paper is organized as follows: Section 2 highlights state of the
art techniques for analyzing call logs to derive different social contexts. The
proposed technique to predict FnF numbers is presented in Section 3. Section
4 includes the experimental details and performance of the proposed technique.
Finally, this paper is concluded in Section 5 with a discussion about our work
and future research directions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Literature Review</title>
      <p>
        Although log analysis has been a major research concern for a considerable
amount of time [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], its application in mobile phone call pattern analysis has
started comparatively later. To the best of authors’ knowledge, no work directly
focus on utilizing the underlying social network obtained from a single user’s call
logs to provide customized services. The work that have been done mostly focus
on constructing social networks from call logs, predicting the user behavior and
identifying multiple social contexts like social affinity or community dynamics.
This section highlights these contributions and discusses how they contrast to
our problem domain.
      </p>
      <p>
        There have been some significant work which are concerned with predicting
the user behavior. For an example, Dong et. al. proposed a technique to create an
undirected binary graph from the call log to find the human behavior of different
age and gender [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The researchers in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] proposed a method to derive the user
relation using Bayesian network. Phithakkitnukoon et. al. analyzed multiple call
log attributes such as call location, talk-time, calling time and inter-arrival time
to infer behavioral dependencies [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The researcher in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] inferred friendship
network by utilizing the behavioral and survey data. Zhang et. al. have focused on
information retrieval techniques to find human behavior patterns and community
dynamics [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. There have also been work to assess the strength of social tie based
on call duration [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        Identifying different social contexts has been another field of major research
interest. Phithakkitnukoon et. al. proposed a method to identify social network
based on the user phone call log [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. They have used correlation coefficient to
select call log features and then extracted user’s social behavioral pattern from that
network. Another work of Phithakkitnukoon et. al. has been presented in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]
where they created a network graph to derive socially closest and distant
members. The researchers in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] analyzed international phone calls from Rwanda,
between January 2005 to December 2008, to derive the interpersonal
connections between the people of different countries. They have used those findings to
measure and evaluate the social tie between nations.
      </p>
      <p>
        Researchers have also focused on the construction of call graph by utilizing
different call log attributes. The researchers in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] created a social network graph
using call duration, source number, destination number and physical location of
the user. They have extracted these information from Call Detail Record (CDR)
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] files and and generated the adjacency matrix. The edges were weighted using
the call duration value. Motahari et. al. have also used the CDR files and created
multiple affinity networks such as family members, utility network, friends and
co-workers [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. They have used CDR files containing 4.3 million phone call data
which was collected from 360,000 subscribers.
      </p>
      <p>
        Review of the state of the art shows that these works are generally focused
on predicting users’ behavioral pattern rather than utilizing those patterns for
providing better user experience. It is arguable that whether these methods can
be used for determining user’s social tie along with utilizing the findings in a
separate strategy to suggest FnF numbers. From different research, it is also
seen that the edges of the constructed call graph is weighted using call duration.
Nevertheless, it may not be the correct representation of social affinity. The
reason behind this is though frequent or long communication likely indicates a
strong tie, little or no communication does not necessarily indicate a weak tie [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
Thus it is required to incorporate other call log attributes, to assign weights on
graph edges, for actual representation of individual’s social tie. This weighted
graph can be easily used to infer the socially closest members and their numbers
can be suggested as FnF.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Proposed Method</title>
      <p>This research proposes a methodology to create a social network graph using the
phone call log. The network will resemble to a star network where the phone user
will be the center node and individuals with whom communication has occurred
are the peripheral nodes. There will be weighted edges between the central and
peripheral nodes which will indicate the strength of their social ties.The graph
will have two type of edges, one for the incoming calls and other for the outgoing
ones. The frequency of calls will not effect the number of edges since it will be
considered during the weight calculation. A sample social network is presented
in Figure 1. From the figure it can be seen that communications are represented
by weighted edges where the outgoing call to individual pn has a weight wn1 and
the incoming call has a weight wn2.</p>
      <p>User</p>
      <p>Initially call log records will be taken from the phone. The call logs should
have the following information: call duration, call period (a period of the day
like 3:00 AM to 6:00 AM) and call location (the place from which the call was
made). It is essential to utilize all these information for weighting graph edges
since using only call duration can often misled regarding the approximation of
social closeness. For an example, a user may talk with a person at his office for
a long time. However, that person could be a client instead of being a friend
or relative. So it will be wrong to consider that person as a socially close one
based on the call duration. Moreover, talking with a someone during the office
hours (like 9:00 AM to 5:00 PM ) for a long time might misled in estimating the
nature of social affinity. Thus it would be more reasonable to assign a weight by
combining all these three information. The proposed method utilizes these call
log attributes to assign a weight which is defined in Equation (1).
ω ij =</p>
      <p>N
X(α · δ ijk + β q(ijk) + γ r(ijk))
k=1
(1)</p>
      <p>In Equation (1), ω ij refers to the weight of the edge between the person pi
and phone’s user for all calls of type j (like incoming, outgoing or missed). The
set of all j type calls, with respect to person pi is represented by Cij . If |C ij | = N ,
the weight ω ij will be the summation of N values. The values will depend on
call duration (δ ), call period and call location. The value of call duration is used
by multiplying it with a weight α that reflects the significance of call duration
towards social ties. To represent the significance of call period and call location,
two sets of values, S and L has been introduced. The elements of those two sets
are represented by β and γ respectively. To define their relation with the set of
calls Cij , two mapping functions q : Cij → S and r : Cij → L are defined.</p>
      <p>In a nutshell, the weight will be calculated by considering each of the calls
of type j from person pi. For each particular call k, its duration will be
multiplied by a significance factor α . This multiplied value will be added with the
corresponding β and γ value of that particular call. However, the system must
at first calculate those significance values. The social closeness should then have
to be calculated for suggesting the FnF numbers. The procedure for these tasks
are discussed in details in the following subsections.
3.1</p>
      <sec id="sec-3-1">
        <title>Determining the significance values</title>
        <p>
          Since longer communications likely indicate a strong tie [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], the proposed method
uses the correlation coefficient between the call duration and social closeness as
the value of α . However, information regarding the social closeness of people from
each call is a pre-requisite to calculate the coefficient. To determine the values of
β and γ , one has to first fix the number of call periods and locations that should
be considered. The set of these periods and locations are defined as T and L
respectively. For each of the elements in set T and L, the method generates a
separate value of β and γ respectively. These values, combined together, are then
represented by two sets S and L respectively.
        </p>
        <p>The first step in calculating the values of β and γ requires to define a threshold
value σ . This value is used to identify the people who are socially closest to the
phone user. If the social closeness value of a person is above the threshold,
that individual is considered as having a strong social tie. The second steps
involves calculating the percentage of people over σ for each of the call periods
and locations. These percentages provide an insight regarding the significance of
each period and location. However, to consider those as weights, their relative
significance is needed to be considered which is calculated at the final step. This
whole procedure is illustrated in Algorithm 1.
8: S ∪ { β i}
9: end for
10: for each li ∈ L do
11: γ i = pesrucmenmtaagteioonf opfeopperleceonvteargeσ vfoarluleosc a∀tliio∈nL li
After determining the values of α , β and γ , the weight ω ij of call type j from
person pi can be calculated using Equation (1) . The weights ω ij for each of the
individuals are included in the set Wij which is used by the proposed method to
represent a social network as shown in Figure 1. To calculate the social closeness
of the person pi, the method uses a mapping function φ : J → I , where J
and I represent the set of call types and their significances respectively. This
mapping function φ is used to determine the weight of different call types.
Assigning different weights to different call types is important since the significance
of different call types (incoming or outgoing) could be different. During the
calculation of social closeness for person pi, as shown in Equation (2), the weights
of that person ω ij for call type j is multiplied by its respective weight provided
by the mapping function φ .</p>
        <p>θ i =</p>
        <p>M
X φ (j) · ω ij
j=1
(2)</p>
        <p>The process of determining the social closeness and ranking the individuals
based on that score is presented in Algorithm 2. Initially, as used in Algorithm 1,
a threshold σ is defined to identify socially closest persons. This threshold is used
to calculate the percentage of socially closest persons for each call of type j. The
percentage values are then used to determine the relative significance of different
call types. Using these relative significance values, the method calculates the
social closeness as defined in Equation (2). Each of the individuals, with whom
communication has occurred, are sorted in descending order of social closeness.
The method then suggests the numbers of certain individuals, at the top of the
list, as FnF numbers.</p>
        <p>Algorithm 2 Calculating Social Closeness
Input: The set Wij , Cij , J and the mapping function φ
Output: List of individuals sorted in descending order of social closeness
1: Begin
2: Define a threshold σ for social closeness to determine socially closest persons
3: Calculate the percentage of calls from people whose social closeness value is over
σ for each j type of calls
4: Initialize I ← ∅
5: for each j ∈ J do
6: λ j = pesrucemnmtaagteioonf pofeoppelreceonvteargσe fvoarluceasll∀ tjy∈Jpe j
7: I ∪ { λ j}
8: end for
9: Use Equation (2) to calculate social closeness for each of individual
10: Sort the list of individuals in descending order of social closeness
11: End
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental Setup and Results</title>
      <p>This section discusses about different experimental parameters that were used
during the evaluation of our proposed approach. It also includes the performance
of the proposed technique with a comparison along with two baseline approaches
to suggest FnF numbers.
4.1</p>
      <sec id="sec-4-1">
        <title>Experimental Parameters</title>
        <p>For experimental purpose the call logs were collected from 18 individuals. The
call logs included the person’s mobile phone number, call duration and call time.
The call location was manually collected from them. The participants had also
provided a social closeness score, to each of the persons from the call log, in a
scale of 1-10. Moreover, each of them were also asked to select 3 numbers from
these call logs which they could register as FnF numbers. 5 of the participants
provided those numbers and thus their data were used for the testing purpose.
Rest of the data were used to train the proposed method that involves learning
the values of α , β , γ and λ . During the calculation of these weights, the value of
σ was set to 8 which is considerably higher enough in the social closeness scale
for recognizing socially closest persons.</p>
        <p>The value of α was calculated by determining the correlation coefficient
between call duration and social closeness. It has been found that the call duration
and social closeness has a positive relationship, though not that much strong.
This has been illustrated in Figure 2 by a scatter diagram where social closeness
is plotted against call duration. The value of correlation coefficient was found to
be 0.14 and it was set as the value of α .</p>
        <p>14
12
n 10
o
i
tra 8
u
llaD 6
C
4
2
0 0
2
4 6
Social Closeness
8
10</p>
        <p>For the calculation of β , we have divided a day into 8 time periods. The
percentage of socially closest calls and their relative weight is presented in Table 1.
A scatter diagram is presented in Figure 3 to illustrate the percentage of socially
closest people in two different time periods.
60%
67%
25%
55%
26%
41%
56%
37%</p>
        <p>For calculating the value of γ , the locations were categorized before collecting
the data. For each of the call logs, the location was selected as either home or
work place. Although there were instances where users were neither in home nor
14
12
in work place, still they had used various measures two provide the location
information. Examples include selecting the place nearest to their current position
or based on the nature of call and its period. These data, as presented in Figure
4, was used to calculate the value of γ . For the home and workplace, the value
turned out to be 0.44 and 0.56 respectively.</p>
        <p>20
40 60 80</p>
        <p>Number of Instances
(a) Location - Home
100
120
2
0 0 10 20 30 40 50 60 70 80 90</p>
        <p>Number of Instances
(b) Location - Workplace</p>
        <p>In this work, ignoring the missed calls, incoming and outgoing calls has been
considered to measure the value of λ . The percentage of calls from socially closest
persons for outgoing and incoming calls can be visualized from Figure 5. Since
there were only two call types, after calculating the weight of work place, the
other weight was calculated by Equation 3. The weights for the incoming and
outgoing calls has been calculated as 0.44 and 0.56 respectively.
φ (j) =
λ
1 − λ
if the value of j is 1
otherwise</p>
        <p>(3)
The proposed technique tried to match 2 out of 3 FnF numbers provided by each
individuals. The system suggested 5 numbers, one after another, and stopped
at the point where two numbers had being matched. Thus for 5 individuals,
the system tried to match 10 FnF numbers with at most 25 attempts. We have
compared the performance of our system with two baseline approaches which are
based on overall call duration and call frequency. The evaluation technique for
these two approaches remained the same. It is seen that the proposed method
has identified 7 FnF numbers with 22 attempts. On the other hand, the
durationbased and frequency based approaches has identified 6 and 3 numbers with 22
and 25 attempts respectively.</p>
        <p>
          The performance of the technique, as shown in Table 2, is interpreted in terms
of precision, recall and F-measure. It is seen that proposed method outperforms
the other two approaches though the value of the precision is low. However, in
this case, recall is more important than precision. This is because for each of the
individuals, we are suggesting at most 5 numbers to match with 2 numbers. Due
to this, the precision will always be lower due to having more false positives.
Nevertheless, the user will always be satisfied if the system chooses more from
the set of relevant numbers. So during the calculation of F-measure, as done in
[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], the method needs to vary the weights of precision and recall. Thus in our
case, recall has been weighted five times higher than the precision during the
calculation of F-measure using Equation (4).
        </p>
        <p>FB = (1 + B2) precision · recall (4)</p>
        <p>· B2 · precision + recall</p>
        <p>For the individuals with whom the performance was evaluated, the pattern
of score provided by the system and the social closeness score provided by the
phone users is illustrated in Figure 6. Although the scale of those two scores
are different, it is seen that their curves are very much similar. As the system
suggested FnF numbers based on calculated closeness scores, the performance is
better than the other two approaches.</p>
        <p>1.2
1
0.8
roe 0.6
c
S
0.4
0.2
0 0</p>
        <p>CCaloclulelactteedd
20 40 60 80 100 120 140 160</p>
        <p>Number of Instances
This paper introduces a technique to prioritize individuals based on call logs
and suggest FnF numbers using that prioritize list. The method utilizes the
underlying social network of the call graph for a single phone user. The edges of
the call graph has been weighted during the prioritization process to incorporate
different call log attributes like duration, period and location. The proposed
methodology was implemented and tested against a set of real life data. The
system has illustrated its effectiveness in identifying FnF numbers with an
Fmeasure value of 0.67. This research also introduces a set of new research ideas
for the research communities. This includes assessing the existence of a nonlinear
relationship, between duration and social closeness, to improve the performance
of the system. Moreover, one could utilize other call log attributes and optimize
their total number to get better performance.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This work is supported by the University Grant Commission, Bangladesh under
the Dhaka University Teachers Research Grant No-Regi/Admn-3/2015/48747.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ho</surname>
            ,
            <given-names>S.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwok</surname>
            ,
            <given-names>S.H.</given-names>
          </string-name>
          :
          <article-title>The attraction of personalized service for users in mobile commerce: an empirical study</article-title>
          .
          <source>ACM SIGecom Exchanges</source>
          <volume>3</volume>
          (
          <issue>4</issue>
          ),
          <fpage>10</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Witteman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Efficient proximity detection among mobile clients using the GSM network</article-title>
          .
          <source>Master's thesis</source>
          , University of Twente (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dey</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Newman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prendergast</surname>
          </string-name>
          , R.:
          <article-title>Analysing appropriation and usability in social and occupational lives: An investigation of bangladeshi farmers' use of mobile telephony</article-title>
          .
          <source>Information Technology &amp; People</source>
          <volume>24</volume>
          (
          <issue>1</issue>
          ),
          <fpage>46</fpage>
          -
          <lpage>63</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>De</surname>
            <given-names>Melo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>P.O.V.</given-names>
            ,
            <surname>Akoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Faloutsos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Loureiro</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.A.</surname>
          </string-name>
          :
          <article-title>Surprising patterns for the call duration distribution of mobile phone users</article-title>
          . In:
          <article-title>Machine learning and knowledge discovery in databases</article-title>
          , pp.
          <fpage>354</fpage>
          -
          <lpage>369</lpage>
          . Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , D.: Mobile Social Networking. Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Wiese</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Min</surname>
            ,
            <given-names>J.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hong</surname>
            ,
            <given-names>J.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zimmerman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Assessing Call and SMS Logs as an Indication of Tie Strength</article-title>
          .
          <source>Tech. rep.</source>
          ,
          <string-name>
            <surname>Human-Computer Interaction</surname>
            <given-names>Institute</given-names>
          </string-name>
          , School of Computer Science, Carnegie Mellon University (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Motahari</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mengshoel</surname>
            ,
            <given-names>O.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reuther</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Appala</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zoia</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shah</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The impact of social affinity on phone calling patterns: Categorizing social ties from call data records</article-title>
          .
          <source>In: Proceedings of the Sixth Workshop on Social Network Mining and Analysis</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . ACM (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>Z.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>G.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>K.Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          :
          <article-title>An experimental study of largescale mobile social network</article-title>
          .
          <source>In: Proceedings of the 18th International Conference on World Wide Web</source>
          . pp.
          <fpage>1175</fpage>
          -
          <lpage>1176</lpage>
          . ACM (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>The emergence of social and community intelligence</article-title>
          .
          <source>Computer</source>
          <volume>44</volume>
          (
          <issue>7</issue>
          ),
          <fpage>21</fpage>
          -
          <lpage>28</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Phithakkitnukoon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dantu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Claxton</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eagle</surname>
          </string-name>
          , N.:
          <article-title>Behavior-based adaptive call predictor</article-title>
          .
          <source>ACM Transactions on Autonomous and Adaptive Systems (TAAS) 6</source>
          (
          <issue>3</issue>
          ),
          <volume>21</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Blumenstock</surname>
            ,
            <given-names>J.E.</given-names>
          </string-name>
          :
          <article-title>Using mobile phone data to measure the ties between nations</article-title>
          .
          <source>In: Proceedings of the 2011 iConference</source>
          . pp.
          <fpage>195</fpage>
          -
          <lpage>202</lpage>
          . ACM (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Oliner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganapathi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Advances and challenges in log analysis</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>55</volume>
          (
          <issue>2</issue>
          ),
          <fpage>55</fpage>
          -
          <lpage>61</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>H.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cho</surname>
            ,
            <given-names>S.B.</given-names>
          </string-name>
          :
          <article-title>Building mobile social network with semantic relation using Bayesian network-based life-log mining</article-title>
          .
          <source>In: Second International Conference on Social Computing (SocialCom)</source>
          . pp.
          <fpage>401</fpage>
          -
          <lpage>406</lpage>
          . IEEE (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Eagle</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pentland</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lazer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Inferring friendship network structure by using mobile phone data</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>106</volume>
          (
          <issue>36</issue>
          ),
          <fpage>15274</fpage>
          -
          <lpage>15278</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Phithakkitnukoon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dantu</surname>
          </string-name>
          , R.:
          <article-title>Inferring social groups using call logs</article-title>
          .
          <source>In: On the Move to Meaningful Internet Systems: OTM 2008 Workshops</source>
          . pp.
          <fpage>200</fpage>
          -
          <lpage>210</lpage>
          . Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Phithakkitnukoon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dantu</surname>
          </string-name>
          , R.:
          <article-title>Mobile social group sizes and scaling ratio</article-title>
          .
          <source>AI &amp; society 26(1)</source>
          ,
          <fpage>71</fpage>
          -
          <lpage>85</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Zargari</surname>
          </string-name>
          , H.:
          <article-title>Social network modelling: Retrieval correlated graphs by mobile phone's chronological billing files</article-title>
          . In: The Second International conference “Problems of Cybernetics and Informatics.” pp.
          <fpage>67</fpage>
          -
          <lpage>70</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Horak</surname>
          </string-name>
          , R.:
          <article-title>Telecommunications and Data Communications Handbook</article-title>
          . John Wiley &amp; Sons (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Acero</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Learning query intent from regularized click graphs</article-title>
          .
          <source>In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . pp.
          <fpage>339</fpage>
          -
          <lpage>346</lpage>
          . ACM (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>