This Article
	Subscribers, please Login Purchase article: $19 PDF HTML IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yuming Zhou Articles by Hareton Leung Articles by Pinata Winoto

MNav: A Markov Model-Based Web Site Navigability Measure

December 2007 (vol. 33 no. 12)

pp. 869-890

[1] 869 J. Nielsen, Hypertext and Hypermedia. Academic Press, 1990.[2] S. Machlis, “Site Redesigns Keep It Simple,” Computerworld, vol. 32, no. 43, pp. 43-44, 1998.[3] G. McGovern, “Part 1: Navigation, Design, and Principles,” Web Content Style Guide, Prentice Hall, 2001.[4] J. Palmer, “Web Site Usability, Design and Performance Metrics,” Information Systems Research, vol. 13, no. 2, pp. 151-167, 2002.[5] J.E. McEneaney, “Visualizing and Assessing Navigation in Hypertext,” Proc. 10th ACM Conf. Hypertext and Hypermedia: Returning to Our Diverse Roots, pp. 61-70, 1999.[6] J. Borges and M. Levene, “A Fine Grained Heuristic to Capture Web Navigation Patterns,” SIGKDD Explorations, vol. 2, no. 1, pp.40-50, 2000.[7] M. Levene, J. Borges, and G. Loizou, “Zipf's Law for Web Surfers,” Knowledge and Information Systems, vol. 3, no. 1, pp. 120-129, 2001.[8] M. Levene and G. Loizou, “Computing the Entropy of User Navigation in the Web,” Int'l J. Information Technology and Decision Making, vol. 2, no. 3, pp. 459-476, 2003.[9] J. Borges and M. Levene, “An Average Linear Time Algorithm for Web Usage Mining,” Int'l J. Information Technology and Decision Making, vol. 3, no. 2, pp. 307-319, 2004.[10] R. Botafogo, E. Rivlin, and B. Shneiderman, “Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics,” ACM Trans. Information Systems, vol. 10, no. 2, pp. 142-180, 1992.[11] P. De Bra and G.J. Houben, Hypertext Metrics Revisited: Navigational Metrics for Static and Adaptive Link Structures, http://wwwis.win.tue.nl/~houben/pubmeasures.ps.Z , 2005.[12] S. Yamada, J. Hong, and S. Sugita, “Development and Evaluation of Hypermedia for Museum Education: Validation of Metrics,” ACM Trans. Computer-Human Interaction, vol. 2, no. 4, pp. 284-307, 1995.[13] J. McEneaney, “Graphic and Numerical Methods to Assess Navigation in Hypertext,” J. Human-Computer Studies, vol. 55, no. 5, pp. 761-786, 2001.[14] Y. Zhang, H. Zhu, and S. Greenwood, “Website Complexity Metrics for Measuring Navigability,” Proc. Fourth Int'l Conf. Quality Software, pp. 172-179, 2004.[15] M. Bernard, “Examining a Metric for Predicting the Accessibility of Information within Hypertext Structures,” PhD dissertation, Dept. of Psychology, Wichita State Univ., 2002.[16] R. Botafogo and B. Shneiderman, “Identifying Aggregates in Hypertext Structures,” Proc. Third Ann. ACM Conf. Hypertext and Hypermedia, pp. 63-74, 1991.[17] P. Zaphiris and L. Mtei, Depth vs Breadth in the Arrangement Web Links, http://www.otal.umd.edu/ SHOREbs04/, 1997.[18] K. Larson and M. Czerwinski, “Web Page Design: Implications of Memory, Structure and Scent for Information Retrieval,” Proc. 16th ACM Conf. Human Factors in Computing Systems, pp.18-23, 1998.[19] M. Mohageg, “The Influence of Hypertext Linking Structures on the Efficiency of Information Retrieval,” Human Factors, vol. 34, no. 3, pp. 351-367, 1992.[20] S. McDonald and R. Stevenson, “Effects of Text Structure and Prior Knowledge of the Learner on Navigation in Hypertext,” Human Factors, vol. 40, no. 1, pp. 18-27, 1998.[21] J. Kiger, “The Depth/Breadth Tradeoff in the Design of Menu-Driven User Interfaces,” Int'l J. Man-Machine Studies, vol. 20, pp.201-213, 1984.[22] D. Zhang and Y. Dong, “An Efficient Algorithm to Rank Web Resources,” Computer Networks, vol. 33, nos. 1-6, pp. 449-455, 2000.[23] S. Brin and L. Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” Proc. Seventh Int'l World Wide Web Conf., pp.107-117, 1998.[24] J. Kleinberg, “Authoritative Sources in a Hyperlinked Environment,” J. ACM, vol. 46, no. 5, pp. 604-632, 1999.[25] T. Haveliwala, “Topic-Sensitive Pagerank: A Context-Sensitive Ranking Algorithm for Web Search,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 784-796, July/Aug. 2003.[26] M. Diligenti, M. Gori, and M. Maggini, “A Unified Probabilistic Framework for Web Page Scoring Systems,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 1, pp. 4-16, Jan. 2004.[27] S. Meyn and R. Tweedie, Markov Chains and Stochastic Stability. Springer-Verlag, 1993.[28] B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose, “Strong Regularities in World Wide Web Surfing,” Science, vol. 280, no. 3, pp. 95-97, 1998.[29] L. Briand, C. Bunse, and J. Daly, “A Controlled Experiment for Evaluating Quality Guidelines on the Maintainability of Object-Oriented Designs,” IEEE Trans. Software Eng., vol. 27, no. 6, pp.513-530, 2001.[30] M. Schemper, “Non-Parametric Partial Association Revisited,” The Statistician, vol. 40, no. 1, pp. 73-76, 1991.[31] E. Weyuker, “Evaluating Software Complexity Measures,” IEEE Trans. Software Eng., vol. 14, no. 9, pp. 1357-1365, Sept. 1998.[32] I.H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, 2000.[33] L. Briand, J. Wüst, J. Daly, and D. Porter, “Exploring the Relationships between Design Measures and Software Quality in Object-Oriented Systems,” J. Systems and Software, vol. 51, no. 3, pp. 245-273, 2000.[34] E. Gansner, E. Koutsofios, and S. North, Drawing Graphs with Dot, http://www.graphviz.org/Documentationdotguide.pdf , 2005.[35] P. Pirolli, “Rational Analyses of Information Foraging on the Web,” Cognitive Science, vol. 29, no. 3, pp. 343-373, 2005.[36] Y. Zhou and H. Leung, “Empirical Analysis of Object-Oriented Design Metrics for Predicting High and Low Severity Faults,” IEEE Trans. Software Eng., vol. 32, no. 10, pp. 771-789, Oct. 2006.[37] J. Liu, S. Zhang, and J. Yang, “Characterizing Web Usage Regularities with Information Foraging Agents,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 5, pp. 566-584, May 2004.[38] M. Bianchini, M. Gori, and F. Scarselli, “Inside PageRank,” ACM Trans. Internet Technology, vol. 5, no. 1, pp. 92-128, 2005.[39] A.N. Langville and C.D. Meyer, “Deeper Inside PageRank,” Internet Math., vol. 1, no. 3, pp. 335-380, 2004.[40] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press and McGraw-Hill, 2001.[41] C.D. Meyer, Matrix Analysis and Applied Linear Algebra. SIAM, 2000.[42] S.D. Kamvar, T.H. Haveliwala, and G.H. Golub, “Adaptive Methods for the Computation of PageRank,” Technical Report 2003-26, Stanford Univ., 2003.[43] S.D. Kamvar, T.H. Haveliwala, C.D. Manning, and G.H. Golub, “Extrapolation Methods for Accelerating PageRank Computations,” Proc. 12th Int'l Conf. World Wide Web, pp. 261-270, 2003.[44] S.D. Kamvar, T.H. Haveliwala, C.D. Manning, and G.H. Golub, “Exploiting the Block Structure of the Web for Computing PageRank, ” Technical Report 2003-17, Stanford Univ., 2003.[45] A. Broder, R. Lempel, F. Maghoul, and J. Pedersen, “Efficient PageRank Approximation via Graph Aggregation,” Information Retrieval, vol. 9, no. 2, pp. 123-138, 2006.[46] E.H. Chi, P. Pirolli, K. Chen, and J. Pitkow, “Using Information Scent to Model User Information Needs and Actions on the Web,” Proc. 2001 ACM Conf. Human Factors in Computing Systems, pp.490-497, 2001.[47] P. Pirolli and S.K. Card, “Information Foraging,” Psychological Rev., vol. 106, no. 4, pp. 643-675, 1999.[48] D.J. Aumueller, “A Tool for Gathering, Analysing, Exporting, and Visualizing the Structure of a Website,” master's thesis, Inst. of Comm. Studies, Univ. of Leeds, 2003.[49] T. Escher, H. Margetts, V. Petricek, and I. Cox, “Governing from the Centre? Comparing the Nodality of Digital Governments,” Proc. Ann. Meeting Am. Political Science Assoc., 2006.