activity
20132021
most citedAxioms for graph clustering quality functions

38 citations · 78 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2021★ 1 cited

Universal approximation and model compression for radial neural networks

Iordan Ganev, Twan van Laarhoven, Robin Walters

We introduce a class of fully-connected neural networks whose activation functions, rather than being pointwise, rescale feature vectors by a function depending only on their norm.…

cs.LG2018

Multi-Output Convolution Spectral Mixture for Gaussian Processes

Kai Chen, Twan van Laarhoven, Perry Groot +2

Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this…

cs.LG2018

Multitask Gaussian Process with Hierarchical Latent Interactions

Kai Chen, Twan van Laarhoven, Elena Marchiori +2

Multitask Gaussian process (MTGP) is powerful for joint learning of multiple tasks with complicated correlation patterns. However, due to the assembling of additive independent lat…

stat.ML2017★ 10 cited

Unsupervised Domain Adaptation with Random Walks on Target Labelings

Twan van Laarhoven, Elena Marchiori

Unsupervised Domain Adaptation (DA) is used to automatize the task of labeling data: an unlabeled dataset (target) is annotated using a labeled dataset (source) from a related doma…

cs.SI2016★ 29 cited

Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means

Twan van Laarhoven, Elena Marchiori

Local network community detection is the task of finding a single community of nodes concentrated around few given seed nodes in a localized way. Conductance is a popular objective…

stat.ML2014

Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering

Twan van Laarhoven, Elena Marchiori

Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do n…

cs.CV2013★ 38 cited

Axioms for graph clustering quality functions

Twan van Laarhoven, Elena Marchiori

We investigate properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph. Graph clu…