zakimjz Goto Github PK

arabesque

Scalable Graph Mining

bamnet

BAMnet: Bidirectional Attentive Memory Networks for Question Answering over Knowledge Graphs

blosom

BLOSOM algorithm to mine arbitrary frequent boolean expressions

charm

CHARM algorithm for closed itemset mining

charm-l

CHARM-L algorithm to generate the closed itemset lattice and non-redundant rules

clicks

CLICKS finds subspace clusters in categorical data using a k-partite clique mining approach.

contextshapes

ContextShapes Algorithm for rigid-body protein shape matching and docking

cspade

cSPADE: mining frequent sequence patterns with constraints (extension of SPADE)

dagger-index

DAGGER: Reachability Index for Dynamic Graphs

distgraph

Distributed Graph Mining on a Massive "Single" Graph

dmbook-slides

Data Mining Book Slides

dmtl

Data Mining Template Library

dske

eclat

Original ECLAT algorithm for frequent itemset mining

fetilda

Source code and Data Repository for FETILDA: Fin-tuned Embeddings of Texts In Long Document Analysis

flyvec

A biologically inspired method to create sparse, binary word vectors

genmax

Genmax algorithm for mining maximal frequent itemsets

gpu_graph_mining

GPU graph mining

grail

GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs

graphflow

Code & data accompanying the IJCAI 2020 paper "GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension"

hg2vec

HG2Vec is a language model that learns word embeddings utilizing only dictionaries and thesauri. Our model reaches the state-of-art on multiple word similarity and relatedness benchmarks.

ibmgenerator

IBM Synthetic Data Generator for Itemsets and Sequences

idgl

Code & data accompanying the NeurIPS 2020 paper "Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings".

iqra

Query Sets for Citation Networks

kate

KATE: K-Competitive Autoencoder for Text

mindnf

The minDNF method samples minimal boolean expressions in DNF.

musk

MUSK Algorithm for Sampling Maximal Subgraphs

neweclat

Clean code that implements eclat, charm and maximal itemset mining

origami

Origami: Algorithm for Representative Orthogonal Graph Mining and Sampling

oss

Output space sampling for graph pattern mining