一个大小为3的clique 一个大小为3的cliqueclique是一个图中两两相邻的一个点集,或是一个完全子图(complete subgraph),如右图中..
基于132个网页-相关网页
极大完全子图 extremal great complete graph
Some nodes are not satisfied with complete subgraph, or are satisfied with complete subgraph for different communities at same time. A node rate of community ownership is proposed for solving those problems.
对于有些节点并不满足完全子图,或在不同社区同时满足完全子图的情况,采用节点社区归属度解决该节点的归属问题。
参考来源 - 基于完全子图的社区发现算法Next, the dissertation introduces an algorithm for mining association rules based association graph, analyses its performance, points out its defects, then puts forward two improved algorithms—one based on complete sub-graph and another based on ordered tree.
接着介绍了基于关联图的关联规则挖掘算法,对算法性能进行了分析,指出了其存在的缺陷,并提出了两种改进的关联规则高效挖掘算法—基于完全子图的改进算法和基于有序树的改进算法。
参考来源 - 关联规则挖掘算法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐