Extremely fast text feature extraction for classification and indexing

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 1221-1230

  Forman, George ^a   Kirshenbaum, Evan ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Bag of words; Document categorization; Feature engineering; Feature extraction; Text indexing; Text mining; Text tokenization

Indexed keywords

BAG-OF-WORDS; DOCUMENT CATEGORIZATION; FEATURE ENGINEERING; TEXT INDEXING; TEXT MINING; TEXT TOKENIZATION;

INDEXING (OF INFORMATION); KNOWLEDGE MANAGEMENT; TEXT PROCESSING;

FEATURE EXTRACTION;

EID: 70349254646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458243     Document Type: Conference Paper

References (15)

1. Aho, AV. and Corasick, MJ. 1975. Efficient string matching: an aid to bibliographic search. Communications of the ACM 18 (6): 333-340.
2. Commentz-Walter, B. 1979. A string matching algorithm fast on the average. In Proc. of the 6th Colloquium, on Automata, Languages and Programming (July 16-20, 1979). Lecture Notes in Comp. Sci.,v.71, Springer-Verlag, 118-132.
3. Forman, G. 2003. An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res. 3 (Mar. 2003), 1289-1305.
4. Forman, G. and Rajaram, S. 2008. Scaling up text classification for large file systems. In Proc. ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (Las Vegas, USA, August 24-27, 2008). KDD '08, 239-246.
5. Ganchev, K. and Dredze, M. 2008. Small statistical models by random feature mixing. In Workshop on Mobile Language Processing, Annual Meeting of the Association for Computational Linguistics (June 20, 2008). ACL'08.
6. Gospodnetic, O., and Hatcher, E. 2004. Lucene in Action (In Action Series). Manning Publications Co.
7. Joachims, T. 2006. Training linear SVMs in linear time. In Proc. ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (Philadelphia, USA, August 20 - 23, 2006). KDD '06, 217-226.
8. Karp, RM and Rabin, MO. 1987. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31 (2), 249-260.
9. Knuth, DE. 1973. The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA.
10. McKenzie, B. J., Harries, R., and Bell, T. 1990. Selecting a hashing algorithm. Software Practice and Experience 20, 2 (Feb. 1990), 209-224.
11. Mladenic, D. and Grobelnik, M. 1998. Word sequences as features in text-learning. In Proc. 17th Electrotechnical and Computer Science Conference (ERK98), Slovenia.
12. Rajaram, S. and Scholz, M. 2008. Client-friendlyclassification over random hyperplane hashes. In European Conf. on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD'08).
13. Salmela, L., Tarhio, J., and Kytöjoki, J. 2007. Multipattern string matching with q-grams. J. Exp. Algorithmics 11 (Feb. 2007), 1.1.
14. The Unicode Consortium. 2006. The Unicode Standard, Version 5.0. Addison-Wesley.
15. Witten, I., and Frank, E. 2005. Data Mining: Practical Machine Learning Tools and Techniques (Second Edition). Morgan Kaufmann, June 2005