IV.5. 2.Quelques Interfaces de
l'application
IV.5.2.1 Formulaire Principal

IV.5.2.2 Formulaire de Chargement de données
à segmenter

IV.5.2.3. Formulaire d'interprétation et
Exploration

IV.5.2.4. Formulaire de Prédiction

IV.5 Les codes de
l'application
package datateam;
/**
*
* @author kalo
*/
public class Algorithme {
public Double [] centregravite(int n,Double[][] tableau){
Algorithme t=new Algorithme();
Double [] re=new Double [4];
Double[] som=new Double[n];
for(int i=0;i<4;i++){
for(int j=0;j<n;j++){
som[j]=tableau[j][i];
}
re[i]=t.moyenne(n, som);
}
return re;
}
public Double moyenne(int n,Double[]tab){
Double rep=0.0;
Double som=0.0;
for(int i=0;i<n;i++){
som=som+tab[i];
}
rep=som/n;
return rep;
}
public Double inertie(Double [][]individu,Double
[]centre){
Double ret=0.0;
Double[] t=new Double[4];
Double som=0.0;
Algorithme r=new Algorithme();
for(int i=0;i<individu.length;i++){
for(int j=0;j<4;j++){
t[j]=individu[i][j];
}
som=som+r.distance(t, centre);
}
ret=som;
return ret;
}
public Double distance(Double []individu,Double []centre){
Double retour=0.0;
Double somecart=0.0;
for(int i=0;i<centre.length;i++){
somecart=somecart+Math.pow(((centre[i]-(individu[i]))),(int)2);
}
retour=somecart;
return retour;
}
public Double inertieintraclasse(int k,Double[] poid,Double
inertiegroupe,Double []individu,Double []centre){
Double retour=0.0;
Double Iw=0.0;Double resulta;
Algorithme r=new Algorithme();
for(int i=0;i<k;i++){
// resulta=r.inertie(individu, centre);
// Double t=poid[i]*resulta;
// Iw=Iw+t;
}
return retour;
}
public Double inertieinterclasse(int k,Double[] poid,Double
[]centregroupe,Double []centre){
Double retour=0.0;
Double Ib=0.0;Double resulta;
Algorithme r=new Algorithme();
for(int i=0;i<k;i++){
resulta=r.distance(centregroupe, centre);
Double t=poid[i]*resulta;
Ib=Ib+t;
}
return retour;
}public Double minimum(Double x,Double y,Double z){
Double ret=0.0;
Double min=x;
if(Double.compare(x, y)<0 && Double.compare(x,
z)<0){
ret=x;
}else{}
if(Double.compare(y, x)<0 && Double.compare(y,
z)<0){
ret=y;
}else{}
if(Double.compare(z, x)<0 && Double.compare(z,
y)<0) {
ret=z;
}else{}
return ret;
}
public double minimums(double x,double y,double z){
double ret=0.0;
double var;
var=x;
if (x<y && x<z) {
ret=x;
}else if(y<x && y<z){
ret=y;
}else{
ret=z;
}
return ret;
}
public double maximum(double x,double y,double z){
double ret=0.0;
double var;
var=x;
if (x>y && x>z) {
ret=x;
}else if(y>x && y>z){
ret=y;
}else{
ret=z;
}
return ret;
}
}
|