( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
ExCoDE: a Tool for Discovering and Visualizing Regions of Correlation in Dynamic Networks.

, , , и . ICDM Workshops, стр. 1114-1117. IEEE, (2019)

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.

Giulia Agostini

Giulia Calenda

Giulia Zancolli

Giulia Morra

Giulia Vannoni

 

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

Mining Dense Subgraphs with Similar Edges., , , и . ECML/PKDD (3), том 12459 из Lecture Notes in Computer Science, стр. 20-36. Springer, (2020)Discovering Dense Correlated Subgraphs in Dynamic Networks., , , и . PAKDD (1), том 12712 из Lecture Notes in Computer Science, стр. 395-407. Springer, (2021)Alice and the Caterpillar: A More Descriptive Null Model for Assessing Data Mining Results., , и . ICDM, стр. 418-427. IEEE, (2022)ExCoDE: a Tool for Discovering and Visualizing Regions of Correlation in Dynamic Networks., , , и . ICDM Workshops, стр. 1114-1117. IEEE, (2019)Mining patterns in graphs with multiple weights., , , и . Distributed Parallel Databases, 39 (2): 281-319 (2021)STruD: Truss Decomposition of Simplicial Complexes., , и . WWW, стр. 3408-3418. ACM / IW3C2, (2021)MaNIACS: Approximate Mining of Frequent Subgraph Patterns through Sampling., , и . KDD, стр. 1348-1358. ACM, (2021)MaNIACS: Approximate Mining of Frequent Subgraph Patterns through Sampling., , и . ACM Trans. Intell. Syst. Technol., 14 (3): 54:1-54:29 (2023)FreSCo: Mining Frequent Patterns in Simplicial Complexes., , и . WWW, стр. 1444-1454. ACM, (2022)Counterfactual Explanations for Graph Classification Through the Lenses of Density., , и . xAI (1), том 1901 из Communications in Computer and Information Science, стр. 324-348. Springer, (2023)