![]() |
CiteULike | ![]() |
dmnapolitano's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Learning Rules that Classify E-Mailby: William W. Cohen
In In Papers from the AAAI Spring Symposium on Machine Learning in Information Access (1996), pp. 18-25.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractTwo methods for learning text classifiers are compared on classification problems that might arise in filtering and filing personal e-mail messages: a "traditional IR" method based on TF-IDF weighting, and a new method for learning sets of "keyword-spotting rules" based on the RIPPER rule learning algorithm. It is demonstrated that both methods obtain significant generalizations from a small number of examples; that both methods are comparable in generalization performance on problems of this type; and that both methods are reasonably efficient, even with fairly large training sets. However, the greater comprehensibility of the rules may be advantageous in a system that allows users to extend or otherwise modify a learned classifier. Introduction Perhaps the most-discussed technical phenomenon of recent years has been the rapid growth of the Internet---or more generally, the rapid growth in the number of on-line documents. This has led to increased interest in intelligent methods for ...
BibTeX record
RIS record