Florian Adriaens

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 18

Top Topics

Correlation Clustering

Discovering Interesting

Top Venues

Data Min. Knowl. Discov.

Publications

Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
Max-Min Diversification with Asymmetric Distances. KDD (2024)
Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
Multilayer Correlation Clustering. CoRR (2024)
Florian Adriaens, Honglian Wang, Aristides Gionis
Minimizing Hitting Time between Disparate Groups with Shortcut Edges. KDD (2023)
Florian Adriaens, Simon Apers
Testing Cluster Properties of Signed Graphs. WWW (2023)
Florian Adriaens, Honglian Wang, Aristides Gionis
Minimizing Hitting Time between Disparate Groups with Shortcut Edges. CoRR (2023)
Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu
Improved analysis of randomized SVD for top-eigenvector approximation. CoRR (2022)
Florian Adriaens, Aristides Gionis
Diameter Minimization by Shortcutting with Degree Constraints. ICDM (2022)
Florian Adriaens, Aristides Gionis
Diameter Minimization by Shortcutting with Degree Constraints. CoRR (2022)
Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu
Improved analysis of randomized SVD for top-eigenvector approximation. AISTATS (2022)
Florian Adriaens, Simon Apers
Testing properties of signed graphs. CoRR (2021)
Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
Block-Approximated Exponential Random Graphs. DSAA (2020)
Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
Scalable Dyadic Independence Models with Local and Global Constraints. CoRR (2020)
Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Antonis Matakos, Polina Rozenshtein
Relaxing the strong triadic closure problem for edge strength inference. Data Min. Knowl. Discov. 34 (3) (2020)
Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt
Discovering Interesting Cycles in Directed Graphs. CIKM (2019)
Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt
Discovering Interesting Cycles in Directed Graphs. CoRR (2019)
Florian Adriaens, Jefrey Lijffijt, Tijl De Bie
Subjectively interesting connecting trees and forests. Data Min. Knowl. Discov. 33 (4) (2019)
Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Polina Rozenshtein
From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths. CoRR (2018)
Florian Adriaens, Jefrey Lijffijt, Tijl De Bie
Subjectively Interesting Connecting Trees. ECML/PKDD (2) (2017)