Abstract
A bookmark means the URL information stored for memorizing a user’s own footprints and revisiting that website. This paper regards this bookmark as one of the most meaningful information representing user preferences. An original bookmark indicating only address information is categorized for merging semantic meanings by using public web directory services. These categorized bookmarks are expressed in a hierarchical tree structure. However, most current web directory services cannot afford to normalize and manage the topic hierarchy. There are several kinds of structural incompleteness such as multiple references and heterogeneous tree structures. In order to extract user preferences, this paper proposes a method for driving these problems and the influence propagation methods based on Bayesian networks. Therefore, the preference maps representing users’ interests are also established as tree structures. With respect to the user clustering, an approximate tree matching method is used for mapping (overlapping) users’ preference maps. It is possible to make queries and process them efficiently according to categories. Finally, this paper is applied to implement collaborative web browsing that can guide and explore the web efficiently and adaptively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Maes, P., “Agents that Reduce Work and Information Overload,” Communications of the ACM. Vol. 37 (1994)
Sheth, B., Maes, P., “Evolving agents for personalized information filtering,” Proceedings of the ninth IEEE Conference on Artificial Intelligence for applications (1993)
Pazzani, M., Nguyen, L., Mantik, S., “Learning from hotlists and coldlists: towards a WWW information filtering and seeking agent,” Proceedings of AI Tools Conference, Washington, DC (1995)
Shardanand, U., Maes, P., “Social Information Filtering: Algorithms for Automating Word of Mouth,” Proceedings of CHI’95 Conference on Human Factors in Computing Systems, ACM Press (1995)
Lashkari, Y., “Webhound,” Master’s thesis, MIT Media Laboratory (1995)
Jung, J.J., Yoon, J., Jo, G.-S., “BISAgent: Collaborative Web Browsing through Sharing of Bookmark Information,” 16th IFIP World Computer Congress 2000 (IIP), Beijing, China (2000)
Salton, G., Lesk, M.E., “Term-weighting approaches in automatic retrieval,” Information Processing & Management. 24(5) (1988) 513–523
Baeza-Yates, R., Ribeiro-Neto, B., Modern Information Retrieval. Addison-Wesley (1999)
Pelillo, M., Siddiqi, K., Zucker, S.W., “Matching hierarchical structures using association graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence. 21(11) (1999)
Horowitz, E., Sahni, S., Fundamentals of Data Structures in Pascal. Computer Science Press. (1994)
Wang, J., Zhang, K., Jeong, K., Shasha, D., “A System for Approximate Tree Matching,” IEEE Transaction On Knowledge and Data Engineering. Vol. 6. (1994) 559–570
E. Spertus, “ParaSite: Mining Structural Information on the Web,” Proceeding on the Sixth International World Wide Web Conference (1997)
Analyti, A., Spyratos, N., Constantopoulos, P., “Deriving and Retrieving Contextual Categorical Information through Instance Inheritance,” http://www.ics.forth.gr/proj/isst/Publications (1998)
Navarro, G., Baeza-Yates, R., “Improving an algorithm for approximate pattern matching,” Technical Report TR/DCC-98-5, Dept. of Computer Science, Univ. of Chile (1998)
Pearl, J., Probabilistic reasoning in intelligent systems. Morgan Kauffman Publisher. (1988)
Giarratano, J., Riley, G., Expert systems principles and programming. PWS publishing company. (1994)
McCallum, A., Nigam, K., Rennie, J., Seymore, K., “Building Domain-Specific Search Engines with Machine Learning Techniques,” AAAI Spring Symposium (1999)
Chakrabarti, S., Batterrywala, Y., “Mining themes from bookmarks,” ACM SIGKDD KDD 2000 Workshop on Text Mining (2000)
Apostolico, A., Galil, Z. (eds.), Pattern Matching Algorithms-Approximate Tree Pattern Matching (Ch. 14). Oxford University Press. (1997)
Boyer, R.S., Moore, J.S., “A fast string matching algorithm,” Communication of ACM, Vol. 20 (1977)
Lieberman, H., Dyke, N., Vivacqua, A., “Let’s Browse: A Collaborative Web Browsing Agent,” International Conference on Intelligent User Interfaces (1999)
Twidale, M., Nichols, D., “Collaborative Browsing and Visualization of the Search Process,” Electronic Library and Visual Information Research Conference, Milton Keynes, England, May (1996)
Claypool, M., Brown, D., Le, P., Waseda, M., “Inferring User Interest,” IEEE Internet Computing, Nov./Dec. (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, J.J., Yoon, JS., Jo, GS. (2003). Collaborative Information Filtering by Using Categorized Bookmarks on the Web. In: Bartenstein, O., Geske, U., Hannebauer, M., Yoshie, O. (eds) Web Knowledge Management and Decision Support. INAP 2001. Lecture Notes in Computer Science(), vol 2543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36524-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-36524-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00680-0
Online ISBN: 978-3-540-36524-2
eBook Packages: Springer Book Archive