Markov models for clusters in concordance compression

Abraham Bookstein; S. Klein; Timo Raita

Markov models for clusters in concordance compression

Abraham Bookstein
, S. Klein
, Timo Raita

Department of Computer Science and Artificial Intelligence

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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. The authors suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering.

Original language	American English
Title of host publication	Data Compression Conference, 1994. DCC'94. Proceedings
Publisher	IEEE
State	Published - 1994

Bibliographical note

Place of conference:USA

Cite this

@inproceedings{2394479aa05c4faab9a8b1dda0d486af,

title = "Markov models for clusters in concordance compression",

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. The authors suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering.",

author = "Abraham Bookstein and S. Klein and Timo Raita",

note = "Place of conference:USA",

year = "1994",

language = "American English",

booktitle = "Data Compression Conference, 1994. DCC'94. Proceedings",

publisher = "IEEE",

}

TY - GEN

T1 - Markov models for clusters in concordance compression

AU - Bookstein, Abraham

AU - Klein, S.

AU - Raita, Timo

N1 - Place of conference:USA

PY - 1994

Y1 - 1994

N2 - 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. The authors suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering.

AB - 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. The authors suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering.

UR - https://scholar.google.co.il/scholar?q=Markov+models+for+clusters+in+concordance+compression&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Data Compression Conference, 1994. DCC'94. Proceedings

PB - IEEE

ER -

Markov models for clusters in concordance compression

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this