zhangjunhua Goto Github PK

adf

algorithm

ansj_seg

ansj分词.ict的真正java实现.分词效果速度都超过开源版的ict. 中文分词,人名识别,词性标注,用户自定义词典

bfl

TKDE 2017/Reachability Querying: Can It Be Even Faster?

blog

myblogrepository

c-tester

cpp_primer

Source code of C++ primer 5th Ed.

ctt

daf

Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together

data-replication

大数据冗余存储放置策略

distributed_reachability_index

draw.io

Source to www.draw.io

fast_ethernet

gboost

A fork of Sebastian Nowozin's and Koji Tsuda's gboost code

geminigraph

A computation-centric distributed graph processing system.

giraphbooksourcecodes

grami

GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Also, GraMi supports user-defined structural and semantic constraints over the results, as well as approximate results. For more details, check our paper: Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB, 7(7):517-528, 2014.

graph-processing-bibliography

gson_examples

learngit

minigwac

异常检测算法

mpi_c_examples

overleaf

response

scalemine

Parallel Frequent Subgraph Mining

shixun

zhangjunhua.github.io

zjh.github.io