A natural question in Information Bottleneck method is how many “groups” are appropriate. The dependency on prior knowledge restricts the applications of many Information Bottleneck algorithms. In this paper we aim to remove this dependency by formulating the parameter choosing as a model selection problem, and solve it using the minimum message length principle. Empirical results in the documentation clustering scenario indicates that the proposed method works well for the determination of the optimal parameter value for information bottleneck method.
Language
eng
Field of Research
080299 Computation Theory and Mathematics not elsewhere classified