Markov model for clusters in concordance compression

A. Bookstein, S. T. Klein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

An earlier paper developed a procedure for compressing concordances, assuming that all elements occurred independently. In this paper, the earlier models are extended to take the possibility of clustering into account. We suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering.

Original languageEnglish
Title of host publicationProceedings of the Data Compression Conference
EditorsJames A. Storer, Martin Cohn
PublisherPubl by IEEE
Pages116-125
Number of pages10
ISBN (Print)0818656379
StatePublished - 1994
Externally publishedYes
EventProceedings of the Data Compression Conference - Snowbird, UT, USA
Duration: 29 Mar 199431 Mar 1994

Publication series

NameProceedings of the Data Compression Conference

Conference

ConferenceProceedings of the Data Compression Conference
CitySnowbird, UT, USA
Period29/03/9431/03/94

Fingerprint

Dive into the research topics of 'Markov model for clusters in concordance compression'. Together they form a unique fingerprint.

Cite this