%Original file available from http://www.cs.odu.edu/~jbollen/bibliographies/bibtex/IR_WWW.bib %Last update: Friday 8 July 2005 %Current number of entries: 16 @INPROCEEDINGS{entrop:hungyu2002, title = {Entropy-based link analysis for mining web informative structures}, author = {Hung-Yu Kao and Shian-Hua Kao and Jan-Ming Ho and Ming-Syan Chen}, year = 2002, booktitle = {Proceedings of the 11th {I}nternational {C}onference on {I}nformation and {K}nowledge {M}anagement ({CIKM}02)}, month = {November}, address = {McLean, VA}, pages = {574--581} } @ARTICLE{comput:cercone2002, author = {N. Cercone and L. J. Hou and V. Keselj and A.J. An and K. Naruedomkul and X.H. Hu}, title = {From computational intelligence to Web intelligence}, year = 2002, journal = {Computer}, volume = 35, number = 11, pages = {72 -- 76}, abstract = {The authors explore three topics in computational intelligence-machine translation, machine learning, and user interface design-and speculate on their effects on Web intelligence.}, } @misc{common:luotonen1995, author = {A. Luotonen}, title = {The Common Logfile Format}, year = 1995, howpublished = {http://www.w3.org/pub/WWW/Daemon/User/Config/Logging.html}, } @ARTICLE{effic:cho1998, author = {Junghoo Cho and Hector Garcia-Molina and Lawrence Page}, year = 1998, title = {Efficient Crawling through {URL} ordering}, journal = {Computer Networks and ISDN Systems}, volume = 30, pages = {161--172}, abstract = {In this paper we study in what order a crawler should visit the URLs it has seenm in order to obtain more important pages first. Obtaining pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. We define several importance metrics, ordering schemes, and performance evaluation measures for this problem. We also experimentally evaluate the ordering schemes on the Stanford University Web. Our results show that a crawler with a good ordering scheme can obtain important pages significantly faster than one without.} } @ARTICLE{anatom:brin1998, author = {Sergey Brin and Lawrence Page}, title = {The anatomy of a large-scale hypertextual Web search engine}, year = 1998, journal = {Computer Networks and ISDN Systems}, volume = 30, number = {1--7}, pages = {107--117}, } @article{survey:dhyani2002, author = {Devanshu Dhyani and Wee Keong Ng and Sourav S. Bhowmick}, title = {A survey of Web metrics}, journal = {ACM Computing Surveys (CSUR)}, volume = {34}, number = {4}, year = {2002}, issn = {0360-0300}, pages = {469--503}, doi = {http://doi.acm.org/10.1145/592642.592645}, publisher = {ACM Press}, } @inproceedings{pagera:zhu2001, author = {Jianhan Zhu and Jun Hong and John G. Hughes}, title = {PageRate: counting Web users' votes}, booktitle = {Proceedings of the twelfth ACM conference on Hypertext and Hypermedia}, year = {2001}, isbn = {1-59113-420-7}, pages = {131--132}, location = {Arhus, Denmark}, doi = {http://netserv.lib.odu.edu:2383/10.1145/504216.504251}, publisher = {ACM Press}, } @ARTICLE {naviga:levene1999, author = {Mark Levene and George Loizou}, title = {Navigation in hypertext is easy only sometimes}, journal = {SIAM Journal on Computing}, volume = {29}, number = 3, pages = {728--760}, year = 1999, } @INPROCEEDINGS{latent:chen1998, author = {Chaomei Chen and Mary Czerwinski}, year = 1998, title = {From Latent Semantic to Spatial Hypertext: An Integrated Appoach}, booktitle = {Hypertext 98}, address = {Pittsburgh, PA}, pages = {77--86}, publisher = {ACM}, abstract = {The authors have applied a LSI analysis to the TDIDF values calulated on a set of hypertext documents. A visualization technique that allows the graphical structure of links among documents to be browsed was tested on human subjects. The authors have tested the technique for precision and recall of content as well as structure. Use the concept of mental models and navigation in a spatial sense.} } @ARTICLE{inform:susaki1998, author = {Seiji Susaki and Tatsuya Muramoto}, title = {Information sharing system on the {WWW} with interactive communication}, year = {1998}, journal = {Computer Networks and ISDN Systems}, volume = {30}, pages = {747--749}, abstract = {The authors describe a technique in which bookmarks are used to determine user and URL relations. Using TDIDF similarity measures are calculated between URL and users. The system allow users to visually browse both structures of similarities.} } @ARTICLE{focuse:chakrabarti1999, title = {Focused crawling: a new approach to topic-specific Web resource discovery}, journal = {Computer Networks}, volume = 31, number = {11--16}, year = 1999, pages = {1623--1640}, author = {Soumen Chakrabarti and Martin {van den Berg} and Byron Dom}, } @ARTICLE{applic:gustavo1997, title = {Applications of a Web query language}, journal = {Computer Networks and ISDN Systems}, volume = 29, number = {8--13}, year = 1997, pages = {1305--1316}, author = {Gustavo O. Arocena and Alberto O. Mendelzon and George A. Mihaila}, } @ARTICLE{squeal:spertus2000, title = {Squeal: a structured query language for the Web}, author = {Ellen Spertus and Andrea Lynn}, journal = {Computer Networks}, volume = 33, number = {1--6}, year = 2000, pages = {95--103}, } @ARTICLE{search:jenkins1998, author = {Charlotte Jenkins and Mike Jackson and Peter Burden and Jon Wallis}, title = {Searching the world wide web: an evaluation of available tools and methodologies}, journal = {Information and Software Technology}, volume = 39, number = {14--15}, year = 1998, pages = {985--994}, } @BOOK{unders:berry1999, author = {Michael W. Berry and Murray Browne}, title = {Understanding search engines : mathematical modeling and text retrieval}, year = 1999, address = {Philadelphia, Pa.}, publisher = {Society for Industrial and Applied Mathematics}, } @INPROCEEDINGS{automa:chakrabarti1998, author = {Soumen Chakrabarti and Byron Dom and Prabhakar Raghavan and Sridhar Rajagopallan and David Gibson and Jon Kleinberg}, month = {April}, year = 1998, title = {Automatic resource compilation by analyzing hyperlink structure and associated text}, booktitle = {Proc. 7th {I}nternational {W}orld {W}ide {W}eb {C}onference}, address = {Brisbane, Australia} } @ARTICLE{suppor:pitkow1996, author = {James E. Pitkow and R. Kipp Jones}, year = 1996, title = {Supporting the Web: a distributed hyperlink database system}, journal = {Computer Networks and ISDN systems}, volume = 28, pages = {981--991}, abstract = {database system to support web servers in link updating and verification}, }