package cn.edu.bjut.textmining.chapter5;

import cn.edu.bjut.textmining.chapter5.support.SampleNews;

/** 在同一TF-IDF空间中传播消息并选取新闻代表。 */
public class AffinityPropagationDemo {
    public static void main(String[] args) {
        try {
            double[][] vectors = SampleNews.vectors();
            AffinityPropagation.Result result = AffinityPropagation.fit(vectors, 0.7, 300, 20);
            System.out.printf(
                    "偏好值=%.9f，迭代轮数=%d，收敛=%s%n",
                    result.preference, result.iterations, result.converged);
            System.out.print("代表点：");
            for (int i : result.exemplars) {
                System.out.print("N" + (i + 1) + " ");
            }
            System.out.println();
            SampleNews.printClusters(result.labels);
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}