(x, digit_indices)
| 64 | |
| 65 | |
| 66 | def create_pairs(x, digit_indices): |
| 67 | pairs = [] |
| 68 | labels = [] |
| 69 | n = min([len(digit_indices[d]) for d in range(num_classes)]) - 1 |
| 70 | for d in range(num_classes): |
| 71 | for i in range(n): |
| 72 | z1, z2 = digit_indices[d][i], digit_indices[d][i + 1] |
| 73 | pairs += [[x[z1], x[z2]]] |
| 74 | inc = random.randrange(1, num_classes) |
| 75 | dn = (d + inc) % num_classes |
| 76 | z1, z2 = digit_indices[d][i], digit_indices[dn][i] |
| 77 | pairs += [[x[z1], x[z2]]] |
| 78 | labels += [1, 0] |
| 79 | return np.array(pairs), np.array(labels).astype(np.float32) |
| 80 | |
| 81 | |
| 82 | # get network |
no outgoing calls
no test coverage detected
searching dependent graphs…