Formulating distance functions via the kernel trick

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 703-709

  Wu, Gang ^a   Chang, Edward Y ^a   Panda, Navneet ^a  

^a University of California   (United States)

Author keywords

Distance function; Kernel trick

Indexed keywords

FUNCTIONS; INFORMATION RETRIEVAL;

DATASETS; DISTANCE FUNCTION; KERNEL TRICK;

DATA MINING;

EID: 32344447999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081960     Document Type: Conference Paper

References (20)

1. C. Aggarwal, A. Hinneburg, and D. Keim. On the surprising behavior of distance metrics in high dimensional spaces. In Proceedings of International Conference on Database Theory, pages 420-434, 2001.
2. C. C. Aggarwal. Towards systematic design of distance functions for data mining applications. The Ninth ACM SIGKDD International Conference on Knowledge Discovery in Data and Data Mining, 2003.
3. M. A. Aizerman, E. M. Braverman, and L. I. Rozonoer. Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control, 25:821-837, 1964.
4. E. Amaldi and V. Kann. On the approximability of minimizing non-zero variables or unsatisfied relations in linear systems. Theoretical Computer Science, 209:237-260, 1998.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? Lecture Notes in Computer Science, 1999.
6. E. Y. Chang, S. Tong, K. Goh, and C. Chang. Support vector machine concept-dependent active learning for image retrieval (submitted 2002 accepted 2005). IEEE Transaction on Multimedia.
7. N. Cristianini, J. Kandola, A. Elisseeff, and J. Shawe-Taylor. On kernel target alignment. Journal Machine Learning Research, 1, 2002.
8. N. Cristianini, J. Shawe-Taylor, and A. Elisseeff. On kernel-target alignment, 2002.
9. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 301-312, June 2003.
10. M. Fazel, Matrix rank minimization with applications. Ph.D. Thesis, Electrical Engineering Dept, Stanford University, March 2002.
11. A. Gionis, P. Indyk, and R. Motwani, Similarity search in high dimensions via hashing. In Proceedings of the 25th VLDB Conference, pages 518-529, 1999.
12. Y. Grandvalet and S. Canu. Adaptive scaling for feature selection in svms. Advances in Neural Information Processing Systems 15, 2003.
13. H. W. Kuhn and A. W. Tucker. Nonlinear programming. In Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probabilistics, pages 481-492, 1951.
14. J. T. Kwok and I. W. Tsang. Learning with idealized kernels. In Proceedings of the Twentieth International Conference on Machine Learning, pages 400-407, August 2003.
15. B. Schölkopf and A. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, 2002.
16. S. Tong and E. Chang. Support vector machine active learning for image retrieval. In Proceedings of ACM International Conference on Multimedia, pages 107-118, 2001.
17. V. Vapnik. Statistical Learning Theroy. John Wiley and Sons, 1998.
18. T. Wang, Y. Rui, S.-M. Hu, and J.-Q. Sun. Adaptive tree similarity learning for image retrieval, 2003.
19. G. Wu, E. Y. Chang, and N. Panda. Formulating distances function using the kernel trick (extended version). http://www.mmdb.ece.ucsb.edu/~echang/kdd05-long.pdf, November 2003.
20. E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems 15, 2003.