A prepositional approach to textual case indexing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3721 LNAI, Issue , 2005, Pages 380-391

  Wiratunga, Nirmalie ^a   Lothian, Rob ^a   Chakraborti, Sutanu ^a   Koychev, Ivan ^b  

^a ROBERT GORDON UNIVERSITY   (United Kingdom)

^b INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK; FILE EDITORS; LEARNING SYSTEMS; PROBLEM SOLVING; STATISTICAL METHODS; TEXT PROCESSING; VOCABULARY CONTROL;

DIMENSIONALITY REDUCTION TECHNIQUE; LINEAR COMBINATIONS; PREPOSITIONAL APPROACH; TEXT FORM;

INDEXING (OF INFORMATION);

EID: 33646397562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_38     Document Type: Conference Paper

References (22)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in KD and DM, pages 307-327, 1995. AAAI/MIT.
2. D. Aha, editor. Mixed-Initiatives Workshop at 6th ECCBR, 2002. Springer.
3. S. Bruninghaus and K. D. Ashley. Bootstrapping case base development with annotated case summaries. In Proc of the 2nd ICCBR, pages 59-73, 1999. Springer.
4. W. W. Cohen. Providing database-like access to the web using queries based on textual similarity. In Proc of the Int Confon Management of Data, pages 558-560, 1998.
5. W. W. Cohen and Y. Singer. Context-sensitive learning methods for text categorisation. ACM Transactions in Information Systems, 17(2):141-173, 1999.
6. S. Das. Filters, wrappers and a boosting based hybrid for feature selection. In Proc of the 18th ICML, pages 74-81, 2001. Morgan Kaufmann.
7. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
8. S. J. Delany and P. Cunningham. An analysis of case-base editing in a spam filtering system. In Proc of the 7th ECCBR, pages 128-141, 2004. Springer.
9. G. Forman and I. Cohen. Learning with Little: Comparison of Classifiers Given Little Training. In Proc of the 8th European Confon PKDD. pages 161-172, 2004.
10. Y. Freund and R. Schapire. Experiments with a new boosting algorithm. In Proc of the 13th ICML, pages 148-156, 1996.
11. K. M. Gupta and D. W. Aha. Towards acquiring case indexing taxonomies from text. In Proc of the I7th Int FLAIRS Conference, pages 307-315, 2004. AAAI press.
12. W. Iba and P. Langley. Induction of one-level decision trees. In Proc of the 9th Int Workshop on Machine Learning, pages 233-240, 1992.
13. T. Joachims. A probabilistic analysis of the Rocchio algorithm with TFIDF. Technical report, Carnegie Mellon University CMU-CS-96-118, 1996.
14. M. Lenz. Defining knowledge layers for textual CBR. In Proc of the 4th European Workshop on CBR, pages 298-309, 1998. Springer.
15. U. Y. Nahm and R. J. Mooney. Mining soft-matching rules from textual data. In Proc of the 17th IJCAI, pages 979-984, 2001.
16. G. Sakkis, I. Androutsopoulos, G. Paliouras, V. Karkaletsis, C. Spyropoulos, and P. Stamatopoulos. A memory-based approach to anti-spam filtering for mailing lists. Information Retrieval, 6:49-73, 2003.
17. G. Salton and M. J. McGill. An introduction to modern IR. 1983, McGraw-Hill.
18. F. Sebastiani. ML in automated text categorisation. ACM Computing surveys, 34:1-47, 2002.
19. N. Wiratunga, I. Koychev, and S. Massie. Feature selection and generalisation for textual retrieval. In Proc of the 7th ECCBR, pages 806-820, 2004. Springer.
20. Y. Yang and J. O. Pedersen. A comparative study on feature selection in text categorisation. In Proc of the 14th ICML, pages 412-420, 1997. Springer.
21. S. Zelikovitz. Mining for features to improve classification. In Proc of Machine Learning, Models, Technologies and Applications, 2003.
22. S. Zelikovitz and H. Hirsh. Using LSI for text classification in the presence of background text. In Proc of the 10th Int Confon Information and KM, 2001.