搜索资源列表
globle_graph_mining
- 图挖掘，图聚类 m文件主要包含4个功能：图的生成，图相似度分析，节点符号化，边权挖掘 ，详细说明见注释-graph mining, graph clustering
GraphGA-TabuHierarchicalLayout
- This article presents one of the most famous hierarchical graph drawing algorithms. Starting from a hierarchical graph we create a population of chromozoms that will be used in a Genetic Algorithm to get the best subjective representation: minimal ed
Snap-09-11-25
- 斯坦福大学社会网分析应用包用c语言编写，实现了社会网络分析算法库函数-Stanford Network Analysis Package (SNAP) is a general purpose network analysis and graph mining library. It is written in C++ and easily scales to massive networks with hundreds of millions of nodes, and billions of
DM_HIERARCHICAL_20_114_116
- Hierarchical Data Mining base on distance and graph
1xy7z.ZIP
- 基于图和双向搜索的频繁项集挖掘算法Based on the graph and the bidirectional search algorithm for mining frequent item sets-Based on the graph and the bidirectional search algorithm for mining frequent item sets
Fgloble_graphi
- 图挖掘，图聚类m文件主要包含4个功能：图的生成，图相似度分析析，节点符号化，边权挖掘，详细说明见注释，已通过测试。 -Graph mining site cluster m file contains four main functions: the generation of map, Figure similarity analysis, node symbols, tap the edge of the right described in detail in the Notes, h
tensorCode
- it is for graph mining
tensor_toolbox
- it is for graph mining
parsemis-2008-12-01
- this tool of graph mining
dfs
- dfs code for graph mining
fsg
- FSG sourcecode for graph mining
gaston
- gaston graph mining tool
gspan
- gspan sourcecode for graph mining
利用簇模拟汽车控制
- 利用labview编程： 6. 利用簇模拟汽车控制，如右图所示，控制面板可以对显示面板中的参量进行控制。油门控制转速，转速＝油门*100，档位控制时速,时速＝档位*40，油量随VI运行时间减少。 注意：档位为整数，油量减少速度与档位有关。 7.1 利用随机数发生器仿真一个0到5V的采样信号，每200ms采一个点，共采集50个点，采集完后一次性显示在Waveform Graph上。 7.2 在上题的基础上再增加1路电压信号采集，此路电压信号的范围为5到10V，采样间
kmeans_report
- 数据挖掘kmeans图像聚类实验报告 用 VC 或 Java 实现 k-means 聚类算法， 分别以迭代次数及分配不再发生变化为算法终止条件，用图片（自己选择）作为数据集，比较运行时间（画出时间与像素点的关系曲线图，因此须用多幅像素个数不同的图片进行实验） 提交实验报告与源代码。 -Data mining to achieve the k-means clustering algorithm the kmeans image clustering experiment report wit
gSpan
- gSpan is a software package of mining frequent graphs in a graph database. Given a collection of graphs and a minimum support threshold, gSpan is able to find all of the subgraphs whose frequency is above the threshold.
okapi-master
- Okapi is a library of Machine Learning and graph mining algorithms for Giraph.
Top-10-Algorithms-in-Data-Mining
- 在2006年9月召开的ICDM会议上，邀请了ACM KDD创新大奖(InnovationAward)和 Top 10 Algorithms in Data Mining IEEEICDM研究贡献奖(Research Contributions Award)的获奖者们来参与数据挖掘10大算 法的选举，每人提名10种他认为最重要的算法-Classification，Statistical Learning，Top 10 Algorithms in Data Mining，material
deepwalk-master
- deepwalk，一种深度学习中对图的挖掘的应用(Deepwalk, an application of deep learning to graph mining)