This paper focuses on finding maximum rooted spanning trees (MRSTs) for structured web search including hop constraints. We describe the meaning of structured web search and develop two binary integer linear programming models to find the best MRST. New methods for measuring the relevance among web objects are devised and used for structured web search. Some case studies are performed with real web sites and results are reported.


Span Tree Root Node Directed Graph Terminal Node PageRank Algorithm 
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.
    Barabasi, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Physica A 281, 69–77 (2000)CrossRefGoogle Scholar
  2. 2.
    Bharat, K., Chang, B.W., Henzinger, M.R., Ruhl, M.: Who Links to Whom: Mining Linkage between Web Sites. In: Proc. ICDM 2001, pp. 51–58 (2001)Google Scholar
  3. 3.
    Eiron, N., McCurley, K., Tomlin, J.: Ranking the web frontier. In: Proc. WWW 2004, pp. 309–318 (2004)Google Scholar
  4. 4.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. In: Proc. SIGCOMM 1999, pp. 251–262 (1999)Google Scholar
  5. 5.
    Garofalakis, J., Kappos, P., Mourloukos, D.: Web Site Optimization Using Page Popularity. IEEE Internet Computing 3(4), 22–29 (1999)CrossRefGoogle Scholar
  6. 6.
    Gyongyi, Z., Garcia-Molina, H., Pedersen, J.: Combating Web Spam with TrustRank. In: VLDB, pp. 576–587 (2004)Google Scholar
  7. 7.
    Henzinger, M.R., Heydon, A., Mitzenmacher, M., Najork, M.: On Near-uniform URL Sampling. Computer Networks 33(1), 295–308 (2000)CrossRefGoogle Scholar
  8. 8.
    Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)CrossRefMathSciNetMATHGoogle Scholar
  9. 9.
    Lee, W.: Hierarchical Web Structuring from the Web as a Graph Approach with Repetitive Cycle Proof. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds.) APWeb Workshops 2006. LNCS, vol. 3842, pp. 1004–1011. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Lee, Wookey, Geller, J.: Semantic Hierarchical Abstraction of Web Site Structures for Web Searchers. Journal of Res. Practice in Information Technology 36(1), 71–82 (2004)Google Scholar
  11. 11.
    Lee, W., Kim, S., Kang, S.: Structuring Web Sites Using Linear Programming. In: Bauknecht, K., Bichler, M., Pröll, B. (eds.) EC-Web 2004. LNCS, vol. 3182, pp. 328–337. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Lerman, K., Getoor, L., Minton, S., Knoblock, C.: Using the Structure of Web Sites for Automatic Segmentation of Tables. In: Proc. SIGMOD 2004, pp. 119–130 (2004)Google Scholar
  13. 13.
    Najork, M., Wiener, J.: Breadth-first Crawling Yields High-quality Pages. In: Proc. WWW 2001, pp. 114–118 (2001)Google Scholar
  14. 14.
    Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to Characterize Web Structure. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 330–339. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wookey Lee
    • 1
  • Seungkil Lim
    • 2
  1. 1.Dept. of Industrial EngineeringInha UniversityIncheon-cityKorea
  2. 2.Division of e-business ITSungkyul UniversityAnyang-city, Kyunggi-DoKorea

Personalised recommendations