Social Network Problem in Enron Corpus

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012188" target="_blank" >RIV/61989100:27240/05:00012188 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Social Network Problem in Enron Corpus

Popis výsledku v původním jazyce

Traditional communication barriers are disappearing due to expansion of electronic communication devices. Forming of communities doesn't depend only on handshaking or sending a letter to other person. Modern communication devices give rise to originatingof new types of communities without necessity of their geographical proximity. Fast communication brings disadvantages connected with determining of communities. The question is, if there are methods, how to identify particular communities or how to identify topics of their communication. Members of community can be represented by vertices and communication channels by edges. The whole problem can be solved using graph theory and information retrieval methods. In our paper we describe method, how to identify these communities, based on searching of 2-connected components in social nets. Communication topics can be specified using clustering methods. To demonstrate our approach we use the Enron corpus.

Název v anglickém jazyce

Social Network Problem in Enron Corpus

Popis výsledku anglicky

Traditional communication barriers are disappearing due to expansion of electronic communication devices. Forming of communities doesn't depend only on handshaking or sending a letter to other person. Modern communication devices give rise to originatingof new types of communities without necessity of their geographical proximity. Fast communication brings disadvantages connected with determining of communities. The question is, if there are methods, how to identify particular communities or how to identify topics of their communication. Members of community can be represented by vertices and communication channels by edges. The whole problem can be solved using graph theory and information retrieval methods. In our paper we describe method, how to identify these communities, based on searching of 2-connected components in social nets. Communication topics can be specified using clustering methods. To demonstrate our approach we use the Enron corpus.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP201%2F05%2FP145" target="_blank" >GP201/05/P145: Speciální metody komprese dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2005

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

ADBIS 2005

ISBN

9985-59-545-9

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

123-134

Název nakladatele

Tallinn Technical University

Místo vydání

Tallinn

Místo konání akce

Tallin, Estonsko,

Datum konání akce

12. 9. 2005

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—