Scatter networks: A new approach for analysing information scatter

Lada A. Adamic, Suresh Bhavnani, Xiaolin Shi

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages.

Original languageEnglish (US)
Article number231
JournalNew Journal of Physics
Volume9
DOIs
StatePublished - Jul 17 2007
Externally publishedYes

Fingerprint

network analysis
regularity
apexes
projection

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Scatter networks : A new approach for analysing information scatter. / Adamic, Lada A.; Bhavnani, Suresh; Shi, Xiaolin.

In: New Journal of Physics, Vol. 9, 231, 17.07.2007.

Research output: Contribution to journalArticle

@article{fc4a47728ba542179adbb61792996bdf,
title = "Scatter networks: A new approach for analysing information scatter",
abstract = "Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages.",
author = "Adamic, {Lada A.} and Suresh Bhavnani and Xiaolin Shi",
year = "2007",
month = "7",
day = "17",
doi = "10.1088/1367-2630/9/7/231",
language = "English (US)",
volume = "9",
journal = "New Journal of Physics",
issn = "1367-2630",
publisher = "IOP Publishing Ltd.",

}

TY - JOUR

T1 - Scatter networks

T2 - A new approach for analysing information scatter

AU - Adamic, Lada A.

AU - Bhavnani, Suresh

AU - Shi, Xiaolin

PY - 2007/7/17

Y1 - 2007/7/17

N2 - Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages.

AB - Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages.

UR - http://www.scopus.com/inward/record.url?scp=34547186407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547186407&partnerID=8YFLogxK

U2 - 10.1088/1367-2630/9/7/231

DO - 10.1088/1367-2630/9/7/231

M3 - Article

AN - SCOPUS:34547186407

VL - 9

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

M1 - 231

ER -