Abstract
A novel approach to supervised learning, called Lattice Machine, was proposed in [5]. In the Lattice Machine, it was assumed that data are structured as relations. In this paper we investigate the application of the Lattice Machine in the area of text classification, where textual data are unstructured. We represent a set of textual documents as a collection of Boolean feature vectors, where each vector corresponds to one document and each entry in a tuple indicates whether a particular term appears in the document. This is a common representation of textual documents. We show that using this representation, the Lattice Machine’s operations are simply set theoretic operations. In particular, the lattice sum operation is simply set intersection and the ordering relationship is simply set inclusion. Experiments show that the Lattice Machine, under this configuration, is quite competitive with state-of-the-art learning algorithms for text classification.
The authors gratefully acknowledge support by the KBN/British Council Grant No WAR/992/151
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
William W. Cohen. Fast effective rule induction. In Machine Learning: Proceedings of the Twelfth International Conference. Morgan Kaufmann, 1995. http:/www.research.att.com/~wcohen/.
William W. Cohen and Haym Hirsh. Joins that generalize: Text classification using whirl. In Proc. KDD-98, New York, 1998. http://www.research.att.com/~wcohen/.
M. Porter. An algorithm for suffix stripping, Program, 14(3):130–137, 1980.
Ross Quinlan. C4.5.: Programs for Machine Learning. Morgan Kaufmann, San Mateo, 1993.
Hui Wang, Ivo Düntsch, and David Bell. Data reduction based on hyper relations. In Proceedings of KDD98, New York, pages 349–353, 1998.
Jinxi Xu and W.B. Croft. Cropus-based stemming using co-occurrence of word variants. ACM TOIS, 16(1):61–81, Jan. 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Nguyen Hung Son (1999). Text classification using lattice machine. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095109
Download citation
DOI: https://doi.org/10.1007/BFb0095109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive