机译:基于邻接矩阵的频繁连通子图挖掘新算法
Advanced Technologies Application Center, Havana, Cuba Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Puebla, Mexico;
rnAdvanced Technologies Application Center, Havana, Cuba Faculty of Mathematics and Computer Sciences, University of Havana, Havana, Cuba;
rnComputer Science Department, National Institute of Astrophysics, Optics and Electronics, Puebla, Mexico;
rnAdvanced Technologies Application Center, Havana, Cuba;
rnComputer Science Department, National Institute of Astrophysics, Optics and Electronics, Puebla, Mexico;
data mining; graph mining; frequent subgraphs; labeled graphs; canonical adjacency matrices;
机译:基于邻接矩阵和权重的不确定最大频繁子图挖掘算法
机译:在多图集合上频繁近似子图挖掘的规范邻接矩阵的扩展
机译:基于迭代MapReduce的频繁子图挖掘算法
机译:挖掘频繁的k边连接子图
机译:频繁的子图挖掘算法适应非编码RNA拓扑比对和功能预测
机译:RASMA:用于采矿最大频繁子图的反向搜索算法
机译:基于频繁的子图挖掘算法设计LDPC模拟解码器的优化方法