logo sequentialInformationalBottleneckClusterer

Cluster data using the sequential information bottleneck algorithm. Note: only hard clustering scheme is supported. sIB assign for each instance the cluster that have the minimum cost/distance to the instance. The trade-off beta is set to infinite so 1/beta is zero. For more information, see: Noam Slonim, Nir Friedman, Naftali Tishby: Unsupervised document classification using sequential information maximization. In: Proceedings of the 25th International ACM SIGIR Conference on Research and Development in Information Retrieval, 129-136, 2002.

homepage: weka.sourceforge.net/doc.packages/sequentialInformationalBottleneckClusterer
fresh index:
last release: 6 years ago, first release: 6 years ago
packaging: jar
get this artifact from: central
see this artifact on: search.maven.org

How much is this artifact used as a dependency in other Maven artifacts in Central repository and GitHub:

© Jiri Pinkas 2015 - 2018. All rights reserved. Admin login To submit bugs / feature requests please use this github page
related: JavaVids | Top Java Blogs | Java školení | 4npm - npm search | monitored using: sitemonitoring
Apache and Apache Maven are trademarks of the Apache Software Foundation. The Central Repository is a service mark of Sonatype, Inc.