Journal article Open Access

Cultural scene detection using reverse Louvain optimization

Hamdaqa, Mohammad; Tahvildari, Ladan; LaChapelle, Neil; Campbell, Brian

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Other (Open)</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2014-12-01</subfield>
  <controlfield tag="005">20200120164002.0</controlfield>
  <controlfield tag="001">889712</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o"></subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This paper proposes a novel approach for discovering cultural scenes in social network data. "Cultural scenes" are aggregations of people with overlapping interests, whose loosely interacting activities form virtuous cycles that amplify cultural output (e.g., New York art scene, Silicon Valley startup scene, Seattle indie music scene). They are defined by time, place, topics, people and values. The positive socioeconomic impact of scenes draws public and private sector support to them. They could also become the focus for new digital services that fit their dynamics; but their loose, multidimensional nature makes it hard to determine their boundaries and community structure using standard social network analysis procedures. In this paper, we: (1) propose an ontology for representing cultural scenes, (2) map a dataset to the ontology, and (3) compare two methods for detecting scenes in the dataset. Method One takes a hard clustering approach. We derive three weighted, undirected graphs from three similarity analyses; linking people by topics, topics by people, and places by people. We partition each graph using Louvain optimization, overlap them, and let their inner join represent core scene elements. Method Two introduces a novel soft clustering approach. We create a "scene graph": a single, unweighted, directed graph including all three node classes (people, place, topic). We devise a new way to apply Louvain optimization to such a graph, and use filtering and fan-in/out analysis to identify the core. Both methods detect core clusters with precision, but the first method misses some peripherals. Method Two evinces better recall, advancing our knowledge about how to represent and analyse scenes. We use Louvain optimization recursively and in reverse to successfully find small clusters.</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Tahvildari, Ladan</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-9224-9836</subfield>
    <subfield code="a">LaChapelle, Neil</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Campbell, Brian</subfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">4420371</subfield>
    <subfield code="z">md5:690995c55e28627ed2a17697cac55648</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Hamdaqa, Mohammad</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1016/j.scico.2014.01.006</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Cultural scene detection using reverse Louvain optimization</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
Views 349
Downloads 200
Data volume 884.1 MB
Unique views 330
Unique downloads 190


Cite as