A Topological Approach of the Web Classification

  • Gabriel Ciobanu
  • Dănuţ Rusu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4281)


In this paper we study some topological aspects related to the important operations of searching and classification over the Web. Classification is dictated by some criteria, and these criteria can be defined as a classification operator. An interesting problem is to prove the existence of a stable classification with respect to a certain operator. In this context we provide a topological approach to describe the structure of the web based on the trips given by the links of the web documents, and present various topologies defined over the Web. Some results regarding the topological properties as connectivity, density and separation are presented. The Alexandrov topology plays a particular role, and we have a certain equivalence between this topology and the classification process.


Neighbourhood Operator Topological Approach Important Operation Topological Aspect Scott Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arenas, F.G.: Alexandroff spaces. Acta Math. Univ. Comenianae LXVIII, 17–25 (1999)MathSciNetGoogle Scholar
  2. 2.
    Cech, E.: Topological Spaces. Publishing House of the Czechoslovak Academy of Sciences, Prague (1966)MATHGoogle Scholar
  3. 3.
    Ciobanu, G., Dumitriu, D.: Space and Time Over the Web. In: 12th Int’l World Wide Web Conference, Budapest. ACM, New York (2003)Google Scholar
  4. 4.
    Ciobanu, G., Rusu, D.: Topological Spaces of the Web. In: 14th Int’l World Wide Web Conference, Japan. ACM Press, New York (2005)Google Scholar
  5. 5.
    Engelking, R.: General Topology, 2nd edn. Sigma Series in Pure Mathematics, vol. 6. Heldermann (1989)Google Scholar
  6. 6.
    Kelley, J.L.: General Topology, van Nostrand (1955)Google Scholar
  7. 7.
    Scott, D.: Domains for Denotational Semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577–613. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  8. 8.
    Smyth, M.B.: Topology. In: Handbook of Logic in Computer Science, vol. 1, pp. 641–761. Oxford University Press, Oxford (1992)Google Scholar
  9. 9.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gabriel Ciobanu
    • 1
    • 2
  • Dănuţ Rusu
    • 1
    • 3
  1. 1.Institute of Computer Science, IaşiRomanian Academy 
  2. 2.Faculty of Computer Science“A.I.Cuza” University of Iaşi 
  3. 3.Faculty of Mathematics“A.I.Cuza” University of Iaşi 

Personalised recommendations