Skip to main content
SpringerLink
Log in

Compressibility as a Measure of Local Coherence in Web Graphs

  • Conference paper
  • First Online:
Innovative Internet Computing Systems (IICS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2346))

Included in the following conference series:

  • 212 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Micah Adler and Michael Mitzenmacher. Towards compressing web graphs. In Proceedings of the IEEE Data Compression Conference (DCC), 2001.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Per Bak. How Nature Works: The science of self-organised criticality. Copernicus, Springer Verlag, New York, 1996.

    Google Scholar 

  4. A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 246:508–512, 1999.

    MathSciNet  Google Scholar 

  5. 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.

  6. 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.

    Article  MATH  MathSciNet  Google Scholar 

  7. Thomas A. Cover and Joy. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.

    MATH  Google Scholar 

  8. 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.

    Google Scholar 

  9. S. Grumbach and Fariza Tahi. A new challenge for compressing algorithms: Genetic sequences. Inf. Proc. and Management, 30(06):875–886, 1994.

    Article  MATH  Google Scholar 

  10. R.W. Hamming. Coding and Information Theory. Prentice-Hall, 1986. second edition.

    Google Scholar 

  11. Steve Lawrence, Kurt Bollacker, and C. Lee Giles. ResearchIndex. NEC Research Institute, http://citeseer.nj.nec.com.

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, IT-23:337–343, 1977.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Statistics, Dalhousie University, Halifax, B3H 3J5, NS, Canada

    Jeannette C. M. Janssen

  2. Dept. of Engineering Mathematics, Dalhousie University, Halifax, B3J 2X4, NS, Canada

    Nauzer Kalyaniwalla

Authors
  1. Jeannette C. M. Janssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nauzer Kalyaniwalla
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB Informatik, Universität Rostock, 18051, Rostock, Germany

    Herwig Unger

  2. Institut für Mathematik, TU Illmenau, Postfach 10 05 65, 98684, Ilmenau, Germany

    Thomas Böhme

  3. College of Art and Sciences, Department of Computer Science, University of North Texas, 76203, Denton, TX, USA

    Armin Mikler

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation