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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Micah Adler and Michael Mitzenmacher. Towards compressing web graphs. In Proceedings of the IEEE Data Compression Conference (DCC), 2001.
Yuan An, Jeannette Janssen, and Evangelos Milios. Characterizing and mining the citation graph of computer science literature. Technical Report CS-2001-02, Faculty of Computer Science, Dalhousie University, Halifax, Canada, 2001. http://www.cs.dal.ca/main/research/techreports/2001/CS-2001-02.html.
Per Bak. How Nature Works: The science of self-organised criticality. Copernicus, Springer Verlag, New York, 1996.
A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 246:508–512, 1999.
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. In WWW9, Amsterdam, 1999. http://www9.org/w9cdrom/160/160.html.
Harry Buhrman, Ming Li, John Tromp, and Paul Vitányi. Kolmogorov random graphs and the incompressibility method. SIAM J. Comput., 29(2):590–599, 1999.
Thomas A. Cover and Joy. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
S. Dill, R. Kumar, K. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. Self-similarity in the web. In Proceedings of the 27th VLDB conference, Roma, Italy, 2001.
S. Grumbach and Fariza Tahi. A new challenge for compressing algorithms: Genetic sequences. Inf. Proc. and Management, 30(06):875–886, 1994.
R.W. Hamming. Coding and Information Theory. Prentice-Hall, 1986. second edition.
Steve Lawrence, Kurt Bollacker, and C. Lee Giles. ResearchIndex. NEC Research Institute, http://citeseer.nj.nec.com.
S. Rajagopalan R. Kumar, P. Raghavan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999.
S. Rajagopalan R. Kumar, P. Raghavan, and A. Tomkins. Trawling cyber communities automatically. In Proceedings of the 8th World-wide web conference, Edinburgh, Scotland, 1999.
J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, IT-23:337–343, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janssen, J.C.M., Kalyaniwalla, N. (2002). Compressibility as a Measure of Local Coherence in Web Graphs. In: Unger, H., Böhme, T., Mikler, A. (eds) Innovative Internet Computing Systems. IICS 2002. Lecture Notes in Computer Science, vol 2346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48080-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-48080-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43790-1
Online ISBN: 978-3-540-48080-8
eBook Packages: Springer Book Archive