Adaptive distances on sets of vectors

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 579-588

  Wóznica, Adam ^a   Kalousis, Alexandros ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Adaptive distances; Complex objects; Distance learning; Graphs; Sets

Indexed keywords

ADAPTIVE DISTANCE; COMPLEX OBJECTS; DISTANCE LEARNING; GRAPHS; SETS;

DATA MINING;

DISTANCE EDUCATION;

EID: 79951732169     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.45     Document Type: Conference Paper

References (34)

1. Stuart Andrews, Ioannis Tsochantaridis, and Thomas Hofmann. Support vector machines for multiple-instance learning. In NIPS, 2002.
2. M. Bernard, L. Boyer, A. Habrard, and M. Sebban. Learning probabilistic models of tree edit distance. Pattern Recognition, 41(8):2611-2629, August 2008.
3. D. Bertsekas. Nonlinear Programming. Athena Scientific, 1999.
4. Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
5. M. B. Blaschko and T. Hofmann. Conformal multi-instance kernels. In NIPS 2006 Workshop on Learning to Compare Examples, pages 1-6, 12 2006.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge Univ. Press, 2004.
7. C. Caetano, L. Cheng, Q.V. Le, and A.J. Smola. Learning graph matching. In ICCV, 2007.
8. Thomas G. Dietterich, Richard H. Lathrop, and Tomas Lozano-Perez. Solving the multiple instance problem with axis-parallel rectangles. Artificial Intelligence, 89(1-2):31-71, 1997. (Pubitemid 127412230)
9. Carlotta Domeniconi and Dimitrios Gunopulos. Adaptive nearest neighbor classification using support vector machines. In NIPS. MIT Press, 2002.
10. T Eiter and H. Mannila. Distance measures for point sets and their computation. Acta Informatica, 34(2):109-133, 1997. (Pubitemid 127359707)
11. Holger Fröhich, Jörg Wegner, Florian Sieker, and Andreas Zell. Optimal assignment kernels for attributed molecular graphs. In ICML, 2005.
12. P. V. Gehler and O. Chapelle. Deterministic annealing for multiple-instance learning. In AISTATS, 2007.
13. Amir Globerson and Sam Roweis. Metric learning by collapsing classes. In NIPS 18. MIT Press, 2006.
14. Jacob Goldberger, Sam Roweis, Geoff Hinton, and Ruslan Salakhutdinov. Neighbourhood component analysis. In NIPS, 2005.
15. C. Helma, R. D. King, S. Kramer, and A. Srinivasan. The predictive toxicology challenge 2000-2001. Bioinformatics, 17:107-108, 2001. (Pubitemid 32178021)
16. Tomer Hertz, Aharon Bar-Hillel, and Daphna Weinshall. Boosting margin based distance functions for clustering. In ICML, 2004.
17. R. Jin, S.J. Wang, and Z.H. Zhou. Learning a distance metric from multi-instance multi-label data. In CVPR, 2009.
18. J.T. Kwok and I.W. Tsang. Learning with idealized kernels. In ICML, 2003.
19. G. Lanckriet, N. Cristianini, P. L. Bartlett, L. El Ghaoui, and M. Jordan. Learning the kernel matrix with semi-definite programming. Journal of Machine Learning Research, 5:27-72, 2004.
20. Sauro Menchetti, Fabrizio Costa, and Paolo Frasconi. Weighted decomposition kernels. In ICML, 2005.
21. M. Neuhaus and H. Bunke. A probabilistic approach to learning costs for graph edit distance. In ICPR, pages III: 389-393, 2004.
22. Jose Oncina and Marc Sebban. Learning stochastic edit distance: Application in handwritten character recognition. Pattern Recognition, 39(9):1575 - 1587, 2006. (Pubitemid 43867574)
23. Luc De Raedt. Logical and Relational Learning. Springer, 2008.
24. Jan Ramon and Maurice Bruynooghe. A polynomial time computable metric between point sets. Acta Informatica, 37(10):765-780, 2001. (Pubitemid 33384228)
25. Eric Sven Ristad and Peter N. Yianilos. Learning string edit distance. IEEE Transactions on Pattern Recognition and Machine Intelligence, 20(5):522-532, May 1998.
26. A. Srinivasan, S. Muggleton, R.D. King, and M.J.E. Sternberg. Mutagenesis: ILP experiments in a non-determinate biological domain. In S. Wrobel, editor, Proceedings of the 4th International Workshop on Inductive Logic Programming, volume 237, pages 217-232, 1994.
27. Ivor W. Tsang, Pak-Ming Cheung, and James T. Kwok. Kernel relevant component analysis for distance metric learning. In IJCNN, 2005.
28. Jun Wang and Jean-Daniel Zucker. Solving the multiple-instance problem: A lazy learning approach. In ICML '00: Proceedings of the Seventeenth International Conference on Machine Learning, 2000.
29. Kilian Q. Weinberger and Lawrence K. Saul. Fast solvers and efficient implementations for distance metric learning. In ICML, 2008.
30. Adam Woźnica. Distance and Kernel Based Learning over Composite Representations. PhD thesis, University of Geneva, 2008.
31. Adam Woźnica, Alexandros Kalousis, and Melanie Hilario. Distances and (indefinite) kernels for sets of objects. In ICDM, Hong Kong, 2006.
32. Adam Woźnica, Alexandros Kalousis, and Melanie Hilario. Learning to combine distances for complex representations. In ICML, 2007.
33. Adam Woźnica, Alexandros Kalousis, and Melanie Hilario. Adaptive matching based kernels for labeled graphs. In PAKDD, 2010.
34. Eric P. Xing, Andrew Y. Ng, Michael I. Jordan, and Stuart Russell. Distance metric learning with application to clustering with side-information. In NIPS. MIT Press, 2003.