Abstract
Dynamic Nearness is a data mining algorithm that detects semantic relationships between objects in a database, based on access patterns. This approach can be applied to web pages to allow automatic dynamic reconfiguration of a web site. Worst-case storage requirements for the algorithm are quadratic (in the number of web pages), but practical reductions, such as ignoring a few long transactions that provide little information, drop storage requirements to linear. Thus, dynamic nearness scales to large systems. The methodology is validated via experiments run on a moderately-sized existing web site.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. S. Chen, J. S. Park, and. P. S. Yu, “Data mining for path traversal patterns in a web environment’, Proc. 16th International Conference on Distributed Computing Systems, pages 385–392, 1996.
R. Cooley, B. Mobasher, and J. Srivastava, “Grouping Web Page References into Transactions for Mining World Wide Web Browsing Patterns,” Proceedings of the IEEE Knowledge and Data Engineering Exchange Workshop, KDEX, pages 2–9, 1997.
T. M. Cover and P. E. Hart, “Nearest neighbor pattern classification”, IEEE Transactions on Information Theory, IT.-13(1):21–27, January 1967.
F Cuppers and R. Demolombe, “Cooperative answering: a methodology to provide intelligent access to databases”, Proc. 2nd International Conference on Expert Database Systems, Virginia, USA, 1988.
T. Gaasterland, P. Godfrey, and J. Minker, “An overview of cooperative answering”, In Nonstandard Queries and Nonstandard Answers. R. Demolombe and T. Imielinski, eds. Oxford Science Publications, 1994.
C. M. Hymes and G. M. Olson, “Quick but not so dirty web design: applying empirical conceptual clustering techniques to organize hypertext content” Proceedings of the Conference on Designing Interactive Systems: Processes, Practices, Methods, and Techniques. pages 159–162, 1997.
J. A. Johnson, “Semantic Relatedness”, Computer and Mathematics with Applications, pages 51–63, 29(5), 1995.
L. Leydesdorff and R. Zaal, “Co-words and citations relations between document sets and environments,” Informetrics 87/88, pages 105–119, 1988.
M. A. Merzbacher and W. W. Chu, “Query-Based Semantic Nearness for Cooperative Query Answering”, Proc. 1st ISMM Conference on Information and Knowledge Management: CIKM, 1993.
A. Motro, “Cooperative database systems”, International Journal of Intelligent Systems. pages 717–731, v11 n10, 1996.
G. Salton, Automatic text processing: the transformation, analysis, and retrieval of information by computer, Addison-Wesley, Reading Massachusetts, 1989.
D. G. Zhao, “ELINOR electronic library system”, Electronic Library, pages 289–294, Oct 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merzbacher, M. (1999). Discovering semantic proximity for web pages. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095110
Download citation
DOI: https://doi.org/10.1007/BFb0095110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive