<?xml version="1.0" encoding="UTF-8"?>

<article xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.3" xml:lang="en">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher">setsci</journal-id>
   <journal-title-group>
    <journal-title>Setsci conference indexing system</journal-title>
   </journal-title-group>
   <issn>2618-6446</issn>
   <publisher>
    <publisher-name>SET Technology</publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="publisher-id">18194f9d-e99e-4d5c-9d83-2ea76fd0e771</article-id>
   <title-group>
    <article-title>Community Detection in Social Media Network with Maximum Modularity Using Girvan-Newman Algorithm</article-title>
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" corresp="yes">
     <name>
      <surname>Gündüz</surname>
      <given-names>Ali Fatih</given-names>
     </name>
     <xref ref-type="aff" rid="aff1"/>
    </contrib>
    <contrib contrib-type="author">
     <name>
      <surname>Karadoğan</surname>
      <given-names>Ahmet</given-names>
     </name>
     <xref ref-type="aff" rid="aff1"/>
    </contrib>
   </contrib-group>
   <aff id="aff1">
    <institution>İnönü University</institution>
   </aff>
   <pub-date date-type="pub">
    <day>08</day>
    <month>12</month>
    <year>2017</year>
   </pub-date>
   <volume>1</volume>
   <fpage>222</fpage>
   <lpage>225</lpage>
   <permissions>
    <copyright-statement>© 2017 SET Technology</copyright-statement>
    <copyright-year>2017</copyright-year>
    <copyright-holder>SET Technology</copyright-holder>
    <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
     <license-p>CC BY 4.0</license-p>
    </license>
   </permissions>
   <abstract>
    <p>Social networks are formed from interactions of peoples. Measuring the degree of those relationships requires interpreting connectivity of vertices and extracting information from it. Generally individuals form smaller sub-communities in those networks. Identifying those communities by determining sizes of cliques is a challenge and there are numerous solutions in the literature for this problem. In this study we reviewed Girvan-Newman community detection algorithm and applied it on a real life social network obtained from Twitter data. Friendship relations of students of four different universities were used to form the network. A connected graph is generated from this data set in which the students are represented as vertices and followership relations of the students formed the edges of the graph. Since those universities are geographically close to each other, the graph consisted of different link connections among those four clusters. Then community clusters were detected in this connected graph by using Girvan-Newman community detection algorithm</p>
   </abstract>
   <kwd-group xml:lang="en">
    <kwd>Community detection, Girvan-Newman, data mining, Twitter, social media, social network, clustering</kwd>
   </kwd-group>
   <kwd-group xml:lang="en">
    <kwd>Community detection, Girvan-Newman, data mining, Twitter, social media, social network, clustering</kwd>
   </kwd-group>
  </article-meta>
 </front>
 <back>
  <ref-list>
   <ref id="ref1">
    <mixed-citation>Hill, Russell A., and Robin IM Dunbar. &quot;Social network size in humans.&quot; Human nature 14.1 (2003): 53-72.</mixed-citation>
   </ref>
   <ref id="ref2">
    <mixed-citation>Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre, Fast unfolding of communities in large networks, in Journal of Statistical Mechanics: Theory and Experiment 2008 (10), P1000</mixed-citation>
   </ref>
   <ref id="ref3">
    <mixed-citation>M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Physical Sciences - Applied Mathematics, 2002.</mixed-citation>
   </ref>
   <ref id="ref4">
    <mixed-citation>M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, February 2004.</mixed-citation>
   </ref>
   <ref id="ref5">
    <mixed-citation>Newman M. E., Mark E. J., Girvan M., (2004), &quot;Finding and evaluating community structure in networks&quot;, Physical Review E, 69 (2), 026113.</mixed-citation>
   </ref>
   <ref id="ref6">
    <mixed-citation>M. Newman. 2006. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, vol. 103, no. 23, pp. 85778582.</mixed-citation>
   </ref>
   <ref id="ref7">
    <mixed-citation>Gunes, Ismail, and Haluk Bingol. &quot;Community detection in complex networks using agents.&quot; arXiv preprint cs/0610129 (2006).</mixed-citation>
   </ref>
   <ref id="ref8">
    <mixed-citation>Freeman, L., (1977). A set of measures of centrality based upon betweenness. In Sociometry 40:35-41.</mixed-citation>
   </ref>
   <ref id="ref9">
    <mixed-citation>Kleinfeld, Judith. &quot;Could it be a big world after all? The six degrees of separation myth.&quot; Society, April 12 (2002): 5-2.</mixed-citation>
   </ref>
   <ref id="ref10">
    <mixed-citation>Ressler, Steve. &quot;Social network analysis as an approach to combat terrorism: Past, present, and future research.&quot; Homeland Security Affairs 2.2 (2006).</mixed-citation>
   </ref>
   <ref id="ref11">
    <mixed-citation>Krebs, Valdis E. &quot;Mapping networks of terrorist cells.&quot; Connections24.3 (2002): 43-52.</mixed-citation>
   </ref>
   <ref id="ref12">
    <mixed-citation>Xu, Jennifer, and Hsinchun Chen. &quot;Criminal network analysis and visualization.&quot; Communications of the ACM 48.6 (2005): 100-107.</mixed-citation>
   </ref>
   <ref id="ref13">
    <mixed-citation>Watts, Duncan J. &quot;Networks, dynamics, and the small-world phenomenon.&quot; American Journal of sociology 105.2 (1999): 493-527.</mixed-citation>
   </ref>
   <ref id="ref14">
    <mixed-citation>de Sola Pool, Ithiel, and Manfred Kochen. &quot;Contacts and influence.&quot; Social networks 1.1 (1978): 5-51.</mixed-citation>
   </ref>
   <ref id="ref15">
    <mixed-citation>Milgram, Stanley. &quot;Six degrees of separation.&quot; Psychology Today 2 (1967): 60-64.</mixed-citation>
   </ref>
   <ref id="ref16">
    <mixed-citation>Clauset, A., Newman , M.E.J., Moore, C., (2004). Finding community structure in very large networks. In Physical Review E, 70:061111.</mixed-citation>
   </ref>
   <ref id="ref17">
    <mixed-citation>Tasgin, Mursel, Amac Herdagdelen, and Haluk Bingol. &quot;Community detection in complex networks using genetic algorithms.&quot; arXiv preprint arXiv:0711.0491 (2007).</mixed-citation>
   </ref>
   <ref id="ref18">
    <mixed-citation>Y. Atay, I. Koc, I. Babaoglu, ve H. Kodaz, “Community detection from biological and social networks: A comparative analysis of metaheuristic algorithms”, Applied Soft Computing, c. 50, ss. 194–211, Oca. 2017.</mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>
