24 citations · 24 across the 2 of their papers we have counts for
4 papers
Off-the-grid: Fast and Effective Hyperparameter Search for Kernel Clustering
Bruno Ordozgoiti, Lluís A. Belanche Muñoz
Kernel functions are a powerful tool to enhance the -means clustering algorithm via the kernel trick. It is known that the parameters of the chosen kernel function can have a dr…
Finding large balanced subgraphs in signed networks
Bruno Ordozgoiti, Antonis Matakos, Aristides Gionis
Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in interactions that are missed by their unsigned…
Searching for polarization in signed graphs: a local spectral approach
Han Xiao, Bruno Ordozgoiti, Aristides Gionis
Signed graphs have been used to model interactions in social net-works, which can be either positive (friendly) or negative (antagonistic). The model has been used to study polariz…
Discovering Polarized Communities in Signed Networks
Francesco Bonchi, Edoardo Galimberti, Aristides Gionis +2
Signed networks contain edge annotations to indicate whether each interaction is friendly (positive edge) or antagonistic (negative edge). The model is simple but powerful and it c…