<!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>
      <journal-title-group>
        <journal-title>MSM</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Does Size Matter? When Small is Good Enough</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A.L. Gentile?</string-name>
          <email>a.l.gentile@dcs.shef.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A.E. Cano</string-name>
          <email>a.cano@dcs.shef.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A.-S. Dadzie</string-name>
          <email>a.dadzie@dcs.shef.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V. Lanfranchi</string-name>
          <email>v.lanfranchi@dcs.shef.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>N. Ireson</string-name>
          <email>n.ireson@dcs.shef.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Sheffield</institution>
          ,
          <addr-line>Sheffield</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <volume>1</volume>
      <fpage>45</fpage>
      <lpage>56</lpage>
      <abstract>
        <p>This paper reports the observation of the influence of the size of documents on the accuracy of a defined text processing task. Our hypothesis is that based on a specific task (in this case, topic classification), results obtained using longer texts may be approximated by short texts, of micropost size, i.e., maximum length 140 characters. Using an email dataset as the main corpus, we generate several fixed-size corpora, consisting of truncated emails, from micropost size (140 characters), and successive multiples thereof, to the full size of each email. Our methodology consists of two steps: (1) corpus-driven topic extraction and (2) document topic classification. We build the topic representation model using the main corpus, through k-means clustering, with each k -derived topic represented as a weighted number of terms. We then perform document classification according to the k topics: first over the main corpus, then over each truncated corpus, and observe the variance in classification accuracy with document size. The results obtained show that the accuracy of topic classification for micropost-size texts is a suitable approximation of classification performed on longer texts.</p>
      </abstract>
      <kwd-group>
        <kwd>Short Messages</kwd>
        <kwd>Email Processing</kwd>
        <kwd>Text Processing</kwd>
        <kwd>Document classification</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The advent of social media and the widespread adoption of ubiquitous mobile
devices has changed the way people communicate: fast, short messages and real
time exchange are becoming the norm. This phenomenon was first manifested
with the introduction of SMS (Short Messaging Service) capabilities on mobile
phones. Despite the technical restrictions the size limit of 160 characters imposed,
SMS was quickly adopted by users, thanks to ease of use and very short delivery
time. The widespread adoption has had significant impact on the language used
and the way people communicate; as pointed out by Grinter and Eldridge [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],
users tend to adapt media to make themselves understood. In the case of SMS
this meant modifying language to condense as much information as possible into
160 characters.
? to whom correspondence should be addressed
      </p>
      <p>At the same time Instant messaging (IM) services such as MSN1, Yahoo2
and Jabber3 rose in popularity, offering another platform with low barrier to
entry and use, for real time, text-based chatting and communication. Newer
social media services and applications such as Twitter4 adopted this interaction
paradigm (restricting even more, messages to 140 character chunks), evolved
to support real-time communication within social networks. FourSquare5,
Facebook6 and MySpace7 posts, while using relatively longer feeds, also follow the
general trend of using small chunks of text, i.e., microposts, to carry out
(asynchronous) conversations.</p>
      <p>
        While a large amount of this information exchange is social, micropost
services are also used to exchange information in more formal (working)
environments, especially as collaboration crosses wide geographical borders, bandwidth
increases and the cost of electronic services decreases [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. Twitter, for
instance, is currently one of the most widely used methods for exchanging up to
date information about ongoing events, and topical discussion in professional and
social circles [
        <xref ref-type="bibr" rid="ref23 ref25">23, 25</xref>
        ]. However, while the usage of Twitter and similar services
in the workplace is increasing, it is sometimes perceived negatively, as they may
be seen to reduce productivity [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], and/or pose threats to security and privacy.
      </p>
      <p>
        The impact of text-based SMS and IM has however been such that where
restrictions to use are in place, alternatives are sought that obtain the same
benefits. Individuals in such environments often adopt the same communication
patterns in alternative media, e.g., both desktop-based and mobile email usage
often follow the same pattern. Further, empirical evidence suggests that even
where IM and social media services are available, individuals may employ email
as a short message service for communication via, e.g., mailing lists. This is often
done in order to reach a wider audience that includes both the initiator’s personal
networks and other individuals with shared interests and who may be potential
sources of expertise. Because mailing lists are in essence based on communities of
practice (CoPs) with shared, specialised interests [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], both detailed and quick,
short requests posted to mailing lists tend to receive quick replies from colleagues
and more distantly related members of a network or CoP. Such email exchanges
converge to a rapidly evolving conversation composed of short chunks of text.
      </p>
      <p>The aim of this paper is twofold. We first consider a corpus of emails
exchanged via an internal mailing list (over a period of six months), and perform
statistical analysis to determine if email is indeed used as a short messaging
service. Secondly, we analyse the content of emails as microposts, to evaluate to
what degree the knowledge content of truncated or abbreviated messages can be
compared to the complete message. Further, we wish to determine if the
knowl1 http://explore.live.com/windows-live-messenger
2 http://messenger.yahoo.com
3 http://www.jabber.org
4 http://twitter.com
5 http://foursquare.com
6 http://www.facebook.com
7 http://www.myspace.com
edge content of short emails may be used to obtain useful information about
e.g., topics of interest or expertise within an organisation, as a basis for carrying
out tasks such as expert finding or content-based social network analysis (SNA).</p>
      <p>We continue the paper with a review of the state of the art in section 2. We
then describe, in section 3, the corpus we employ, followed by our experimental
methodology (section 4) and the results of the text classification experiments
used to extract and compare the knowledge content of different size emails
(sections 5.1 and 5.2). We conclude the paper in section 6, and discuss briefly the
next stages of our research.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Expertise identification and knowledge elicitation, key components of
effectiveness and competitiveness in formal organisations, are often achieved via informal
networks or CoPs [
        <xref ref-type="bibr" rid="ref20 ref5">5, 20</xref>
        ]. Email is a common tool for quick exchange of
information between individuals and within groups, both on a social basis, but especially
also in formal organisations, both for co-located and dispersed communication
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Email content, and addressee and recipient, often provide clues about the
existence of CoPs and the interests and expertise of participants [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Quantitative data from email traffic (e.g. frequency of exchange) is useful in inferring
social networks, and mining email content complements this by supporting the
exploration and retrieval of organisational knowledge and expertise.
Exchange Frequency In the panorama of work on extracting social networks
from email, the frequency of email exchange has been widely used as the main
indicator of relevance of a connection. In some cases the effort is on
determining frequency thresholds [
        <xref ref-type="bibr" rid="ref1 ref24 ref3 ref7">24, 7, 1, 3</xref>
        ], while in others time-dependent threshold
conditions are defined to detect dynamic networks [
        <xref ref-type="bibr" rid="ref15 ref4">4, 15</xref>
        ]. Diesner et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
construct a social network via weighted edges over a classical dataset, the Enron
corpus8, a large set of email messages made public during the legal investigation
of the Enron corporation. They reported the emergence of communication
subgroups with unusually high email exchange in the period prior to the company
becoming insolvent in 2001, when email was a key tool for obtaining information
especially across formal, inter-organisational boundaries. Diesner et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] also
observed that variations in patterns of email usage were influenced by knowledge
about and reputation of, in addition to, formal roles within the organisation.
Content-Based Analysis Email content analysis has been used for different
purposes: determining expertise [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], analysing the relations between content
and people involved in email exchange [
        <xref ref-type="bibr" rid="ref12 ref17 ref2 ref26">2, 12, 17, 26</xref>
        ], or simply extracting useful
information about names, addresses, phone numbers [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Schwartz et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
derived expertise and common interests within communities from email exchange.
While acknowledging the value of the results obtained, Schwartz et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] note
the risk to privacy in mining emails.
      </p>
      <sec id="sec-2-1">
        <title>8 http://www.cs.cmu.edu/~enron</title>
        <p>
          Campbell et al. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] exploit addressee and recipient information, in addition
to information obtained from clusters of emails created through supervised and
unsupervised keyword extraction, to create networks of expertise. McCallum et
al. [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] recognise the contribution of Machine Learning (ML) and Natural
Language Processing (NLP) to SNA, in order to retrieve the rich knowledge content
of the information exchanged in such networks, and better interpret the
attributes of nodes and the types of relationships between them. By running their
experiments on the Enron email dataset and that of an employee in a research
institution, [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] highlight a phenomenon that is becoming increasingly common
– the blurring of the lines between inter-communication on purely professional
and social levels. This underlines the importance of the analysis of the content
of email documents in the derivation and verification of roles (a significant
attribute of nodes) and relationships within communication networks, when used
for expertise determination or topic extraction, for instance.
        </p>
        <p>
          Keila et al. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] investigate the use of domain-specific terms and the
relationships between these and roles or activity in organisations, using the Enron
email dataset. They conclude that e-mail structure and content is influenced by
users’ overall activity, e.g., when engaged in unusual activities. They, as do [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ],
who reported the emergence of communication sub-groups, observed alterations
in patterns in email usage in the lead up to the failure of Enron, with
similarity influenced by organisational roles. Zhou et al. [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] perform textual analysis
of the Enron dataset to discover useful patterns for clustering in a social
network. They found that individuals communicate more frequently with others
who share similar value patterns than with those exhibiting different ones. They
however could not draw definite conclusions about whether or not individuals
who communicate more frequently with each other share similar value patterns.
        </p>
        <p>
          Laclavík et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] observe that enterprise users largely exploit emails to
communicate, collaborate and carry out business tasks. They design a pattern-based
approach to information extraction (IE) from and analysis of enterprise email
communication, and exploit the data obtained to create social networks. The
test sets (one in English containing 28 emails, and a second in Spanish with 50)
consist of mainly formal emails exchanged between different enterprises. Their
experimental design follows the classic IE approach: they automatically extract
information such as names, telephone numbers and addresses from the email
corpus, and compare results against a gold standard, the same email corpus,
manually annotated. The results obtained indicate that emails are a valid means
for obtaining information across formal, inter-organisational boundaries.
        </p>
        <p>
          The work we present in this paper, on the other hand, makes use of a test
set containing more informal email exchange in an internal mailing list for an
academic research group, for a pilot, exploratory set of experiments. Rather than
carrying out a classic IE evaluation task, we wish to determine if relatively short
and informal texts can be used to aid the understanding of the content of the
conversations carried out via email, and depict the variety of topics discussed
using this communication medium.
Corpora The Enron corpus is a preferred test set in this field. The original
corpus contains 619,446 messages belonging to 158 users, but [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], among others,
suggest that cleaning is needed, for a number of reasons, including the fact that
some of the folders are computer-generated (such as “discussion threads” and
“notes inbox”), others contain duplicate email messages (such as the folder “all
document”), and yet others constitute delivery failures and repeated attempts
to deliver the same message.
        </p>
        <p>
          Depending on the task being performed, accurate cleaning is required to avoid
misleading results; [
          <xref ref-type="bibr" rid="ref12 ref17 ref6">6, 12, 17</xref>
          ] all perform cleaning and merging of data to increase
the accuracy and reliability of the results of analysis. While the Enron corpus is
valued as a widely available test set that aids replication of experiments in the
field, we do not use it at this stage in our research. The main reason for this is
that our experiments currently examine the usage of email as a tool for sharing
information within a fixed community, as an alternative to social publishing
services, and explore phenomena observed in such environments. The internal
mailing list we use as a starting test set meets this requirement. A statistical
analysis of our corpus is provided in section 3.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Email Corpus</title>
      <p>The corpus used for analysis and knowledge content extraction is an internal
mailing list of the OAK Group9 in the Computer Science Department of the
University of Sheffield. The mailing list is used for quick exchange of information
within the group on both professional and social topics.</p>
      <p>We use all emails sent to the mailing list in the six month period from July
2010 to January 2011, totalling 659 emails. For each we extracted the email
body: the average length of which is 351 characters (just shorter than 2.5
microposts), with a standard deviation of 577 characters. We refer to this corpus
as mainCorpus. Detailed statistics on document length are shown in Fig. 1.
The percentage of messages of micropost size (up to 140 characters) constitutes
more than 35% of the whole corpus. Considering emails up to two micropost
sizes increases the percentage to ∼65%. Very few emails (around 4%) are really
long (above 1000 characters).</p>
      <p>These statistics indicate that the corpus largely consists of micro-emails –
which we define as short email messages exchanged in rapid succession about a
topic. We carried out a number of experiments on this corpus, to understand
the knowledge content of the (micro-)emails. Future work will consider how this
corpus varies from other email corpora of the same type (mailing lists) and what
generic assumptions could be made about the existence and use of micro-emails.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Dynamic Topic Classification Of Short Texts</title>
      <p>One of our main goals is to evaluate to what degree the knowledge content of
a shorter message can be compared to that of a full message. Our hypothesis</p>
      <sec id="sec-4-1">
        <title>9 http://oak.dcs.shef.ac.uk</title>
        <p>is that based on a specific task, results obtained using short texts of micropost
size approximate results obtainable with longer texts. The task chosen for the
evaluation is text classification on non-predefined topics. The test bed is
generated by preprocessing the email corpus (see section 3) to obtain several fixed-size
corpora, as detailed in section 5.1. The overall method consists of two steps:
corpus-driven topic extraction: a number of topics are automatically
extracted from a document collection; each topic is represented as a weighted
vector of terms;
document topic classification: each document is labelled with the topic it is
most similar to, and classified into the corresponding cluster.
4.1</p>
        <sec id="sec-4-1-1">
          <title>Topic Extraction: Proximity-based Clustering</title>
          <p>
            Given a document corpus D, we represent it using a vector space model; each
document in the corpus d = {t1, ..., tv} is represented as a vector of weighted
terms (using tf-idf weights). Using an inverted index of the documents we
generate clusters of terms. Each cluster in C = {C1, ..., Ck} is represented as a
weighted vector of terms Ck = {t1, ..., tn}, selecting n terms t for each cluster
with highest tf-idf weight. Each cluster ideally represents a topic in the
document collection. To obtain the clusters we apply a K-Means algorithm [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ], using
as feature space the generated inverted index of document terms (i.e., for each
term we define which document contains it). Starting with k random means
(centroids), each vector is assigned to the nearest centroid. By minimising the
euclidean distance between each point and the centroids the process is repeated
until convergence is reached.
          </p>
        </sec>
        <sec id="sec-4-1-2">
          <title>Email Topic Classification</title>
          <p>We then use cosine similarity to determine similarity between documents and
clusters; we will explore further, in the next stage of our research, alternative
similarity functions and their impact on the results obtained. For each document
we calculate the similarity sim(d, Ci) with each cluster. The labelling process
labelDoc : D → C consists of mapping each document d to the topic Ci, which
maximises the similarity sim(d, Ci). The complete procedure is shown in Fig. 2.
labelDoc procedure
Input : Collection of documents d1, ..., d|D| , set of clusters C = {C1, ..., Ck},
term representation for each cluster Ck = {t1, ..., tn}
Step 0: Obtain a document di’s feature vector, of tf-idf weighted terms.
Step 1: Apply cosine similarity between a document di’s feature vector and the k
clusters and generates a vector of similarities Si = {Si0, ..Sik}, Sij = sim(di, Cj).
Step 2: Label di with the highest weighted cluster in Si.</p>
          <p>Output : All classified documents.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <sec id="sec-5-1">
        <title>Dataset Preparation</title>
        <p>
          In this experiment we artificially generate comparable corpora starting from the
mailing list described in Section 3. The notions of comparable corpora and the
strongly related alternative, parallel corpora, are very common in multi-language
IE. Parallel text corpora contain the same documents with different content
representation. An example is parallel language resources [
          <xref ref-type="bibr" rid="ref19 ref27">19, 27</xref>
          ], where a corpus
consists of a set of documents, each of which is an exact translation of the
original document in a different language. Comparable corpora [
          <xref ref-type="bibr" rid="ref13 ref21">21, 13</xref>
          ], however, do
not contain document-level or sentence-level alignment across corpora, but talk
about the same important facts. An example of comparable corpora for different
languages is the multi-lingual Wikipedia [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], where the same articles are
available in different languages, but which are not necessarily literal translations of
each other, e.g., an article may be richer in one language than in another.
        </p>
        <p>We produce comparable corpora using the following process: starting form
mainCorpus we generate different corpora, each containing documents of fixed
maximum length, by chunking the email body in multiples of 140 characters. We
generated 8 comparable corpora, as shown in Table 1.
As described in section 4, the set of topics for categorising the initial documents
is not predefined, but corpus-driven. We use the mainCorpus for topic
extraction. Since the k in the k-means clustering approach must be approximated, we
repeated the clustering process several times. We applied the procedure labelDoc
over the mainCorpus, varying each time the input clusters, from 3 to 15. The
cardinality of clusters providing the widest distribution of classified documents
on mainCorpus was 10; we therefore selected this as the optimal number of
clusters for the final experiment on document classification. The main keywords
in each cluster are shown in Fig. 3.</p>
        <p>Using the 10 clusters obtained from the main corpus, we apply the labelDoc
procedure to the different comparable corpora, including mainCorpus. Results
obtained for the classification of mainCorpus are considered as the gold
standard, and used for comparing results of all the other corpora.
5.3</p>
      </sec>
      <sec id="sec-5-2">
        <title>Results and Discussion</title>
        <p>We evaluate the performance of the topic classification using standard Precision
(P), Recall (R) and F-Measure (F). Given the number of classes for classification
(10) we calculate P, R, and F by micro-averaging results on the classification
confusion matrix. Results for all text size corpora are shown in Table 2.</p>
        <p>As expected, it is recall rather than precision with a bigger decrease as text
length is reduced. If we relax the limitation of 140 characters and consider the
next size corpus (280) the drop in performance is much lower.</p>
        <p>Considering the results obtained for mainCorpus as the upper boundary for
classification, the trend of F-Measure over the different size corpora in Fig. 4
shows the impact of using shorter texts for topic classification. As expected, the
trend increases monotonically with the size of texts, which means that reducing
the text size directly affects the classification performance. What is interesting
is that the performance is not significantly affected by reduction in text size.</p>
        <p>At one micropost size there is a drop in F-Measure, to 74%. However with
an increase to only two micropost sizes this improves significantly, to 90%. The
larger drop at one micropost size may be explained by the method of truncation
we use; among others, where a greeting exists this takes up a fair portion of the
first micropost block. We are currently exploring the use of a sliding window to
determine how best to chunk the e-mail content and identify the most salient
region(s) of each, as a way of improving recall.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>We have presented in this paper exploratory work on the usage of email as a
substitute for online social publishing services. We explore how this kind of data
may be exploited for the knowledge discovery process and how document size
influences the accuracy of a defined text processing task. Our results show:
1. that a fair portion of the emails exchanged, for the corpus generated from
a mailing list, are very short, with more than 35% falling within the single
micropost size, and ∼65% up to two microposts;
2. for the text classification task described, that the accuracy of classification
for micropost size texts is an acceptable approximation of classification
performed on longer texts, with a decrease of only ∼ 5% for up to the second
micropost block within a long e-mail.</p>
      <p>
        These results are indicative of the convenience in communication using
microposts in different environments and for different purposes. Because the research
at this stage is still exploratory we refrain from generalising to other datasets.
However, our test corpus, which contains emails talking about both formal work
and social activities, is not atypical in the workplace (see, for instance, [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]).
We therefore believe that this work does provide a starting point from which to
carry out more extensive analysis, using other standard email corpora such as the
Enron corpus, in addition to other enterprise mailing lists similar to the corpus
we analyse in this paper. This will allow us to explore what generic assumptions
could be made on the creation and use of micro-emails.
      </p>
      <p>A second hypothesis we wish to examine is whether enriching the
microemails with semantic information (e.g., concepts extracted from domain and
standard ontologies) would improve the results obtained using unannotated text.
We also plan to investigate the influence of other similarity measures.</p>
      <p>One area we wish to explore more fully is the application to expert finding
tasks, exploiting dynamic topic extraction as a means to determine authors’
and recipients’ areas of expertise. For this purpose a formal evaluation of topic
validity will be required, including the human (expert) annotator in the loop.
Acknowledgements A.L Gentile and V. Lanfranchi are funded by the Siloet
project. A.E. Cano is funded by CONACyT, grant 175203. A.-S. Dadzie is funded
by SmartProducts (EC FP7-231204). A.L. Gentile, A.-S. Dadzie, V. Lanfranchi
and N. Ireson are also funded by WeKnowIt (EC FP7-215453).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>L.</given-names>
            <surname>Adamic</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Adar</surname>
          </string-name>
          .
          <article-title>How to search a social network</article-title>
          .
          <source>Social Networks</source>
          ,
          <volume>27</volume>
          (
          <issue>3</issue>
          ):
          <fpage>187</fpage>
          -
          <lpage>203</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Campbell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. P.</given-names>
            <surname>Maglio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cozzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Dom</surname>
          </string-name>
          .
          <article-title>Expertise identification using email communications</article-title>
          .
          <source>In CIKM '03: 12th international conference on Information and knowledge management</source>
          , pages
          <fpage>528</fpage>
          -
          <lpage>531</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>M. D. Choudhury</surname>
            ,
            <given-names>W. A.</given-names>
          </string-name>
          <string-name>
            <surname>Mason</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          <string-name>
            <surname>Hofman</surname>
            , and
            <given-names>D. J.</given-names>
          </string-name>
          <string-name>
            <surname>Watts</surname>
          </string-name>
          .
          <article-title>Inferring relevant social networks from interpersonal communication</article-title>
          . In M. Rappa et al., editors,
          <source>Proc., 19th International Conference on World Wide Web</source>
          , pages
          <fpage>301</fpage>
          -
          <lpage>310</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>C.</given-names>
            <surname>Cortes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pregibon</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Volinsky</surname>
          </string-name>
          .
          <article-title>Computational methods for dynamic graphs</article-title>
          .
          <source>Journal Of Computational And Graphical Statistics</source>
          ,
          <volume>12</volume>
          :
          <fpage>950</fpage>
          -
          <lpage>970</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Culotta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bekkerman</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          .
          <article-title>Extracting social networks and contact information from email and the web</article-title>
          .
          <source>In CEAS 2004: Proc., 1st Conference on Email and Anti-Spam</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>J.</given-names>
            <surname>Diesner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Frantz</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K. M.</given-names>
            <surname>Carley</surname>
          </string-name>
          .
          <article-title>Communication networks from the Enron email corpus “It's Always About the People</article-title>
          .
          <article-title>Enron is no Different”</article-title>
          .
          <source>Compututational &amp; Mathematical Organanization Theory</source>
          ,
          <volume>11</volume>
          (
          <issue>3</issue>
          ):
          <fpage>201</fpage>
          -
          <lpage>228</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J.</given-names>
            <surname>Eckmann</surname>
          </string-name>
          , E. Moses, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Sergi</surname>
          </string-name>
          .
          <article-title>Entropy of dialogues creates coherent structures in e-mail traffic</article-title>
          .
          <source>Proceedings of the National Academy of Sciences of the United States of America</source>
          ,
          <volume>101</volume>
          (
          <issue>40</issue>
          ):
          <fpage>14333</fpage>
          -
          <lpage>14337</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Grinter</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Eldridge</surname>
          </string-name>
          .
          <article-title>y do tngrs luv 2 txt msg</article-title>
          ?
          <source>In Proc., 7th European Conference on Computer Supported Cooperative Work</source>
          , pages
          <fpage>219</fpage>
          -
          <lpage>238</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>J. Hartigan. Clustering</given-names>
            <surname>Algorithms</surname>
          </string-name>
          . John Wiley and Sons, New York,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>J. D. Herbsleb</surname>
            ,
            <given-names>D. L.</given-names>
          </string-name>
          <string-name>
            <surname>Atkins</surname>
            ,
            <given-names>D. G.</given-names>
          </string-name>
          <string-name>
            <surname>Boyer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Handel</surname>
            , and
            <given-names>T. A.</given-names>
          </string-name>
          <string-name>
            <surname>Finholt</surname>
          </string-name>
          .
          <article-title>Introducing instant messaging and chat in the workplace</article-title>
          .
          <source>In Proc., SIGCHI conference on Human factors in computing systems</source>
          , pages
          <fpage>171</fpage>
          -
          <lpage>178</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. E.
          <string-name>
            <surname>Isaacs</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Walendowski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Whittaker</surname>
            ,
            <given-names>D. J.</given-names>
          </string-name>
          <string-name>
            <surname>Schiano</surname>
            , and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Kamm</surname>
          </string-name>
          .
          <article-title>The character, functions, and styles of instant messaging in the workplace</article-title>
          .
          <source>In Proc., ACM conference on Computer supported cooperative work</source>
          , pages
          <fpage>11</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Keila</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. B.</given-names>
            <surname>Skillicorn</surname>
          </string-name>
          .
          <article-title>Structure in the Enron email dataset</article-title>
          .
          <source>Computational &amp; Mathematical Organization Theory</source>
          ,
          <volume>11</volume>
          :
          <fpage>183</fpage>
          -
          <lpage>199</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>A.</given-names>
            <surname>Klementiev</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          .
          <article-title>Named entity transliteration and discovery from multilingual comparable corpora</article-title>
          .
          <source>In Proc., main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics</source>
          , pages
          <fpage>82</fpage>
          -
          <lpage>88</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>B.</given-names>
            <surname>Klimt</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          .
          <article-title>The Enron corpus: A new dataset for email classification research</article-title>
          . In J.-
          <string-name>
            <given-names>F.</given-names>
            <surname>Boulicaut</surname>
          </string-name>
          et al., editors,
          <source>ECML 2004: Proc., 15th European Conference on Machine Learning</source>
          , pages
          <fpage>217</fpage>
          -
          <lpage>226</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>G.</given-names>
            <surname>Kossinets</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Watts</surname>
          </string-name>
          .
          <article-title>Empirical analysis of an evolving social network</article-title>
          .
          <source>Science</source>
          ,
          <volume>311</volume>
          (
          <issue>5757</issue>
          ):
          <fpage>88</fpage>
          -
          <lpage>90</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>M. Laclavik</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Dlugolinsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Seleng</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kvassay</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Gatial</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Balogh</surname>
            , and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Hluchy</surname>
          </string-name>
          .
          <article-title>Email analysis and information extraction for enterprise benefit. Computing and Informatics, Special Issue on Business Collaboration Support for micro, small, and medium-sized Enterprises</article-title>
          ,
          <volume>30</volume>
          (
          <issue>1</issue>
          ):
          <fpage>57</fpage>
          -
          <lpage>87</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>A. McCallum</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            , and
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Corrada-Emmanuel</surname>
          </string-name>
          .
          <article-title>Topic and role discovery in social networks with experiments on Enron and academic email</article-title>
          .
          <source>Journal of Artificial Intelligence Research</source>
          ,
          <volume>30</volume>
          :
          <fpage>249</fpage>
          -
          <lpage>272</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>A. E. Richman</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Schone</surname>
            , and
            <given-names>F. G. G.</given-names>
          </string-name>
          <string-name>
            <surname>Meade</surname>
          </string-name>
          .
          <article-title>Mining wiki resources for multilingual named entity recognition</article-title>
          .
          <source>Computational Linguistics</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. E. Riloff,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schafer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Yarowsky</surname>
          </string-name>
          .
          <article-title>Inducing information extraction systems for new languages via cross-language projection</article-title>
          .
          <source>In COLING '02: Proc., 19th international conference on Computational linguistics</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>M. F. Schwartz</surname>
            and
            <given-names>D. C. M.</given-names>
          </string-name>
          <string-name>
            <surname>Wood</surname>
          </string-name>
          .
          <article-title>Discovering shared interests using graph analysis</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>36</volume>
          (
          <issue>8</issue>
          ):
          <fpage>78</fpage>
          -
          <lpage>89</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>R.</given-names>
            <surname>Sproat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Named entity transliteration with comparable corpora</article-title>
          .
          <source>In Proc., 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>73</fpage>
          -
          <lpage>80</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. TNS US Group.
          <article-title>Social media exploding: More than 40% use online social networks</article-title>
          . http://www.tns-us.com/news/social_media_exploding_more_than.php,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. T. Turner,
          <string-name>
            <given-names>P.</given-names>
            <surname>Qvarfordt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Biehl</surname>
          </string-name>
          , G. Golovchinsky, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Back</surname>
          </string-name>
          .
          <article-title>Exploring the workplace communication ecology</article-title>
          .
          <source>In CHI '10: Proc., 28th international conference on Human factors in computing systems</source>
          , pages
          <fpage>841</fpage>
          -
          <lpage>850</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>J. Tyler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Wilkinson</surname>
            , and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Huberman</surname>
          </string-name>
          .
          <article-title>E-Mail as spectroscopy: Automated discovery of community structure within organizations</article-title>
          .
          <source>The Information Society</source>
          ,
          <volume>21</volume>
          (
          <issue>2</issue>
          ):
          <fpage>143</fpage>
          -
          <lpage>153</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cody</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <article-title>A case study of micro-blogging in the enterprise: use, value, and related issues</article-title>
          .
          <source>In CHI '10: Proc., 28th international conference on Human factors in computing systems</source>
          , pages
          <fpage>123</fpage>
          -
          <lpage>132</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Fleischmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W. A.</given-names>
            <surname>Wallace</surname>
          </string-name>
          .
          <article-title>Automatic text analysis of values in the Enron email dataset: Clustering a social network using the value patterns of actors</article-title>
          .
          <source>In HICSS 2010: Proc., 43rd Annual Hawaii International Conference on System Sciences</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27. I. Zitouni and
          <string-name>
            <given-names>R.</given-names>
            <surname>Florian</surname>
          </string-name>
          .
          <article-title>Cross-language information propagation for arabic mention detection</article-title>
          .
          <source>ACM Transactions on Asian Language Information Processing</source>
          ,
          <volume>8</volume>
          :
          <issue>17</issue>
          :
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          :
          <fpage>21</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>