Kernelized Sorting

110 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Kernel Mean Embedding of Distributions: A Review and Beyonds (2016, methodology): “This concept has been extended to several applications including, for example, kernelized sorting (Quadrianto et al. 2009).”
LabelMe: Online Image Annotation and Applications (2010, unknown): “11 we used kernelized sorting [44].”
Feature Selection via Dependence Maximization (2012, background): “Experiments on such data (Quadrianto et al., 2009) show that bias removal is essential to obtain good results.”
Power Iterated Color Refinement (2014, methodology): “Computing automorphisms can be approached using continuous optimization formulations for graph isomorphisms, see e.g. (Zaslavskiy, Bach, and Vert 2009; Quadrianto et al. 2010) and references in there.”
From Word Embeddings To Document Distances (2015, background): “…between two documents has far-reaching applications in document retrieval (Salton & Buckley, 1988), news categorization and clustering (Ontrup & Ritter, 2001; Greene & Cunningham, 2006), song identification (Brochu & Freitas, 2002), and multilingual document matching (Quadrianto et al., 2009).”
Factorized Graph Matching (2016, methodology): “Our algorithm exploits the particular structure of the afﬁnity matrix and is able to factorize it as a Kronecker product of four smaller matrices.”
Classifier adaptation at prediction time (2015, methodology): “The KS method is based on kernelized sorting [20].”