zshwuhan Goto Github PK

1m_generalization

1M_Generalization is a simple anonymization algorithm for 1:M dataset. It contains two sub-algorithms: Mondrian (for relational part) and Partition (transaction part). Both of them are straight forward, and can be repalced by more powerful algorithm with limtied modification.

2dks

2 Dimensional Kolmogorov-Smirnov test for goodness-of-fit

a-recsys

A Tensorflow based implicit recommender system

aaai-2015-demographics

Code and data for the AAAI 2015 paper entitled: "Predicting the demographics of Twitter users from social evidence using website traffic data"

aaai2021-rchawkes-gamma

aaltd16_fusion

ECML-PKDD 2016 AALTD Challenge

abtextsumm

Abstractive Summarization IJCAI paper code

academiccv

acctnetwork

Author Conference Citation Topic Model with Network Regularization

acl2016

Don't Count, Predict! An Automatic Approach to Learning Sentiment Lexicons for Short Text

acl2016-convincing-arguments

Code and data for ACL2016 article "Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM" by Ivan Habernal and Iryna Gurevych"

acl2016-supersense-embeddings

acne

activetransfer

Bayesian Active Transfer Learning

activityrecognitionpsl

Human activity recognition with Probabilistic Soft Logic

ad-link

This is the MATLAB code for AD-Link

adaptive-diversity-promoting

Adversarial Defense for Ensemble Models

adatreenat

This software contains three closed tree mining algorithms: an incremental one IncTreeNat, a sliding-window based one, WinTreeNat, and finally one that mines closed trees adaptively from data streams, AdaTreeNat. Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information.

adl-tm

Code associated with IJCAI 2016 paper "A Topic Model for Discovery of ADL"

adrealtimeanalysis

四川大学拓思艾诺广告流量实时分析项目

ads-recsys-datasets

This repository collects some datasets for Ads & RecSys uses, and provide easy-to-use hdf5 iterative access.

advanceddatastructures

大学时期学习数据结构的C++源码，包含AVL树、Treap、多个有序链表合并、二叉查找树、二项堆、红黑树、伸展树、跳表、栈与队列相互模拟以及最小(大)值求解、主席树的C++版实现，欢迎指出错误和提交贡献。

adversarial

Code and hyperparameters for the paper "Generative Adversarial Networks"

adversarial-counterfactual-learning-and-evaluation-for-recommender-system

adwin

ADWIN is an adaptive sliding window algorithm for detecting change and keeping updated statistics from a data stream, and use it as a black-box in place or counters in learning and mining algorithms initially not designed for drifting data.

affinity-loss

Unofficial implementation of "Max-margin Class Imbalanced Learning with Gaussian Affinity"

agtpy

Attributed Graph Toolbox for Python

ai-ml-bridgecut

A network bridge cutting algorithm (BridgeCut) that creates clusters based solely on network structure.

ai-ml-clustering

Implementation of multiple clustering algorithms (K-means, Bisecting K-means, Agglomerative Hierarchial Clustering with Intra-Cluster Similarity (IST), Centroid Similarity (CST), and UPGMA) for performance comparisons on different data sets.

ai-ml-hospital-admissions

Machine learning techniques used to predict hospital room admissions.