Social Network Problem in Enron Corpus

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Social Network Problem in Enron Corpus

Original language description

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.

Czech name

Social Network Problem in Enron Corpus

Czech description

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.

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GP201%2F05%2FP145" target="_blank" >GP201/05/P145: Special data compression methods</a><br>

Continuities

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

Publication year

2005

Confidentiality

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

Article name in the collection

ADBIS 2005

ISBN

9985-59-545-9

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

123-134

Publisher name

Tallinn Technical University

Place of publication

Tallinn

Event location

Tallin, Estonsko,

Event date

Sep 12, 2005

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—