I hereby claim:
- I am dkn22 on github.
- I am datknguyen (https://keybase.io/datknguyen) on keybase.
- I have a public key ASBUZDsQ0sdOEy5whjqhEq8z99i47YDWGTvz5duIzHmQFAo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
import pandas as pd | |
from embedder.regression import Embedder | |
from embedder.preprocessing import (categorize, | |
pick_emb_dim, encode_categorical) | |
rossman = pd.read_csv('rossman.csv') | |
y = rossman['Sales'] | |
X = rossman.drop('Sales', axis=1) | |
cat_vars = categorize(rossman) |
from embedder.regression import Embedder | |
from sklearn.pipeline import Pipeline | |
from xgboost import XGBRegressor | |
embedder = Embedder(embedding_dict) | |
embedder.fit(X_encoded, y) | |
X_embedded = embedder.transform(X) | |
# X_embedded = embedder.fit_transform(X, y) |
from embedder.regression import Embedder | |
from embedder.assessment import visualize | |
import matplotlib.pyplot as plt | |
embedder = Embedder(embedding_dict) | |
embedder.fit(X_encoded, y) | |
embeddings = embedder.get_embeddings() | |
print(type(embeddings)) # a dictionary |
import numpy as np | |
from copy import deepcopy | |
def random_contraction(graph, n_repeat=None): | |
""" | |
graph: undirected graph as a dict of lists | |
(adjacency list representation) | |
n_repeat: Number of repeated independent trials | |
""" | |
if n_repeat is None: |
class SCC(): | |
def __init__(self, graph): | |
self.graph = graph | |
self.time = 0 | |
self.visited = [] | |
self.finish_times = {} | |
def transpose_graph(self): | |
g_rev = {} |
class UnionFind: | |
def __init__(self, ids): | |
self._id = {i: i for i in ids} # pointer to the leader | |
self.sizes = {i: 1 for i in ids} | |
self.n_components = len(set(self._id)) | |
def _root(self, i): | |
j = i | |
while (j != self._id[j]): | |
self._id[j] = self._id[self._id[j]] |
import numpy as np | |
import functools | |
def knapsack(capacity, items): | |
n = len(items) | |
A = np.zeros((n, capacity)) | |
for i in range(n): | |
value, weight = items[i] |
import numpy as np | |
import numba | |
@numba.jit | |
def floyd_marshall(graph): | |
n = len(graph.nodes) | |
A = np.full((n, n, n), fill_value=np.inf) | |
# base cases | |
for edge in graph.edges: |
import numpy as np | |
import numba | |
@numba.jit | |
def bellman_ford(graph, start_vertex): | |
n = len(graph.nodes) | |
A = np.zeros((n+1, n)) | |
A[0, :] = np.inf | |
A[0, start_vertex] = 0 | |