數(shù)據(jù)挖掘?qū)嶒?yàn)報(bào)告-數(shù)據(jù)預(yù)處理

1、精選優(yōu)質(zhì)文檔-傾情為你奉上數(shù)據(jù)挖掘?qū)嶒?yàn)報(bào)告（一）數(shù)據(jù)預(yù)處理姓名：李圣杰班級(jí)：計(jì)算機(jī)1304學(xué)號(hào)： 一、實(shí)驗(yàn)?zāi)康?.學(xué)習(xí)均值平滑，中值平滑，邊界值平滑的基本原理2.掌握鏈表的使用方法3.掌握文件讀取的方法二、實(shí)驗(yàn)設(shè)備 PC一臺(tái)，dev-c+5.11三、實(shí)驗(yàn)內(nèi)容 數(shù)據(jù)平滑 假定用于分析的數(shù)據(jù)包含屬性age。數(shù)據(jù)元組中age的值如下（按遞增序）：13, 15, 16, 16, 19, 20, 20, 21, 22, 22, 25, 25, 25, 25, 30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70。使用你所熟悉的程序設(shè)計(jì)語言進(jìn)行編程，實(shí)現(xiàn)如下

2、功能（要求程序具有通用性）：(a) 使用按箱平均值平滑法對(duì)以上數(shù)據(jù)進(jìn)行平滑，箱的深度為3。(b) 使用按箱中值平滑法對(duì)以上數(shù)據(jù)進(jìn)行平滑，箱的深度為3。(c) 使用按箱邊界值平滑法對(duì)以上數(shù)據(jù)進(jìn)行平滑，箱的深度為3。四、實(shí)驗(yàn)原理 使用c語言，對(duì)數(shù)據(jù)文件進(jìn)行讀取，存入帶頭節(jié)點(diǎn)的指針鏈表中，同時(shí)計(jì)數(shù)，均值求三個(gè)數(shù)的平均值，中值求中間的一個(gè)數(shù)的值，邊界值將中間的數(shù)轉(zhuǎn)換為離邊界較近的邊界值五、實(shí)驗(yàn)步驟代碼專心-專注-專業(yè)#include <stdio.h>#include <stdlib.h>#include <math.h>#define DEEP 3#define

3、DATAFILE "data.txt"#define VPT 10/定義結(jié)構(gòu)體typedef struct chainint num;struct chain *next;* data;/定義全局變量data head,p,q;FILE *fp;int num,sum,count=0;int i,j;int *box;voidmean();voidmedain();voidboundary();int main ()/定義頭指針head=(data)malloc(sizeof(struct chain);head->next=NULL; /*打開文件*/fp=fope

4、n(DATAFILE,"r"); if(!fp)exit(0);p=head;while(!feof(fp)q=(data)malloc(sizeof(struct chain);q->next=NULL;fscanf(fp,"%d",&q->num); /*讀一個(gè)數(shù)據(jù)*/p->next=q;p=q;count+; /* 關(guān)閉文件 */fclose(fp);/輸出printf("源數(shù)據(jù)為:n");printf("共%d箱%d個(gè)數(shù)據(jù)n",count/DEEP,count);p=head-&g

5、t;next;count=1;num=1;while(p!=NULL)if(count=1)printf("箱%d:",num);if(count=DEEP)printf("%dn",p->num);num+;count=1;elseprintf("%d ",p->num);count+;p=p->next;mean();medain();boundary();scanf("%d",&i);return 0;/均值void mean()printf("均值平滑后為：")

6、;box=(int *)malloc(sizeof(int)*num);p=head->next;count=1;num=0;sum=0;while(p!=NULL)if(count=DEEP)count=1;sum=sum+p->num;boxnum=sum/DEEP;sum=0;num+;elsesum=sum+p->num;count+;p=p->next;for (i=0;i<num;i+)printf("n箱%d:",i+1);for (j=0;j<DEEP;j+)printf("%d ",boxi);p=h

7、ead->next;printf("n離群值為：");while(p!=NULL)for(i=0;i<num;i+)for (j=0;j<DEEP;j+)if(abs(p->num-boxi)>(int)VPT)printf("n箱%d:",i+1); printf("%d ",p->num); p=p->next;/中值void medain()printf("n中值平滑后為：");p=head->next;count=1;num=0;int mid;while(p

8、!=NULL)if(count=DEEP)boxnum=sum;count=1;num+;else if(count=DEEP/2|count=DEEP/2+1)if(DEEP%2)if(count=DEEP/2+1)sum=p->num;elseif(count=DEEP/2+1)sum=(p->num+mid)/2;elsemid=p->num;count+;p=p->next;for (i=0;i<num;i+)printf("n箱%d:",i+1);for (j=0;j<DEEP;j+)printf("%d "

9、,boxi);/邊界值void boundary()printf("n邊界值平滑后為：n");p=head->next;count=1;box=(int *)malloc(sizeof(int)*num*2);num=0;while(p!=NULL)if(count=DEEP)box2*num+1=p->num;count=1;num+;else if(count=1) box2*num=p->num; count+;p=p->next;p=head->next;count=1;num=0;while(p!=NULL)if(count=1)printf("箱%d:",num);if(p->num-box2*num)>(box2*num+1-p->num)printf("%d ",box2*num+1);elseprintf("%d ",box2*num);if(count=DEEP)printf(&qu