From post

Comparing Apples and Oranges - Measuring Differences between Data Mining Results.

, и . ECML/PKDD (3), том 6913 из Lecture Notes in Computer Science, стр. 398-413. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Are your Items in Order.. SDM, стр. 414-425. SIAM / Omnipress, (2011)Computational complexity of queries based on itemsets.. Inf. Process. Lett., 98 (5): 183-187 (2006)Beyond rankings: comparing directed acyclic graphs., , и . Data Min. Knowl. Discov., 29 (5): 1233-1257 (2015)Mining closed strict episodes., и . Data Min. Knowl. Discov., 25 (1): 34-66 (2012)Using background knowledge to rank itemsets., и . Data Min. Knowl. Discov., 21 (2): 293-309 (2010)Column-coherent matrix decomposition.. Data Min. Knowl. Discov., 37 (6): 2564-2588 (ноября 2023)Finding events in temporal networks: segmentation meets densest subgraph discovery., , , , и . Knowl. Inf. Syst., 62 (4): 1611-1639 (2020)Discovering Nested Communities., и . ECML/PKDD (2), том 8189 из Lecture Notes in Computer Science, стр. 32-47. Springer, (2013)Density-friendly Graph Decomposition., и . WWW, стр. 1089-1099. ACM, (2015)Hierarchies in directed networks.. CoRR, (2019)