GemsLab / VoG_Graph_Summarization
Licence: other
Summarization of static graphs using the Minimum Description Length principle
Stars: ✭ 25
Programming Languages
Projects that are alternatives of or similar to VoG Graph Summarization
uSource
uSource is a plugin for importing MDL / BSP / VMT / VTF and etc... resources to Unity!
Stars: ✭ 44 (+76%)
Mutual labels: mdl
war3-model
TypeScript-based mdl/mdx (Warcraft 3 model formats) converter/renderer
Stars: ✭ 56 (+124%)
Mutual labels: mdl
zork
Full C++-17 port of the 616-point version of Zork from MIT circa 1978-1981
Stars: ✭ 16 (-36%)
Mutual labels: mdl
react-native-material-design-searchbar
react native material design searchbar
Stars: ✭ 51 (+104%)
Mutual labels: mdl
herd-mdl
Herd-MDL, a turnkey managed data lake in the cloud. See https://finraos.github.io/herd-mdl/ for more information.
Stars: ✭ 11 (-56%)
Mutual labels: mdl
campus-leaflets
校园传单是一个使用 Node.js、MongoDB、Koa、EJS、MDL、Less、RequireJS 和 Gulp 开发的 Node 应用程序。
Stars: ✭ 16 (-36%)
Mutual labels: mdl
gatling
Hydra-enabled GPU path tracer that supports MaterialX and MDL.
Stars: ✭ 159 (+536%)
Mutual labels: mdl
interpretable-ml
Techniques & resources for training interpretable ML models, explaining ML models, and debugging ML models.
Stars: ✭ 17 (-32%)
Mutual labels: interpretable
mdl-docs
The MDL Programming Language by S. W. Galley and Greg Pfister
Stars: ✭ 21 (-16%)
Mutual labels: mdl
source-engine-model-loader
Three.js loader for parsing Valve's Source Engine models
Stars: ✭ 54 (+116%)
Mutual labels: mdl
xai-iml-sota
Interesting resources related to Explainable Artificial Intelligence, Interpretable Machine Learning, Interactive Machine Learning, Human in Loop and Visual Analytics.
Stars: ✭ 51 (+104%)
Mutual labels: interpretable
Material Design Lite
Material Design Components in HTML/CSS/JS
Stars: ✭ 31,931 (+127624%)
Mutual labels: mdl
Paddle Lite
Multi-platform high performance deep learning inference engine (『飞桨』多平台高性能深度学习预测引擎）
Stars: ✭ 5,808 (+23132%)
Mutual labels: mdl
Version 1.3 Code for VoG: Summarizing and Understanding Large Graphs Danai Koutra, U Kang, Jilles Vreeken, and Christos Faloutsos http://www.cs.cmu.edu/~dkoutra/papers/VoG.pdf Contact: Danai Koutra, [email protected] To run: type 'make' Difference from Version 1.0: Using dynamic programming and the technique of memoization to speed up the application of the GREEDY'nFORGET heuristic. Algorithm: Input: graph G Step 1: Subgraph Generation. Generate candidate – possibly overlapping – subgraphs using one or more graph decomposition methods. Step 2: Subgraph Labeling. Characterize each subgraph as a perfect structure x \in Omega, or an approximate structure by using MDL to find the type x that locally minimizes the encoding cost. Populate the candidate set C. Step 3: Summary Assembly. Use the heuristics PLAIN, TOP10, TOP100, GREEDY’NFORGET (Sec. 4.3) to select a non-redundant subset from the candidate structures to instantiate the graph model M. Pick the model of the heuristic with the lowest description cost. Return graph summary M and its encoding cost. Change Log: =========== July 1, 2015 - removed vpi(): using l2cnk.m to compute the log of n-choose-k efficiently leads to 30x speedup in the chocolate-wiki dataset - tic/toc instead of cputime to compute the runtime: following the recommendation at http://www.mathworks.com/help/matlab/ref/cputime.html January 9, 2015 - Replaced the config.py file July 30, 2014 - Fixed ordering of nodes in cliques June 15, 2014 - Made the greedyNforget 100x faster by exploiting memoization
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].