Fetching the paper…
Reading the bibliography…
Asymmetric kernels naturally exist in real life, e.g., for conditional probability and directed graphs.
G. W. Stewart, “On the early history of the singular value decomposition,” SIAM Review , vol. 35, no. 4, pp. 551–566, 1993
1993
Earlier work this paper cites.
C. Cortes and V. Vapnik, “Support-vector networks,” Machine Learning , vol. 20, no. 3, pp. 273–297, 1995
1995
Earlier work this paper cites.
H. Drucker, C. J. Burges, L. Kaufman, A. Smola, V. Vapnik et al. , “Support vector regression machines,” Advances in Neural Information Processing Systems , vol. 9, pp. 155–161, 1997
1997
Earlier work this paper cites.
K. M. Ting and I. H. Witten, “Stacking bagged and dagged models,” in Proceedings of the 14th International Conference on Machine Learning , 1997, pp. 367–375
1997
Earlier work this paper cites.
C. Blake and C. Merz, “UCI repository of machine learning databases,” 1998
1998
Earlier work this paper cites.
H. Jeffreys, B. Jeffreys, and B. Swirles, Methods of Mathematical Physics . Cambridge University Press, 1999
1999
Earlier work this paper cites.
J. A. K. Suykens and J. Vandewalle, “Least squares support vector machine classifiers,” Neural Processing Letters , vol. 9, no. 3, pp. 293–300, 1999
1999
Earlier work this paper cites.
K. Tsuda, “Support vector classifier with asymmetric kernel functions,” in European Symposium on Artificial Neural Networks (ESANN) , 1999, pp. 183–188
1999
Earlier work this paper cites.
C. Williams and M. Seeger, “Using the Nyström method to speed up kernel machines,” in Proceedings of the 14th Annual Conference on Neural Information Processing Systems , 2001, pp. 682–688
2001
Earlier work this paper cites.
J. Z. Wang, J. Li, and G. Wiederhold, “Simplicity: Semantics-sensitive integrated matching for picture libraries,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 23, no. 9, pp. 947–963, 2001
2001
Earlier work this paper cites.
B. Schölkopf and A. J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond . MIT press, 2002
2002
Earlier work this paper cites.
J. A. K. Suykens, T. Van Gestel, J. De Brabanter, B. De Moor, and J. Vandewalle, Least Squares Support Vector Machines . World Scientific, 2002
2002
Earlier work this paper cites.
M. Girolami, “Mercer kernel-based clustering in feature space,” IEEE Transactions on Neural Networks , vol. 13, no. 3, pp. 780–784, 2002
2002
Earlier work this paper cites.
G. Hinton and S. T. Roweis, “Stochastic neighbor embedding,” in Advances in Neural Information Processing Systems , vol. 15. Citeseer, 2002, pp. 833–840
2002
Earlier work this paper cites.
P. J. Moreno, P. Ho, and N. Vasconcelos, “A Kullback-Leibler divergence based kernel for SVM classification in multimedia applications.” in Advances in Neural Information Processing Systems , 2003, pp. 1385–1392
2003
Earlier work this paper cites.
A. Munoz, I. M. de Diego, and J. M. Moguerza, “Support vector machine classifiers for asymmetric proximities,” in Artificial Neural Networks and Neural Information Processing—ICANN/ICONIP 2003 . Springer, 2003, pp. 217–224
2003
Earlier work this paper cites.
C. S. Ong, X. Mary, S. Canu, and A. J. Smola, “Learning with non-positive kernels,” in Proceedings of the 21st International Conference on Machine Learning , 2004, p. 81
2004
Cited alongside, same era.
M. Mackenzie and A. K. Tieu, “Asymmetric kernel regression,” IEEE Transactions on Neural Networks , vol. 15, no. 2, pp. 276–282, 2004
2004
Cited alongside, same era.
B. Haasdonk, “Feature space interpretation of SVMs with indefinite kernels,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 27, no. 4, pp. 482–492, 2005
2005
Cited alongside, same era.
N. Koide and Y. Yamashita, “Asymmetric kernel method and its application to Fisher’s discriminant,” in the 18th International Conference on Pattern Recognition , vol. 2, 2006, pp. 820–824
2006
Cited alongside, same era.
M. Ou, P. Cui, J. Pei, Z. Zhang, and W. Zhu, “Asymmetric transitivity preserving graph embedding,” in Proceedings of the 22nd ACM SIGKDD International Cconference on Knowledge Discovery and Data Mining , 2016, pp. 1105–1114
2016
Later among the works it cites.
J. A. K. Suykens, “SVD revisited: A new variational principle, compatible feature maps and nonlinear extensions,” Applied and Computational Harmonic Analysis , vol. 40, no. 3, pp. 600–609, 2016
2016
Later among the works it cites.
H. Xu, M. Farajtabar, and H. Zha, “Learning Granger causality for Hawkes processes,” in International Conference on Machine Learning . PMLR, 2016, pp. 1717–1726
2016
Later among the works it cites.
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy, “Optimal transport for domain adaptation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 39, no. 9, pp. 1853–1865, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
S. K. Zhou and R. Chellappa, “From sample similarity to ensemble similarity: Probabilistic distance measures in reproducing kernel Hilbert space,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 28, no. 6, pp. 917–929, 2006
2006
Cited alongside, same era.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Cited alongside, same era.
K. Soman, R. Loganathan, and V. Ajay, Machine Learning with SVM and other Kernel Methods . PHI Learning Pvt. Ltd., 2009
2009
Cited alongside, same era.
C. Kuruwita, K. Kulasekera, and W. Padgett, “Density estimation using asymmetric kernels and bayes bandwidths with censored data,” Journal of Statistical Planning and Inference , vol. 140, no. 7, pp. 1765–1774, 2010
2010
Cited alongside, same era.
W. Wu, J. Xu, H. Li, and S. Oyama, “Asymmetric kernel learning,” Tech. Rep. MSR-TR-2010-85, June 2010. [Online]. Available: https://www.microsoft.com/en-us/research/publication/asymmetric-kernel-learning/
2010
Cited alongside, same era.
K. De Brabanter, J. De Brabanter, J. A. K. Suykens, and B. De Moor, “Optimized fixed-size kernel models for large data sets,” Computational Statistics & Data Analysis , vol. 54, no. 6, pp. 1484–1504, 2010
2010
Cited alongside, same era.
K. Radinsky, S. Davidovich, and S. Markovitch, “Learning causality for news events prediction,” in Proceedings of the 21st international conference on World Wide Web , 2012, pp. 909–918
2012
Cited alongside, same era.
X. Huang, A. Maier, J. Hornegger, and J. A. K. Suykens, “Indefinite kernels in least squares support vector machines and principal component analysis,” Applied and Computational Harmonic Analysis , vol. 43, no. 1, pp. 162–172, 2017
2017
Later among the works it cites.
C. Zhou, Y. Liu, X. Liu, Z. Liu, and J. Gao, “Scalable graph embedding for asymmetric proximity,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 31, no. 1, 2017
2017
Later among the works it cites.
J. A. K. Suykens, “Deep restricted kernel machines using conjugate feature duality,” Neural Computation , vol. 29, no. 8, pp. 2123–2163, 2017
2017
Later among the works it cites.
S. L. Pintea, J. C. van Gemert, and A. W. Smeulders, “Asymmetric kernel in Gaussian processes for learning target variance,” Pattern Recognition Letters , vol. 108, pp. 70–77, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
B. Su and G. Hua, “Order-preserving optimal transport for distances between sequences,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 41, no. 12, pp. 2961–2974, 2018
2018
Later among the works it cites.
D. Oglic and T. Gärtner, “Scalable learning in reproducing kernel Kreĭn spaces,” in International Conference on Machine Learning . PMLR, 2019, pp. 4912–4921
2019
Later among the works it cites.
M. Khosla, J. Leonhardt, W. Nejdl, and A. Anand, “Node representation learning for directed graphs,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2019, pp. 395–411
2019
Later among the works it cites.
T. Karras, S. Laine, and T. Aila, “A style-based generator architecture for generative adversarial networks,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2019, pp. 4401–4410
2019
Later among the works it cites.
F. Liu, X. Huang, Y. Chen, and J. A. K. Suykens, “Fast learning in reproducing kernel Kreĭn spaces via signed measures,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 388–396
2021
Later among the works it cites.
B. Huang, X. Li, Z. Song, and X. Yang, “FL-NTK: A neural tangent kernel-based framework for federated learning analysis,” in International Conference on Machine Learning . PMLR, 2021, pp. 4423–4434
2021
Later among the works it cites.
J. Gui, Z. Sun, Y. Wen, D. Tao, and J. Ye, “A review on generative adversarial networks: Algorithms, theory, and applications,” IEEE Transactions on Knowledge and Data Engineering , pp. 1–1, 2021
2021
Later among the works it cites.