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.

Table Of Contents

• Latest Version
• All Versions
• View Java Class Source Code in JAR file

Latest Version

Download nz.ac.waikato.cms.weka : sequentialInformationalBottleneckClusterer JAR file - Latest Versions:

• Latest Stable: 1.0.2.jar

All Versions

Download nz.ac.waikato.cms.weka : sequentialInformationalBottleneckClusterer JAR file - All Versions:

Version		Vulnerabilities	Size	Updated
1.0.x	sequentialInformationalBottleneckClusterer-1.0.2.jar		18.57 KB	Apr 26, 2012
	sequentialInformationalBottleneckClusterer-1.0.1.jar		18.57 KB	Apr 24, 2012

View Java Class Source Code in JAR file

1. Download JD-GUI to open JAR file and explore Java source code file (.class .java)
2. Click menu "File → Open File..." or just drag-and-drop the JAR file in the JD-GUI window sequentialInformationalBottleneckClusterer-1.0.2.jar file.
   Once you open a JAR file, all the java classes in the JAR file will be displayed.

weka.clusterers

├─ weka.clusterers.sIB.class - [JAR]