-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain.go
executable file
·183 lines (144 loc) · 3.72 KB
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
// Knn project main.go
package main
import (
"bufio"
"fmt"
"knn/knn"
"os"
"runtime"
"strconv"
"strings"
)
//var testFile string = "testing-data-small.txt"
var testFile string = "training-data.txt"
var dataSet *Data = newDataSet()
var cleanDataSet *Data = newDataSet()
func main() {
runtime.GOMAXPROCS(4)
file, err := os.Open(testFile)
checkError(err)
defer file.Close()
scanner := bufio.NewScanner(file)
for scanner.Scan() {
data := strings.Split(scanner.Text(), " ")
cuis, err := strconv.Atoi(data[0])
checkError(err)
dataSet.addRecipe(NewRecipe(cuis, data[1:]))
}
dataSet.calculateMetaData()
cleanData()
}
func RunKNN() {
knn.RunKNN(8, cleanDataSet, 2, WeightedJacardDistance, 7)
}
func cleanData() {
tooFewIngr := 0
badIngr := 0
badIngredients := make(map[string]bool)
ingrInfo := dataSet.ingredientInfo
for ingr, info := range ingrInfo {
if info.count < 2 {
badIngredients[ingr] = true
}
}
file, err := os.Open(testFile)
checkError(err)
defer file.Close()
scanner := bufio.NewScanner(file)
for scanner.Scan() {
data := strings.Split(scanner.Text(), " ")
ingredients := data[1:]
cuis, err := strconv.Atoi(data[0])
checkError(err)
recp := NewRecipe2(cuis)
for _, ingr := range ingredients {
if found, _ := badIngredients[ingr]; !found {
recp.AddIngredient(ingr)
} else {
badIngr++
}
}
if len(recp.Ingredients) > 2 {
cleanDataSet.addRecipe(recp)
} else {
tooFewIngr++
}
}
fmt.Println("Size of original dataset: ", len(dataSet.recipes))
fmt.Println("Size of cleaned dataset : ", len(cleanDataSet.recipes))
fmt.Println("Number of recipes below cutoff: ", tooFewIngr)
fmt.Println("Number of unique ingredients removed: ", len(badIngredients))
fmt.Println("Number of ingredients removed: ", badIngr)
i := 0
for key, _ := range badIngredients {
fmt.Print("\t", key)
i++
if i%7 == 6 {
fmt.Print("\n")
}
}
cleanDataSet.calculateMetaData()
RunKNN()
}
func checkError(err error) {
if err != nil {
fmt.Fprintf(os.Stderr, "Fatal error: %s", err.Error())
os.Exit(1)
}
}
func WeightedJacardDistance(v1 interface{}, v2 interface{}) float64 {
recp1 := v1.(*Recipe)
recp2 := v2.(*Recipe)
intersection := 0.0
union := 0.0
for name, _ := range recp1.getUniqueIngredients() {
if recp2.hasIngredient(name) {
intersection += (1.0 * dataSet.getMaxDiffProb(name))
}
union += (1.0 * dataSet.getMaxDiffProb(name))
//fmt.Println("\tDiff: ", dataSet.getMaxDiffProb(name))
}
for name, _ := range recp2.getUniqueIngredients() {
if !recp1.hasIngredient(name) {
union += (1.0 * dataSet.getMaxDiffProb(name))
}
}
return 1.0 - (float64(intersection) / float64(union))
}
func JacardDistance(v1 interface{}, v2 interface{}) float64 {
recp1 := v1.(*Recipe)
recp2 := v2.(*Recipe)
var intersection int = 0
var union int = 0
for name, _ := range recp1.getUniqueIngredients() {
if recp2.hasIngredient(name) {
intersection++
}
union++
}
for name, _ := range recp2.getUniqueIngredients() {
if !recp1.hasIngredient(name) {
union++
}
}
return 1.0 - (float64(intersection) / float64(union))
}
//TODO Haven't reviewed formula for this
func BagJacardDistance(v1 interface{}, v2 interface{}) float64 {
recp1 := v1.(*Recipe)
recp2 := v2.(*Recipe)
var intersection int = 0
var union int = 0
for _, name := range recp1.getIngredients() {
if recp2.hasIngredient(name) {
intersection++
}
union++
}
for _, name := range recp2.getIngredients() {
if !recp1.hasIngredient(name) {
union++
}
}
return 1.0 - (float64(intersection) / float64(union))
}