Clumping properties of content-bearing words

Journal of the American Society for Information Science

Volumn 49, Issue 2, 1998, Pages 102-114

  Bookstein, A ^a   Klein, S T ^b   Raita, T ^c  

^a UNIVERSITY OF CHICAGO   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA STRUCTURES; DATABASE SYSTEMS;

CONTENT BEARING WORDS;

INFORMATION RETRIEVAL SYSTEMS;

EID: 0031999348     PISSN: 00028231     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-4571(1998)49:2<102::AID-ASI2>3.0.CO;2-2     Document Type: Article

References (18)

1. Bookstein, A., & Klein, S. T. (1991). Compression of correlated bitvectors. Information Systems, 16, 387-400. A shorter form appeared as: Construction of optimal graphs for bit-vector compression. (1990). In Proc. 13-th ACM-SlGIR Conf., (pp. 327-342). Brussels: ACM.
2. Bookstein, A., & Klein, S. T. (1991). Compression of correlated bitvectors. Information Systems, 16, 387-400. A shorter form appeared as: Construction of optimal graphs for bit-vector compression. (1990). In Proc. 13-th ACM-SlGIR Conf., (pp. 327-342). Brussels: ACM.
3. Bookstein, A., & Klein, S. T. (1990). Information retrieval tools for literary analysis. In Tjoa, A. M., Wagner, R., (Eds.), Database and expert systems applications: Proceedings of the DEXA 90 Conference, (pp. 1-7). Vienna, Sept, 1990, Vienna: Springer Verlag.
4. Bookstein, A., Klein, S. T., & Raita, T. (1995). Detecting contentbearing words by serial clustering. In Proc. 18-th ACM-SICIR Conf., (pp. 319-327). Seattle. WA: ACM.
5. Bookstein, A., Klein, S. T., & Raita, T. (1997). Modeling word occurrenes for the compression of coneordances. ACM Trans, on Information Systems.
6. Bookstein, A., Klein. S. T., & Raita, T. (1994). Markov models for clusters in concordance compression. In Proc. Data Compression Conference DCC-94 (pp. 116-125). Snowbird, Utah.
7. Bookstein, A., & Klein, S. T. (1990). Using bitmaps for medium sized information retrieval systems. Information Processing & Management. 26, 525-533.
8. Bookstein, A., & Swanson, D. (1975). A decision theoretic foundation for indexing. Journal of the American Society for Information Science, 26, 45-50.
9. Choueka, Y., Fraenkel, A. S., Klein, S. T., & Segal, E. (1987). Improved techniques for processing queries in full-text systems. Proc. 10-th ACM-SIGIR Conf. (pp. 306-315). New Orleans: ACM.
10. Choueka, Y., Fraenkel, A. S., Klein, S. T., & Segal, E. (1986). Improved hierarchical bit-vector compression in document retrieval sys-tems. Proc. 9-th ACM-SIGIK Conf. (pp. 88-97). Pisa: ACM.
11. Feller, W. (1968). An introduction to probability theory and its applications. New York: Wiley.
12. Knuth, D. E. (1973). The art of computer programming, Vol. I, Fundamental algorithms. Reading, MA: Addison-Wesley.
13. Lancaster, F. W. (1986) . Vocabulary Control For Information Retrieval (2nd ed.). Arlington, VA: Information Resources Press.
14. Luhn, H. P. (1957). A statistical approach to the mechanized encoding and searching of literary information. IBM Journal of Research and Development 1, 309-317.
15. Salton, G. (1989). Automatic text processing: The transformation, analysis and retrieval of information by computer. Reading. MA: Addison-Wesley Publishing Company.
16. Siegel, S. (1976). Nonparametric statistics for the behavioral sciences. New York: McGraw-Hill Book Co.
17. Soergel, D. (1985). Organizing information. Orlando. FL, Academic Press.
18. Van Rijsbergen, C. J. (1975). Information retrieval. London: Butterworths.