메뉴 건너뛰기




Volumn 2108, Issue , 2001, Pages 540-549

Multiplicative adaptive algorithms for user preference retrieval

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMBINATORIAL MATHEMATICS; EXPANSION; GRADIENT METHODS; INFORMATION RETRIEVAL SYSTEMS;

EID: 84944065268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_60     Document Type: Conference Paper
Times cited : (9)

References (13)
  • 5
    • 33744954923 scopus 로고    scopus 로고
    • Some formal analysis of the Rocchio’s similarity-based relevance feedback algorithm
    • D.T. Lee and Shang-Hua Teng, editors, Lecture Notes in Computer Science 1969 (the full version will appear in Journal of Information Retrieval), Springer-Verlag
    • 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.
    • (2000) Proceedings of the Eleventh International Symposium on Algorithms and Computation , pp. 108-119
    • Chen, Z.1    Zhu, B.2
  • 7
    • 0001560952 scopus 로고
    • Relevance feedback in information retrieval
    • G. Salton, editor, Englewood Cliffs, NJ, Prentice-Hall, Inc
    • J.J. Rocchio Jr. 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.
    • (1971) The Smart Retrieval System - Experiments in Automatic Document Processing , pp. 313-323
    • Rocchio, J.J.1
  • 8
    • 0031375503 scopus 로고    scopus 로고
    • The perceptron algorithm vs. Winnow: Linear vs. Logarithmic mistake bounds when few input variables are relevant
    • 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.
    • (1997) Artificial Intelligence , pp. 325-343
    • Kivinen, J.1    Warmuth, M.K.2    Auer, P.3
  • 9
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm
    • N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285–318, 1988.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 10
    • 11144273669 scopus 로고
    • The perceptron: A probabilistic model for information storage and organization in the brain
    • F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6):386–407, 1958.
    • (1958) Psychological Review , vol.65 , Issue.6 , pp. 386-407
    • Rosenblatt, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.