Abstract
In contrast to the adoption of linear additive query updating techniques in existing popular algorithms for user preference retrieval, in this paper we design two types of algorithms, the multiplicative adaptive query expansion algorithm MA and the multiplicative adaptive gradient search algorithm MG, both of which use multiplicative query expansion strategies to adaptively improve the query vector. We prove that algorithm MA has a substantially better mistake bound than the Rocchio’s and the Perceptron algorithms in learning a user preference relation determined by a linear classifier with a small number of non-zero coefficients over the real-valued vector space [0, 1]n.We also show that algorithm MG boosts the usefulness of an index term exponentially, while the gradient descent procedure does so linearly. Our work also generalize the algorithm Winnow in the following aspects: various updating functions may be used; multiplicative updating for a weight is dependent on the value of the corresponding index term, which is more realistic and applicable to real-valued vector space; and finally, a number of documents which may or may not be counterexamples to the algorithm’s current classification are allowed. Practical implementations of algorithms MA and MG have been underway in the next stage development of our intelligent web search tools.
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
P. Bollmann and S.K.M. Wong Adaptive linear information retrieval models. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 1987.
Z. Chen and X. Meng Yarrow: A real-time client site meta search learner. In Proceedings of the AAAI 2000 Workshop on Artificial Intelligence for Web Search, pages 12–17, Austin, July 2000.
Z. Chen, X. Meng, R.H. Fowler, and B. Zhu Features: Real-time adaptive feature learning and document learning. Journal of the American Society for Information Science, June 2001.
Z. Chen, X. Meng, B. Zhu, and R. Fowler WebSail: From on-line learning to web search. In Proceedings of the 2000 International Conference on Web Information Systems Engineering (the full version will appear in Journal of Knowledge and Information Science, the special issue of WISE’00), pages 192–199, Hong Kong, June 2000.
Z. Chen and B. Zhu Some formal analysis of the Rocchio’s similarity-based relevance feedback algorithm. In D.T. Lee and Shang-Hua Teng, editors, Proceedings of the Eleventh International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 1969 (the full version will appear in Journal of Information Retrieval), pages 108–119. Springer-Verlag, 2000.
R.O. Duda and P.E. Hart Pattern Classification and Scene Analysis. John Wiley, 1973.
Jr.J.J. Rocchio Relevance feedback in information retrieval. In G. Salton, editor, The Smart Retrieval System-Experiments in Automatic Document Processing, pages 313–323, Englewood Cliffs, NJ, 1971. Prentice-Hall, Inc.
J. Kivinen, M.K. Warmuth, and P. Auer The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence, pages 325–343, 1997.
N. Littlestone Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285–318, 1988.
F. Rosenblatt The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6):386–407, 1958.
G. Salton Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, 1989.
G. Salton and C. Buckley Improving retrieval performance by relevance feedback. Journal of the American Society for Information Science, 41(4):288–297, 1990.
S.K.M. Wong, Y.Y. Yao, and P. Bollmann Linear structures in information retrieval. In Proceedings of the 1988 ACM-SIGIR Conference on Information Retrieval, pages 219–232, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Z. (2001). Multiplicative Adaptive Algorithms for User Preference Retrieval. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_60
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive