Compressibility as a Measure of Local Coherence in Web Graphs

Authors:
Jeannette Janssen;Nauzer Kalyaniwalla
Affiliations:
-;-
Venue:
IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems
Year:
2002

Citing 8
Cited 0

Coding and information theory (2nd ed.)

Coding and information theory (2nd ed.)
Elements of information theory

Elements of information theory
A new challenge for compression algorithms: genetic sequences

Information Processing and Management: an International Journal - Special issue: data compression
Kolmogorov Random Graphs and the Incompressibility Method

SIAM Journal on Computing
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Extracting Large-Scale Knowledge Bases from the Web

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Self-similarity in the Web

Proceedings of the 27th International Conference on Very Large Data Bases
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A networked information space is a collection of information entities connected by links. In this paper, we propose a method to determine if a given subset of a networked information space is randomly chosen or thematically unified, based solely on the link structure of the subset. The proposed method uses compressibility as a measure of the link structure. The method is illustrated with an example.