Usefull paper, especially in terms of the initial state of the art chapter. However the approach followed does not sound very interesting. The use of the k-newarest neighbour algorithm can nevertheless be investigated. Extensive literature as well.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 UP004
%A Payne, T. R.
%A Edwards, P.
%B UK Intelligent Agents Workshop
%C Oxford
%D 1997
%E Nealon, J. L.
%E Taylor, N. S.
%I SGES Publications
%K User agents, filtering, information instance intelligent k-nearest learning, mail neighbour. news profile, prototype
%P 163-183
%T Learning Mechanisms for Information Filtering Agents.
@inproceedings{UP004,
added-at = {2009-06-22T10:05:09.000+0200},
address = {Oxford},
author = {Payne, T. R. and Edwards, P.},
biburl = {https://www.bibsonomy.org/bibtex/2eff10eb5c21a4b2296847aa5b1de8ab0/n.nanas},
booktitle = {UK Intelligent Agents Workshop},
editor = {Nealon, J. L. and Taylor, N. S.},
interhash = {9f42897e3fff2c0913f19f57179d5c62},
intrahash = {eff10eb5c21a4b2296847aa5b1de8ab0},
keywords = {User agents, filtering, information instance intelligent k-nearest learning, mail neighbour. news profile, prototype},
pages = {163-183},
publisher = {SGES Publications},
qnote = {Usefull paper, especially in terms of the initial state of the art chapter. However the approach followed does not sound very interesting. The use of the k-newarest neighbour algorithm can nevertheless be investigated. Extensive literature as well.},
timestamp = {2009-06-23T10:19:15.000+0200},
title = {Learning Mechanisms for Information Filtering Agents.},
year = 1997
}