层次聚类算法之single-linkage和complete-linkage（C语言实现）

2023-10-11 04:48
文章标签 算法 语言 实现 层次 聚类 single complete linkage

本文主要是介绍层次聚类算法之single-linkage和complete-linkage（C语言实现），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

层次聚类试图在不同层次上对数据集合进行划分， 从而形成树形的聚类结构。数据集的划分可采用“自底向上”的聚合策略，也可以采用“自顶向下”的分拆策略。

AGNES是一种采用自底向上的聚合策略的层次聚合算法，它先将数据集中的每个样本看作是一个初始的聚类簇，然后在算法进行的每一步中找出距离最近的两个聚类来进行合并，该过程不断的重复，直到到达预设的聚类簇的个数。

改算法的关键是如何计算聚类之间的距离， 实际上，每一个聚类是一个样本的集合，因此，只需要采用关于集合的某种距离即可。

最近距离由两个簇的最近的样本来决定， 最大距离由两个簇的最远的样本来决定，由此分别产生的AGNES算法又分别称为single-linkage和complete-linkage算法。


single-linkage算法

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<io.h>int sample_size;
int sample_dimension;
char filename[200];double** data;
double** distance;
int cluster_count;void initialization();
void readDataFromFile();
double calculateDistance_BetweenTwoObject(int, int);
void initializationDistanceMatrix();
void AGNES();
void findMinDistance_BetweenClsuter_MIN(int*, int*);
void combineCluster(int, int);
void writeToFile(int);int main(int argc, char* argv[])
{if( argc != 4 ){printf("This algorithm requires 4 user-specified parameter""\n\t\tthe number of sample""\n\t\tthe dimension of sample""\n\t\tthe filename contain the sample""\n\n");exit(0);}sample_size = atoi(argv[1]);sample_dimension = atoi(argv[2]);strcat(filename, argv[3]);initialization();readDataFromFile();initializationDistanceMatrix();AGNES();return 0;
}/** initialize the dynamic array for storing sample* */
void initialization()
{//initializaion the sample dataint i, j;data = (double**)malloc(sizeof(double*) * (sample_size + 1));if( !data ){printf("data malloc error: 0");exit(0);}for( i = 1; i <= sample_size; i++ ){data[i] = (double*)malloc(sizeof(double) * (sample_dimension + 1));if( !data[i] ){printf("data malloc error: %d", i);exit(0);}}//initialiation the distance datadistance = (double**)malloc(sizeof(double*) * (sample_size + 1));if( !distance ){printf("distance malloc error: 0");exit(0);}for( i = 1; i <= sample_size; i++ ){distance[i] = (double*)malloc(sizeof(double) * (sample_size + 1));if( !distance[i] ){printf("distance malloc error: %d", i);exit(0);}}//the 0th element of all row indicate the clauterID of the objectfor( i = 1; i <= sample_size; i++ ){distance[i][0] = i;}
}/** read the sample data from file* */
void readDataFromFile()
{FILE* fread;int i;int j;if( NULL == (fread = fopen(filename, "r"))){printf("open file(%s) error: ", filename);exit(0);}for( i = 1; i <= sample_size; i++ ){for( j = 1; j <= sample_dimension; j++ ){if( 1 != fscanf(fread, "%lf ", &data[i][j])){printf("fscanf error: (%d, %d)", i, j);exit(0);}}}//testprintf("print the origin data:\n");for( i = 1; i <= sample_size; i++ ){for( j = 1; j <= sample_dimension; j++ ){printf("%f\t", data[i][j]);}printf("\n");}//test END
}/** calculate distance between two objects* */
double calculateDistance_BetweenTwoObject(int firstID, int secondID)
{double distance = 0.0;int i;for( i = 1; i <= sample_dimension; i++ ){distance = distance + pow(data[firstID][i] - data[secondID][i], 2);}return sqrt(distance);
}/** calculate initialization distance matrix* */
void initializationDistanceMatrix()
{int i, j;for( i = 1; i <= sample_size; i++ ){for( j = i; j <= sample_size; j++ ){distance[i][j] = calculateDistance_BetweenTwoObject(i, j);distance[j][i] = distance[i][j];}}//testprintf("print the origin distance matrix\n");for( i = 1; i <= sample_size; i++ ){for( j = 0; j <= sample_size; j++ ){printf("%f ", distance[i][j]);}printf("\n");}//test END
}/****************************************************************************************************************						AGNES***************************************************************************************************************/
void AGNES()
{cluster_count = sample_size;int cluster_1, cluster_2;int count = 1;while( cluster_count > 3 ){printf("-------------------%d--------------------\n", count);findMinDistance_BetweenClsuter_MIN(&cluster_1, &cluster_2);combineCluster(cluster_1, cluster_2);				cluster_count--;writeToFile(count++);}
}/** find two clusters the distance between them is minimun, and store the clusterID in @cluster_1 and @cluster_2, respectively.* */
void findMinDistance_BetweenClsuter_MIN(int* cluster_1, int* cluster_2)
{int i, j;double min_distance;int flag = 1;for( i = 1; i <= sample_size; i++ ){for( j = i + 1; j <= sample_size; j++ ){if( distance[i][0] == distance[j][0] ){printf("same cluster!!!! %d and %d\n\n", i , j);continue;}else if( flag == 1 ){min_distance = distance[i][j];*cluster_1 = i;*cluster_2 = j;flag = 0;printf("----get the initial minimum distance is %f(%d, %d)\n", min_distance, i, j);continue;}if( distance[i][j] < min_distance ){min_distance = distance[i][j];*cluster_1 = i;*cluster_2 = j;}}}printf("the minimum is %f :(%d, %d)\n", min_distance, *cluster_1, *cluster_2);
}/** combine the two clusters to one* */
void combineCluster(int cluster_1, int cluster_2)
{int i;int buffer;buffer = distance[cluster_2][0];for( i = 1; i <= sample_size; i++ ){if( distance[i][0] == buffer ){distance[i][0] = distance[cluster_1][0];}}//testprintf(" the minimum distance is %f, and the object is %d and %d\n", distance[cluster_1][cluster_2], cluster_1, cluster_2);int j;for( i = 1; i <= sample_size; i++ ){for( j = 0; j <= sample_size; j++ ){printf("%f ", distance[i][j]);}printf("\n");}
}/** write the result of clustering information to file* */
void writeToFile(int round)
{int i;int j;int* auxiliary = (int*)malloc(sizeof(int) * (sample_size + 1));if( !auxiliary ){printf("auxiliary malloc error");exit(0);}for( i = 1; i <= sample_size; i++ )auxiliary[i] = 0;for( i = 1; i <= sample_size; i++ ){auxiliary[(int)distance[i][0]]++;}int *clusterID = (int*)malloc(sizeof(int) * (sample_size - round + 1));if( !clusterID ){printf("clusterID malloc error");exit(0);}int counter = 1;for( i = 1; i <= sample_size; i++ ){if( auxiliary[i] != 0 )clusterID[counter++] = i;}//testprintf("cluster ID:");for( i = 1; i <= sample_size - round; i++ ){printf("%d ", clusterID[i]);}printf("\n");//test ENDprintf("writeToFile -----------round: %d\n", round);FILE** fwrite;fwrite = (FILE**)malloc(sizeof(FILE*) * (sample_size + 1));if( !fwrite ){printf("fwrite malloc error\n");exit(0);}char filename[200] = "";char instruction[200] = "";sprintf(instruction, "md  Round_%d", round);system(instruction);for( i = 1; i <= sample_size - round; i++ ){sprintf(filename, ".//Round_%d//cluster_%d.data", round, clusterID[i]);if( NULL == (fwrite[clusterID[i]] = fopen(filename, "w"))){printf("open file(%s) error\n", filename);exit(0);}}for( i = 1; i <= sample_size; i++ ){printf("%d ", (int)distance[i][0]);for( j = 1; j <= sample_dimension; j++ ){fprintf(fwrite[(int)distance[i][0]], "%f\t", data[i][j]);printf("%f ", data[i][j]);}fprintf(fwrite[(int)distance[i][0]], "\n");printf("\n");}for( i = 1; i <= sample_size - round; i++ ){fclose(fwrite[clusterID[i]]);}
}

complete-linkage算法 

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<io.h>int sample_size;
int sample_dimension;
char filename[200];double** data;
double** distance;
int cluster_count;void initialization();
void readDataFromFile();
double calculateDistance_BetweenTwoObject(int, int);
void initializationDistanceMatrix();
void findMinDistance_BetweenClsuter_MAX(int*, int*);
void AGNES();
void combineCluster(int, int);
void updateDistance(int);
void writeToFile(int);int main(int argc, char* argv[])
{if( argc != 4 ){printf("This algorithm requires 4 user-specified parameter""\n\t\tthe number of sample""\n\t\tthe dimension of sample""\n\t\tthe filename contain the sample""\n\n");exit(0);}sample_size = atoi(argv[1]);sample_dimension = atoi(argv[2]);strcat(filename, argv[3]);initialization();readDataFromFile();initializationDistanceMatrix();AGNES();return 0;
}/** initialize the dynamic array for storing sample* */
void initialization()
{//initializaion the sample dataint i, j;data = (double**)malloc(sizeof(double*) * (sample_size + 1));if( !data ){printf("data malloc error: 0");exit(0);}for( i = 1; i <= sample_size; i++ ){data[i] = (double*)malloc(sizeof(double) * (sample_dimension + 1));if( !data[i] ){printf("data malloc error: %d", i);exit(0);}}//initialiation the distance datadistance = (double**)malloc(sizeof(double*) * (sample_size + 1));if( !distance ){printf("distance malloc error: 0");exit(0);}for( i = 0; i <= sample_size; i++ ){distance[i] = (double*)malloc(sizeof(double) * (sample_size + 1));if( !distance[i] ){printf("distance malloc error: %d", i);exit(0);}}//the 0th element of all row indicate the clauterID of the objectfor( i = 1; i <= sample_size; i++ ){distance[i][0] = i;}//where reserved if distance[0][i] = 1, for( i = 1; i <= sample_size; i++ ){distance[0][i] = 1;}
}/** read the sample data from file* */
void readDataFromFile()
{FILE* fread;int i;int j;if( NULL == (fread = fopen(filename, "r"))){printf("open file(%s) error: ", filename);exit(0);}for( i = 1; i <= sample_size; i++ ){for( j = 1; j <= sample_dimension; j++ ){if( 1 != fscanf(fread, "%lf ", &data[i][j])){printf("fscanf error: (%d, %d)", i, j);exit(0);}}}
}/** calculate distance between two objects* */
double calculateDistance_BetweenTwoObject(int firstID, int secondID)
{double distance = 0.0;int i;for( i = 1; i <= sample_dimension; i++ ){distance = distance + pow(data[firstID][i] - data[secondID][i], 2);}return sqrt(distance);
}/** calculate initialization distance matrix* */
void initializationDistanceMatrix()
{int i, j;for( i = 1; i <= sample_size; i++ ){for( j = i; j <= sample_size; j++ ){distance[i][j] = calculateDistance_BetweenTwoObject(i, j);distance[j][i] = distance[i][j];}}
}/****************************************************************************************************************						AGNES***************************************************************************************************************/
void AGNES()
{cluster_count = sample_size;int cluster_1, cluster_2;int count = 1;while( cluster_count > 3 ){printf("-------------------%d--------------------\n", count);findMinDistance_BetweenClsuter_MAX(&cluster_1, &cluster_2);combineCluster(cluster_1, cluster_2);updateDistance(cluster_1);		cluster_count--;writeToFile(count++);}
}/** find two clusters the distance between them is minimun, and store the clusterID in @cluster_1 and @cluster_2, respectively.* */
void findMinDistance_BetweenClsuter_MAX(int* cluster_1, int* cluster_2)
{int i, j;double min_distance;int flag = 1;int object_1;int object_2;for( i = 1; i <= sample_size; i++ ){for( j = i + 1; j <= sample_size; j++ ){if( distance[i][0] == distance[j][0] || ( distance[0][i] == 0 || distance[0][j] == 0 ) ){continue;}else if( flag == 1 ){min_distance = distance[i][j];object_1 = i;object_2 = j;flag = 0;continue;}if( distance[i][j] < min_distance ){min_distance = distance[i][j];object_1 = i;object_2 = j;}}}*cluster_1 = distance[object_1][0];*cluster_2 = distance[object_2][0];
}/** combine the two clusters to one* */
void combineCluster(int cluster_1, int cluster_2)
{int i;for( i = 1; i <= sample_size; i++ ){if( distance[i][0] == cluster_2 ){distance[i][0] = cluster_1;}}
}/** update distance data* */
void updateDistance(int clusterID)
{int i, j;int flag = 1;int save_i;for( i = 1; i <= sample_size; i++ ){if( distance[i][0] == clusterID && flag == 1 ){flag = 0;save_i = i;continue;}else if( distance[i][0] == clusterID && flag == 0 ){distance[0][i] = 0;for( j = 1; j <= sample_size; j++ ){if( distance[i][j] > distance[save_i][j] ){distance[save_i][j] = distance[i][j];}}}}for( i = 1; i <= sample_size; i++ ){distance[i][save_i] = distance[save_i][i];}
}/** write the result of clustering information to file* */
void writeToFile(int round)
{int i;int j;int* auxiliary = (int*)malloc(sizeof(int) * (sample_size + 1));if( !auxiliary ){printf("auxiliary malloc error");exit(0);}for( i = 1; i <= sample_size; i++ )auxiliary[i] = 0;for( i = 1; i <= sample_size; i++ ){auxiliary[(int)distance[i][0]]++;}int *clusterID = (int*)malloc(sizeof(int) * (sample_size - round + 1));if( !clusterID ){printf("clusterID malloc error");exit(0);}int counter = 1;for( i = 1; i <= sample_size; i++ ){if( auxiliary[i] != 0 )clusterID[counter++] = i;}printf("writeToFile -----------round: %d\n", round);FILE** fwrite;fwrite = (FILE**)malloc(sizeof(FILE*) * (sample_size + 1));if( !fwrite ){printf("fwrite malloc error\n");exit(0);}char filename[200] = "";char instruction[200] = "";sprintf(instruction, "md  Round_%d", round);system(instruction);for( i = 1; i <= sample_size - round; i++ ){sprintf(filename, ".//Round_%d//cluster_%d.data", round, clusterID[i]);if( NULL == (fwrite[clusterID[i]] = fopen(filename, "w"))){printf("open file(%s) error\n", filename);exit(0);}}for( i = 1; i <= sample_size; i++ ){printf("%d ", (int)distance[i][0]);for( j = 1; j <= sample_dimension; j++ ){fprintf(fwrite[(int)distance[i][0]], "%f\t", data[i][j]);}fprintf(fwrite[(int)distance[i][0]], "\n");}for( i = 1; i <= sample_size - round; i++ ){fclose(fwrite[clusterID[i]]);}
}


这篇关于层次聚类算法之single-linkage和complete-linkage（C语言实现）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

原文地址:
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.chinasem.cn/article/185619。

相关文章

使用animation.css库快速实现CSS3旋转动画效果

使用animation.css库快速实现CSS3旋转动画效果

《使用animation.css库快速实现CSS3旋转动画效果》随着Web技术的不断发展，动画效果已经成为了网页设计中不可或缺的一部分，本文将深入探讨animation.css的工作原理，如何使用以及... 目录1. css3动画技术简介2. animation.css库介绍2.1 animation.cs
阅读更多...
Java进行日期解析与格式化的实现代码

Java进行日期解析与格式化的实现代码

《Java进行日期解析与格式化的实现代码》使用Java搭配ApacheCommonsLang3和Natty库,可以实现灵活高效的日期解析与格式化,本文将通过相关示例为大家讲讲具体的实践操作,需要的可以... 目录一、背景二、依赖介绍1. Apache Commons Lang32. Natty三、核心实现代
阅读更多...
使用雪花算法产生id导致前端精度缺失问题解决方案

使用雪花算法产生id导致前端精度缺失问题解决方案

《使用雪花算法产生id导致前端精度缺失问题解决方案》雪花算法由Twitter提出,设计目的是生成唯一的、递增的ID,下面：本文主要介绍使用雪花算法产生id导致前端精度缺失问题的解决方案,文中通过代... 目录一、问题根源二、解决方案1. 全局配置Jackson序列化规则2. 实体类必须使用Long封装类3.
阅读更多...
SpringBoot实现接口数据加解密的三种实战方案

SpringBoot实现接口数据加解密的三种实战方案

《SpringBoot实现接口数据加解密的三种实战方案》在金融支付、用户隐私信息传输等场景中,接口数据若以明文传输,极易被中间人攻击窃取,SpringBoot提供了多种优雅的加解密实现方案,本文将从原... 目录一、为什么需要接口数据加解密？二、核心加解密算法选择1. 对称加密（AES）2. 非对称加密（R
阅读更多...
基于Go语言实现Base62编码的三种方式以及对比分析

基于Go语言实现Base62编码的三种方式以及对比分析

《基于Go语言实现Base62编码的三种方式以及对比分析》Base62编码是一种在字符编码中使用62个字符的编码方式,在计算机科学中,,Go语言是一种静态类型、编译型语言,它由Google开发并开源,... 目录一、标准库现状与解决方案1. 标准库对比表2. 解决方案完整实现代码（含边界处理）二、关键实现细
阅读更多...
python通过curl实现访问deepseek的API

python通过curl实现访问deepseek的API

《python通过curl实现访问deepseek的API》这篇文章主要为大家详细介绍了python如何通过curl实现访问deepseek的API,文中的示例代码讲解详细,感兴趣的小伙伴可以跟随小编... API申请和充值下面是deepeek的API网站https://platform.deepsee
阅读更多...
如何合理管控Java语言的异常

如何合理管控Java语言的异常

《如何合理管控Java语言的异常》：本文主要介绍如何合理管控Java语言的异常问题,具有很好的参考价值,希望对大家有所帮助,如有错误或未考虑完全的地方,望不吝赐教... 目录1、介绍2、Thorwable类3、Error4、Exception类4.1、检查异常4.2、运行时异常5、处理方式5.1. 捕获异常
阅读更多...
SpringBoot实现二维码生成的详细步骤与完整代码

SpringBoot实现二维码生成的详细步骤与完整代码

《SpringBoot实现二维码生成的详细步骤与完整代码》如今,二维码的应用场景非常广泛,从支付到信息分享,二维码都扮演着重要角色,SpringBoot是一个非常流行的Java基于Spring框架的微... 目录一、环境搭建二、创建 Spring Boot 项目三、引入二维码生成依赖四、编写二维码生成代码五
阅读更多...
C语言中的常见进制转换详解(从二进制到十六进制)

C语言中的常见进制转换详解(从二进制到十六进制)

《C语言中的常见进制转换详解(从二进制到十六进制)》进制转换是计算机编程中的一个常见任务,特别是在处理低级别的数据操作时,C语言作为一门底层编程语言,在进制转换方面提供了灵活的操作方式,今天,我们将深... 目录1、进制基础2、C语言中的进制转换2.1 从十进制转换为其他进制十进制转二进制十进制转八进制十进
阅读更多...
MyBatisX逆向工程的实现示例

MyBatisX逆向工程的实现示例

《MyBatisX逆向工程的实现示例》本文主要介绍了MyBatisX逆向工程的实现示例,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随着小编来一起学习学... 目录逆向工程准备好数据库、表安装MyBATisX插件项目连接数据库引入依赖pom.XML生成实体类、
阅读更多...

Copyright China编程 23002807@qq.com

沪ICP备2023033072号-2