API tools faq
paste
Advertisement
Guest User

MeGS_runtime_experiment_results

a guest
Feb 27th, 2020
152
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 11.56 KB | None | 0 0
raw download clone embed print report
  1.  
  2. ===========================================
  3. FILE: "running-example.grd"
  4. MDL NMI RUNTIME
  5. 847.5393 1.0000 2.3920
  6. ---------------------------------------------
  7. 847.5393 1.0000 2.3920
  8. +-0.0000 +-0.0000 +-0.0000
  9. Best NMI found by MDL is 1.0000
  10. MDL = 847.5393, ( CLIQUE : 119.15 , SPARSE : 79.23 , BIPARTITE : 110.47 , TREE : 150.77 , HUB : 107.82 , ).
  11. Time used for clustering: 0.06 s
  12. NMI = 1.0000
  13. --------- Structure Details: -----------------
  14. ClusterMap 0:
  15. >> Best graph type is CliqueCluster
  16. CLIQUE: 119.15040835643893
  17. HUB: Infinity
  18. TREE [MDL=Infinity, ERROR = 45 / 63]
  19. -->[ s ]
  20. BIPARTITE: Infinity PC=56.51011407790432 CC=Infinity
  21. SPARSE: Infinity
  22. ClusterMap 1:
  23. >> Best graph type is SparseCluster
  24. CLIQUE: Infinity
  25. HUB: 82.91248842546274
  26. TREE [MDL=88.54, ERROR = 10 / 34]
  27. -->[ s ]
  28. BIPARTITE: 89.27512357668847 PC=46.67816719219458 CC=42.59695638449389
  29. SPARSE: 79.22853705248974
  30. ClusterMap 2:
  31. >> Best graph type is BipartiteCluster
  32. CLIQUE: Infinity
  33. HUB: 145.04660605171796
  34. TREE [MDL=161.64, ERROR = 26 / 82]
  35. -->[ s ]
  36. BIPARTITE: 110.47393203277437 PC=58.666811730752 CC=51.80712030202236
  37. SPARSE: 142.3781141455466
  38. ClusterMap 3:
  39. >> Best graph type is TreeCluster
  40. CLIQUE: Infinity
  41. HUB: Infinity
  42. TREE [MDL=150.77, ERROR = 3 / 60]
  43. -->[ s ]
  44. BIPARTITE: Infinity PC=69.66224364140456 CC=Infinity
  45. SPARSE: 151.14645465160157
  46. ClusterMap 4:
  47. >> Best graph type is HubCluster
  48. CLIQUE: Infinity
  49. HUB: 107.81892388015487
  50. TREE [MDL=192.83, ERROR = 8 / 190]
  51. -->[ s ]
  52. BIPARTITE: Infinity PC=71.2180801102146 CC=Infinity
  53. SPARSE: 175.67428507278504
  54.  
  55. ----------------------------------------------
  56.  
  57. ===========================================
  58. FILE: "adjnoun.gml"
  59. MDL NMI RUNTIME
  60. 2100.6267 0.0242 2.8070
  61. ---------------------------------------------
  62. 2100.6267 0.0242 2.8070
  63. +-0.0000 +-0.0000 +-0.0000
  64. Best NMI found by MDL is 0.0242
  65. MDL = 2100.6267, ( SPARSE : 551.30 , HUB : 457.61 , ).
  66. Time used for clustering: 0.16 s
  67. NMI = 0.0242
  68. --------- Structure Details: -----------------
  69. ClusterMap 0:
  70. >> Best graph type is SparseCluster
  71. CLIQUE: Infinity
  72. HUB: Infinity
  73. TREE [MDL=Infinity, ERROR = 0 / 0]
  74. -->[ s ]
  75. BIPARTITE: Infinity PC=128.1560742685067 CC=Infinity
  76. SPARSE: 551.2975437309431
  77. ClusterMap 1:
  78. >> Best graph type is HubCluster
  79. CLIQUE: Infinity
  80. HUB: 457.6055116727011
  81. TREE [MDL=545.56, ERROR = 99 / 364]
  82. -->[ s ]
  83. BIPARTITE: Infinity PC=97.83535750584333 CC=Infinity
  84. SPARSE: 483.65466636900436
  85.  
  86. ----------------------------------------------
  87.  
  88. ===========================================
  89. FILE: "running-example.grd"
  90. MDL NMI RUNTIME
  91. 847.5393 1.0000 2.5810
  92. ---------------------------------------------
  93. 847.5393 1.0000 2.5810
  94. +-0.0000 +-0.0000 +-0.0000
  95. Best NMI found by MDL is 1.0000
  96. MDL = 847.5393, ( HUB : 107.82 , BIPARTITE : 110.47 , CLIQUE : 119.15 , TREE : 150.77 , SPARSE : 79.23 , ).
  97. Time used for clustering: 0.10 s
  98. NMI = 1.0000
  99. --------- Structure Details: -----------------
  100. ClusterMap 0:
  101. >> Best graph type is HubCluster
  102. CLIQUE: Infinity
  103. HUB: 107.81892388015487
  104. TREE [MDL=192.83, ERROR = 9 / 211]
  105. -->[ s ]
  106. BIPARTITE: Infinity PC=71.2180801102146 CC=Infinity
  107. SPARSE: 175.67428507278504
  108. ClusterMap 1:
  109. >> Best graph type is BipartiteCluster
  110. CLIQUE: Infinity
  111. HUB: 145.04660605171796
  112. TREE [MDL=161.64, ERROR = 26 / 79]
  113. -->[ s ]
  114. BIPARTITE: 110.47393203277437 PC=58.666811730752 CC=51.80712030202236
  115. SPARSE: 142.3781141455466
  116. ClusterMap 2:
  117. >> Best graph type is CliqueCluster
  118. CLIQUE: 119.15040835643893
  119. HUB: Infinity
  120. TREE [MDL=Infinity, ERROR = 44 / 64]
  121. -->[ s ]
  122. BIPARTITE: Infinity PC=56.51011407790432 CC=Infinity
  123. SPARSE: Infinity
  124. ClusterMap 3:
  125. >> Best graph type is TreeCluster
  126. CLIQUE: Infinity
  127. HUB: Infinity
  128. TREE [MDL=150.77, ERROR = 3 / 60]
  129. -->[ s ]
  130. BIPARTITE: Infinity PC=69.66224364140456 CC=Infinity
  131. SPARSE: 151.14645465160157
  132. ClusterMap 4:
  133. >> Best graph type is SparseCluster
  134. CLIQUE: Infinity
  135. HUB: 82.91248842546274
  136. TREE [MDL=88.54, ERROR = 10 / 24]
  137. -->[ s ]
  138. BIPARTITE: 84.9158854962769 PC=46.67816719219458 CC=38.23771830408233
  139. SPARSE: 79.22853705248974
  140.  
  141. ----------------------------------------------
  142.  
  143. ===========================================
  144. FILE: "running-example.grd"
  145. MDL NMI RUNTIME
  146. 847.6571 1.0000 1.8430
  147. ---------------------------------------------
  148. 847.6571 1.0000 1.8430
  149. +-0.0000 +-0.0000 +-0.0000
  150. Best NMI found by MDL is 1.0000
  151. MDL = 847.6571, ( SPARSE : 79.23 , BIPARTITE : 110.59 , TREE : 150.77 , CLIQUE : 119.15 , HUB : 107.82 , ).
  152. Time used for clustering: 0.09 s
  153. NMI = 1.0000
  154. --------- Structure Details: -----------------
  155. ClusterMap 0:
  156. >> Best graph type is SparseCluster
  157. CLIQUE: Infinity
  158. HUB: 82.91248842546274
  159. TREE [MDL=88.54, ERROR = 10 / 29]
  160. -->[ s ]
  161. BIPARTITE: Infinity PC=46.67816719219458 CC=Infinity
  162. SPARSE: 79.22853705248974
  163. ClusterMap 1:
  164. >> Best graph type is BipartiteCluster
  165. CLIQUE: Infinity
  166. HUB: 145.04660605171796
  167. TREE [MDL=161.64, ERROR = 24 / 59]
  168. -->[ s ]
  169. BIPARTITE: 110.59173577887918 PC=58.666811730752 CC=51.92492404812718
  170. SPARSE: 142.3781141455466
  171. ClusterMap 2:
  172. >> Best graph type is TreeCluster
  173. CLIQUE: Infinity
  174. HUB: Infinity
  175. TREE [MDL=150.77, ERROR = 3 / 46]
  176. -->[ s ]
  177. BIPARTITE: Infinity PC=69.66224364140456 CC=Infinity
  178. SPARSE: 151.14645465160157
  179. ClusterMap 3:
  180. >> Best graph type is CliqueCluster
  181. CLIQUE: 119.15040835643893
  182. HUB: Infinity
  183. TREE [MDL=Infinity, ERROR = 44 / 60]
  184. -->[ s ]
  185. BIPARTITE: Infinity PC=56.51011407790432 CC=Infinity
  186. SPARSE: Infinity
  187. ClusterMap 4:
  188. >> Best graph type is HubCluster
  189. CLIQUE: Infinity
  190. HUB: 107.81892388015487
  191. TREE [MDL=192.83, ERROR = 9 / 210]
  192. -->[ s ]
  193. BIPARTITE: Infinity PC=71.2180801102146 CC=Infinity
  194. SPARSE: 175.67428507278504
  195.  
  196. ----------------------------------------------
  197.  
  198. ===========================================
  199. FILE: "running-example.grd"
  200. MDL NMI RUNTIME
  201. 845.1537 1.0000 2.7100
  202. ---------------------------------------------
  203. 845.1537 1.0000 2.7100
  204. +-0.0000 +-0.0000 +-0.0000
  205. Best NMI found by MDL is 1.0000
  206. MDL = 845.1537, ( TREE : 148.05 , BIPARTITE : 110.81 , SPARSE : 79.23 , HUB : 107.82 , CLIQUE : 119.15 , ).
  207. Time used for clustering: 0.10 s
  208. NMI = 1.0000
  209. --------- Structure Details: -----------------
  210. ClusterMap 0:
  211. >> Best graph type is TreeCluster
  212. CLIQUE: Infinity
  213. HUB: Infinity
  214. TREE [MDL=148.05, ERROR = 2 / 34]
  215. -->[ s ]
  216. BIPARTITE: Infinity PC=69.66224364140456 CC=Infinity
  217. SPARSE: 151.14645465160157
  218. ClusterMap 1:
  219. >> Best graph type is BipartiteCluster
  220. CLIQUE: Infinity
  221. HUB: 145.04660605171796
  222. TREE [MDL=161.64, ERROR = 24 / 59]
  223. -->[ s ]
  224. BIPARTITE: 110.81382585198483 PC=58.666811730752 CC=52.147014121232836
  225. SPARSE: 142.3781141455466
  226. ClusterMap 2:
  227. >> Best graph type is SparseCluster
  228. CLIQUE: Infinity
  229. HUB: 82.91248842546274
  230. TREE [MDL=88.54, ERROR = 8 / 18]
  231. -->[ s ]
  232. BIPARTITE: 91.1199805790938 PC=46.67816719219458 CC=44.44181338689923
  233. SPARSE: 79.22853705248974
  234. ClusterMap 3:
  235. >> Best graph type is HubCluster
  236. CLIQUE: Infinity
  237. HUB: 107.81892388015487
  238. TREE [MDL=192.83, ERROR = 9 / 190]
  239. -->[ s ]
  240. BIPARTITE: Infinity PC=71.2180801102146 CC=Infinity
  241. SPARSE: 175.67428507278504
  242. ClusterMap 4:
  243. >> Best graph type is CliqueCluster
  244. CLIQUE: 119.15040835643893
  245. HUB: Infinity
  246. TREE [MDL=Infinity, ERROR = 45 / 64]
  247. -->[ s ]
  248. BIPARTITE: Infinity PC=56.51011407790432 CC=Infinity
  249. SPARSE: Infinity
  250.  
  251. ----------------------------------------------
  252.  
  253. ===========================================
  254. FILE: "power.gml"
  255. MDL NMI RUNTIME
  256. 75475.5888 0.0000 12978.4050
  257. ---------------------------------------------
  258. 75475.5888 0.0000 12978.4050
  259. +-0.0000 +-0.0000 +-0.0000
  260. Best NMI found by MDL is 0.0000
  261. MDL = 75475.5888, ( TREE : 72261.20 , SPARSE : 531.86 , ).
  262. Time used for clustering: 570.56 s
  263. NMI = 0.0000
  264. --------- Structure Details: -----------------
  265. ClusterMap 0:
  266. >> Best graph type is TreeCluster
  267. CLIQUE: Infinity
  268. HUB: Infinity
  269. TREE [MDL=72261.20, ERROR = 1473 / 183538]
  270. -->[ s ]
  271. BIPARTITE: Infinity PC=4982.71157645909 CC=Infinity
  272. SPARSE: 78339.07908599322
  273. ClusterMap 1:
  274. >> Best graph type is SparseCluster
  275. CLIQUE: Infinity
  276. HUB: Infinity
  277. TREE [MDL=Infinity, ERROR = 0 / 62]
  278. -->[ s ]
  279. BIPARTITE: Infinity PC=456.66158751352503 CC=Infinity
  280. SPARSE: 531.8605689810003
  281.  
  282. ----------------------------------------------
  283.  
  284. ===========================================
  285. FILE: "power.gml"
  286. MDL NMI RUNTIME
  287. 75495.0415 0.0000 18420.5770
  288. ---------------------------------------------
  289. 75495.0415 0.0000 18420.5770
  290. +-0.0000 +-0.0000 +-0.0000
  291. Best NMI found by MDL is 0.0000
  292. MDL = 75495.0415, ( TREE : 71529.70 , SPARSE : 608.77 , ).
  293. Time used for clustering: 1167.11 s
  294. NMI = 0.0000
  295. --------- Structure Details: -----------------
  296. ClusterMap 0:
  297. >> Best graph type is TreeCluster
  298. CLIQUE: Infinity
  299. HUB: Infinity
  300. TREE [MDL=71529.70, ERROR = 1444 / 161310]
  301. -->[ s ]
  302. BIPARTITE: Infinity PC=4991.14190649672 CC=Infinity
  303. SPARSE: 77738.08856021597
  304. ClusterMap 1:
  305. >> Best graph type is SparseCluster
  306. CLIQUE: Infinity
  307. HUB: Infinity
  308. TREE [MDL=Infinity, ERROR = 0 / 23]
  309. -->[ s ]
  310. BIPARTITE: Infinity PC=570.7295743454785 CC=Infinity
  311. SPARSE: 608.7744075440778
  312.  
  313. ----------------------------------------------
  314.  
  315. ===========================================
  316. FILE: "power.gml"
  317. MDL NMI RUNTIME
  318. 75606.0279 0.0000 14115.4450
  319. ---------------------------------------------
  320. 75606.0279 0.0000 14115.4450
  321. +-0.0000 +-0.0000 +-0.0000
  322. Best NMI found by MDL is 0.0000
  323. MDL = 75606.0279, ( SPARSE : 598.98 , TREE : 71696.40 , ).
  324. Time used for clustering: 517.36 s
  325. NMI = 0.0000
  326. --------- Structure Details: -----------------
  327. ClusterMap 0:
  328. >> Best graph type is SparseCluster
  329. CLIQUE: Infinity
  330. HUB: Infinity
  331. TREE [MDL=Infinity, ERROR = 0 / 23]
  332. -->[ s ]
  333. BIPARTITE: Infinity PC=542.9700743657419 CC=Infinity
  334. SPARSE: 598.9773216854805
  335. ClusterMap 1:
  336. >> Best graph type is TreeCluster
  337. CLIQUE: Infinity
  338. HUB: Infinity
  339. TREE [MDL=71696.40, ERROR = 1438 / 172465]
  340. -->[ s ]
  341. BIPARTITE: Infinity PC=4989.0454391296835 CC=Infinity
  342. SPARSE: 77749.69915282802
  343.  
  344. ----------------------------------------------
  345.  
  346. ===========================================
  347. FILE: "adjnoun.gml"
  348. MDL NMI RUNTIME
  349. 2100.6267 0.0242 4.3220
  350. ---------------------------------------------
  351. 2100.6267 0.0242 4.3220
  352. +-0.0000 +-0.0000 +-0.0000
  353. Best NMI found by MDL is 0.0242
  354. MDL = 2100.6267, ( HUB : 457.61 , SPARSE : 551.30 , ).
  355. Time used for clustering: 0.08 s
  356. NMI = 0.0242
  357. --------- Structure Details: -----------------
  358. ClusterMap 0:
  359. >> Best graph type is HubCluster
  360. CLIQUE: Infinity
  361. HUB: 457.6055116727011
  362. TREE [MDL=545.56, ERROR = 98 / 364]
  363. -->[ s ]
  364. BIPARTITE: Infinity PC=97.83535750584333 CC=Infinity
  365. SPARSE: 483.65466636900436
  366. ClusterMap 1:
  367. >> Best graph type is SparseCluster
  368. CLIQUE: Infinity
  369. HUB: Infinity
  370. TREE [MDL=Infinity, ERROR = 0 / 0]
  371. -->[ s ]
  372. BIPARTITE: Infinity PC=128.1560742685067 CC=Infinity
  373. SPARSE: 551.2975437309431
  374.  
  375. ----------------------------------------------
  376.  
  377. ===========================================
  378. FILE: "adjnoun.gml"
  379. MDL NMI RUNTIME
  380. 2100.6267 0.0242 4.1700
  381. ---------------------------------------------
  382. 2100.6267 0.0242 4.1700
  383. +-0.0000 +-0.0000 +-0.0000
  384. Best NMI found by MDL is 0.0242
  385. MDL = 2100.6267, ( HUB : 457.61 , SPARSE : 551.30 , ).
  386. Time used for clustering: 0.09 s
  387. NMI = 0.0242
  388. --------- Structure Details: -----------------
  389. ClusterMap 0:
  390. >> Best graph type is HubCluster
  391. CLIQUE: Infinity
  392. HUB: 457.6055116727011
  393. TREE [MDL=545.56, ERROR = 98 / 365]
  394. -->[ s ]
  395. BIPARTITE: Infinity PC=97.83535750584333 CC=Infinity
  396. SPARSE: 483.65466636900436
  397. ClusterMap 1:
  398. >> Best graph type is SparseCluster
  399. CLIQUE: Infinity
  400. HUB: Infinity
  401. TREE [MDL=Infinity, ERROR = 0 / 0]
  402. -->[ s ]
  403. BIPARTITE: Infinity PC=128.1560742685067 CC=Infinity
  404. SPARSE: 551.2975437309431
  405.  
  406. ----------------------------------------------
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!