Abstract
More and more people rely on e-mails rather than postal letters to communicate to each other. Although e-mails are more convenient, letters still have many positive features. The ability to handle “anonymous recipient” is one of them. This paper proposes a software agent that performs the routing task as human beings for the anonymous recipient e-mails. The software agent named “TWIMC (To Whom It May Concern)” receives anonymous recipient e-mails, analyze it, and then routes the e-mail to the mostly qualified person (i.e., e-mail account) inside the organization. The agent employs the Set-oriented Classifier System (SCS) that is a genetic algorithm classifier that uses set representation internally. The comparison of SCS with the Support Vector Machine (SVM) shows that the SCS outperforms SVM under noisy environment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, E.-H. Han, Karypis, G., Kumar, V.: Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification. Proc. of the Pacific-Asia Conference on Knowledge Discover and Data Mining (1999)
Katirai, H.: Filtering Junk E-Mail: A Performance Comparison between Genetic Programming & Naïve Bayes. Carnegie Mellon University (1999)
Schutze, H., Hull, D. A., Pedersen, J. O.: A Comparison of Classifiers and Document Representations for the Routing Problem. Proc. of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1995) 229–237
Moulinier, I., Ganascia, J.-G.: Applying an Existing Machine Learning Algorithm to Text Categorization. Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, Springer-Verlag (1996)
De Jong, K. A., Spears, W. M.: Learning Concept Classification Rules Using Genetic Algorithms. Proc. of the 12th International Joint Conference on Artificial Intelligence (1991) 651–656
Grobelnik, M., Mladenic, D.: Efficient text categorization. Proc. of the 10th European Conference on Machine Learning Workshop on Text Mining (1998)
Rendon, M. V.: Reinforcement Learning in the Fuzzy Classifier System. Proc. lst International Conference on Learning Classifier Systems (1992)
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods, Cambridge University Press (2000)
Klinkerberg, R., Joachims, T.: Detecting Concept Drift with Support Vector Machines. Proc. of the 17th International Conference on Machine Learning (2000)
Saxon, S., Barry, A.: XCS and the Monk’s Problems. Proc. of the 2nd International Workshop on Learning Classifier Systems (1999)
Joachims, T.: Text Categorization with Support Vector Machines-Learning with Many Relevant Features. Proc. of the European Conference on Machine Learning (1998) 137–142
Mitchell, T. M.: Machine Learning, McGraw-Hill T. M. (1997)
Cohen, W. W.: Learning Rules that Classify E-Mail. Proc. of the AAAI Spring Symposium on Machine Learning and Information Access (1996)
Yang, Y.: An Evaluation of Statistical Approaches to Text Categorization. Journal of Information Retrieval, Vol. 1 (1999) 67–88
Yang, Y., Liu, X.: A Re-examination of Text Categorization Methods. Proc. of the ACM SIGIR Conference on Research and Development in Information Retrieval (1999)
Ku, S., Lee, B.: A Set-Oriented Genetic Algorithm and the Knapsack Problem. Proc. of the Congress on Evolutionary Computation (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ku, S., Lee, B., Ha, E. (2002). Extracting User Profiles from E-mails Using the Set-Oriented Classifier. In: Ishizuka, M., Sattar, A. (eds) PRICAI 2002: Trends in Artificial Intelligence. PRICAI 2002. Lecture Notes in Computer Science(), vol 2417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45683-X_50
Download citation
DOI: https://doi.org/10.1007/3-540-45683-X_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44038-3
Online ISBN: 978-3-540-45683-4
eBook Packages: Springer Book Archive