int main()
{
cout << "==" << endl;
string a = "10000";
string b = "789";
int powerFig = 3;
string c;
/*c = dataAdd(a, b);
cout << a.c_str() << " + " << b.c_str() << " = " << endl;
cout << c.c_str() << endl << "==" << endl;*/
/*c = dataMul(a, b);
cout << a.c_str() << " * " << b.c_str() << " = " << endl;
cout << c.c_str() << endl << "==" << endl;*/
c = dataPower(a, powerFig);
cout << a.c_str() << "^" << powerFig << " = " << endl;
cout << c.c_str() << endl << "==" << endl;
return 1;
}
void BitHartigan(unsigned char**& data, int rows, int cols, int k, int*& lables, int round, double**& dataMap){
// centers cols is 8 size of data
int* random = new int[k];
int* randIndex = new int[k];
int* cCount = new int[k];
double** centers = new double*[k];
set<int> randomSet;
// init centers
for (int i = 0; i < k; i++){
centers[i] = new double[cols];
}
for (int i = 0; i < k; i++){
cCount[i] = 0;
//random[i] = i;
randIndex[i] = i;
int tmp = rand() % rows;
if (randomSet.find(tmp) == randomSet.end()){
random[i] = tmp;
//for (int a = 0; a < cols; a++){
// int block = a / 8;
// int ind = a % 8;
// centers[i][a] = dataMap[data[tmp][block]][ind];
// //centers[i][a] = getDataAt(data, tmp, a);
//}
for (int a = 0; a < cols/8; a++){
memcpy(¢ers[i][a * 8], dataMap[data[tmp][a]], 8);
}
}
else{
i--;
}
}
//compute distatnce between centers and data
double* xpower = dataPower(data, rows, cols, dataMap);
double* ypower = centersPower(centers, k, cols);
double** distances = BitDistance(data, rows, cols, centers, k, cols,dataMap,xpower,ypower);
int* index = new int[rows];
double* dist = new double[rows];
for (int i = 0; i < rows; i++){
double minDist = distances[i][0];
double minIndex = 0;
for (int j = 1; j < k; j++){
if (distances[i][j] < minDist){
minDist = distances[i][j];
minIndex = j;
}
}
dist[i] = minDist;
index[i] = minIndex;
}
//for (int i = 0; i < rows; i++)
// cout << index[i] << "\t";
//cout << endl;
//update centers
for (int i = 0; i < k; i++){
cCount[i] = 0;
for (int j = 0; j < cols; j++){
centers[i][j] = 0;
}
}
for (int j = 0; j < rows; j++){
int a = index[j];
cCount[a] ++;
for (int x = 0; x < cols; x++){
int block = x / 8;
int ind = x % 8;
centers[a][x] += dataMap[data[j][block]][ind];
//centers[a][x] += getDataAt(data, j, x);
}
//for (int x = 0; x < cols / 8; x++){
// memcpy(¢ers[a][x * 8], dataMap[data[j][x]], 8);
//}
}
//for (int i = 0; i < cols; i++)
// cout << centers[0][i] << "\t";
//cout << endl;
for (int i = 0; i < k; i++){
for (int j = 0; j < cols; j++){
centers[i][j] = centers[i][j]/cCount[i];
}
}
//begin iteration
for (int cnt = 0; cnt < round; cnt++){
for (int id = 0; id < rows; id++){
int newid = id;
int cluster1 = index[id];
if (cCount[cluster1]>1){
unsigned char* vx = data[id];
//double* vc1 = centers[cluster1];
double* vc1 = new double[cols];
for (int a = 0; a < cols; a++){
vc1[a] = centers[cluster1][a];
}
for (int a = 0; a < cols; a++){
int block = a / 8;
int ind = a % 8;
int tmp = dataMap[data[id][block]][ind];
centers[cluster1][a] = (vc1[a] * cCount[cluster1] - tmp) / (cCount[cluster1] - 1.0);
//centers[cluster1][a] = (vc1[a]*cCount[cluster1] - getDataAt(data,id,a)) / (cCount[cluster1] - 1.0);
}
cCount[cluster1] = cCount[cluster1] - 1;
double* dis = VectorBitDistance(vx, cols, centers, k, cols,dataMap);
double* deltaCost = new double[k];
for (int i = 0; i < k; i++){
deltaCost[i] = (cCount[i] / (cCount[i] + 1.0))*dis[i];
}
int cluster2 = 0;
double minValue = deltaCost[0];
for (int i = 1; i < k; i++){
double tmpValue = deltaCost[i];
if (minValue >= tmpValue){
cluster2 = i;
minValue = tmpValue;
}
}
if (cluster1 == cluster2){
for (int a = 0; a < cols; a++){
centers[cluster1][a] = vc1[a];
}
cCount[cluster1] = cCount[cluster1] + 1;
}
else{
for (int a = 0; a < cols; a++){
int block = a / 8;
int ind = a % 8;
int tmp = dataMap[data[id][block]][ind];
centers[cluster2][a] = (centers[cluster2][a] * cCount[cluster2] + tmp) / (cCount[cluster2] + 1.0);
//centers[cluster2][a] = (centers[cluster2][a] * cCount[cluster2] + getDataAt(data, id, a)) / (cCount[cluster2] + 1.0);
}
cCount[cluster2] = cCount[cluster2] + 1;
index[id] = cluster2;
}
}
}
//update centers
for (int i = 0; i < k; i++){
cCount[i] = 0;
for (int j = 0; j < cols; j++){
centers[i][j] = 0;
}
}
for (int j = 0; j < rows; j++){
int a = index[j];
cCount[a] ++;
for (int x = 0; x < cols; x++){
int block = x / 8;
int ind = x % 8;
centers[a][x] += dataMap[data[j][block]][ind];
//centers[a][x] += getDataAt(data, j, x);
}
}
for (int i = 0; i < k; i++){
for (int j = 0; j < cols; j++){
if (cCount[i] != 0)
centers[i][j] = centers[i][j] / cCount[i];
else
centers[i][j] = 0;
//centers[i][j] = centers[i][j] / cCount[i];
}
}
}
for (int i = 0; i < rows; i++){
lables[i] = index[i];
}
}
