Composite distance metric integration by leveraging multiple experts' inputs and its application in patient similarity assessment

Statistical Analysis and Data Mining

Volumn 5, Issue 1, 2012, Pages 54-69

  Wang, Fei ^a   Sun, Jimeng ^a   Ebadollahi, Shahram ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Distance metric integration; Multiple inputs; Patient similarity

Indexed keywords

CLASSIFICATION (OF INFORMATION); DECISION SUPPORT SYSTEMS; QUADRATIC PROGRAMMING;

DATA SET; DISTANCE INTEGRATION; DISTANCE METRIC INTEGRATION; DISTANCE METRICS; LEARN+; MULTIPLE INPUTS; NEIGHBOURHOOD; PATIENT SIMILARITY; REAL-WORLD; SIMILARITY ASSESSMENT;

INTEGRATION;

EID: 84863144899     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.11135     Document Type: Article

References (40)

1. J.-E. Lee, R. Jin, and A. K. Jain, Rank-based distance metric learning: an application to image retrieval, In Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2008, 1-8.
2. S. Chopra, R. Hadsell, and Y. LeCun, Learning a similarity metric discriminatively, with application to face verification, In Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol. 1, 2005, 539-546.
3. H. Xiong and X. Chen, Kernel-based distance metric learning for microarray data classification, BMC Bioinformatics 7 (2006), 299.
4. S. Ebadollahi, J. Sun, D. Gotz, J. Hu, D. Sow, and C. Neti, Predicting patient's trajectory of physiological data using temporal trends in similar patients: A system for near-term prognostics, In AMIA Annual Symposium Proceedings, 2010, 192-196.
5. J. Sun, D. Sow, J. Hu, and S. Ebadollahi, Localized supervised metric learning on temporal physiological data, In Proceedings of the International Conference on Pattern Recognition (ICPR), 2010, 4149-4152.
6. L. Yang, Distance metric learning: A comprehensive survey, Technical report, Department of Computer Science and Engineering, Michigan State University, 2006.
7. T. F. Cox and M. A. A. Cox, Multimensional Scaling, London, Chapman and Hall, 2001.
8. G. Hinton and S. Roweis, Stochastic neighbor embedding, Advances in Neural Information Processing Systems 15, Cambridge, MA, MIT Press, 2002, 833-840.
9. I. Jolliffe, Principal Component Analysis (2nd ed.), Berlin, Germany, Springer Verlag, 2002.
10. F. Wang, S. Chen, T. Li, and C. Zhang, Semi-supervised metric learning by maximizing constraint margin, In Proceedings of ACM 17th Conference on Information and Knowledge Management, 2008, 1457-1458.
11. E. Xing, A. Ng, M. Jordan, and S. Russell, Distance metric learning with application to clustering with side-information, In Advances in Neural Information Processing System 15, 2003, 505-512.
12. R. O. Duda, P. E. Hart, and D. H. Stork, Pattern Classification (2nd ed.), New York, NY, Wiley Interscience, 2000.
13. J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov, Neighbourhood component analysis, In Advances in Neural Information Processing Systems 17, 2005, 513-520.
14. K. Q. Weinberger and L. K. Saul, Distance metric learning for large margin nearest neighbor classification, J Mach Learn Res 10 (2009), 207-244.
15. J. H. Friedman, Regularized discriminant analysis, J Am Stat Assoc 84(405) (1989), 165-175.
16. J. Ye and T. Xiong, Computational and theoretical analysis of null space and orthogonal linear discriminant analysis, Vol. 7, 2006, 1183-1204.
17. V. Vapnik, The Nature of Statistical Learning Theory, New York, NY, Springer-Verlag, 1995.
18. D. Cai, X. He, K. Zhou, J. Han, and H. Bao, Locality sensitive discriminant analysis, In Proceedings of the 20th International Joint Conference on Artificial Intelligence, 2007. 708-713.
19. G. R. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M. I. Jordan, Learning the kernel matrix with semidefinite programming, J Mach Learn Res 5 (2004), 27-72.
20. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan, Multiple kernel learning, conic duality, and the smo algorithm, In Proceedings of International Conference on Machine Learning, 2004, 6-13.
21. S. Sonnenburg, G. Rätsch, C. Schäfer, and B. Schölkopf, Large scale multiple kernel learning, J Mach Learn Res 7 (2006), 1531-1565.
22. C. Cortes, M. Mohri, and A. Rostamizadeh, Learning non-linear combinations of kernels, In Advances in Neural Information Processing Systems 22, Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, eds., Cambridge, MA, MIT Press, 2009, 396-404.
23. J. Zhuang, I. W. Tsang, and S. C. Hoi, Two-layer multiple kernel learning, In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, Journal of Machine Learning Research W & CPs, Vol. 15, 2011.
24. L. Breiman, Bagging predictors, Mach Learn 24(2) (1996), 123-140.
25. Y. Freund and R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, In European Conference on Computational Learning Theory, 1995. 23-37.
26. C. Aggarwal and P. S. Yu, Privacy-Preserving Data Mining: Models and Algorithms, New York, NY, Springer, 2008.
27. J. Vaidya, C. Clifton, and M. Zhu, Privacy Preserving Data Mining, New York, NY, Springer, 2005.
28. F. Wang, J. Sun, T. Li, and N. Anerousis, Two heads better than one: metric+active learning and its applications for it service classification, In IEEE International Conference on Data Mining, 2009, 1022-1027.
29. H. Zha, X. He, C. Ding, H. Simon, and M. Gu, Spectral relaxation for k-means clustering, In Advances in Neural Information Processing Systems, 2001, 1057-1064.
30. B. Schölkopf and A. J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, Cambridge, MA, MIT press, 2002.
31. A. E. Hoerl and R. Kennard, Ridge regression: biased estimation for nonorthogonal problems, Technometrics 12 (1970), 55-67.
32. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, Efficient projections onto the l1-ball for learning in high dimensions, In Proceedings of the 25th international conference on Machine learning, 2008. 272-279.
33. J. Liu and J. Ye, Efficient euclidean projections in linear time, In Proceedings of the 26th international conference on Machine learning.
34. R. Tibshirani, Regression shrinkage and selection via the lasso, J R Stat Soc [Ser B] 58 (1) (1996), 267-288.
35. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regression, Ann Stat 32(2) (2004), 407-499.
36. H. Zou and T. Trevor, Regularization and variable selection via the elastic net, J R Stat Soc [Ser B] 67(2) (2005), 301-320.
37. M. Morup, K. H. Madsen, and L. K. Hansen, Approximate l0 constrained non-negative matrix and tensor factorization, In Proceedings of IEEE International Symposium on Circuits and Systems, 2008, 1328-1331.
38. G. H. Golub and C. F. V. Loan, Matrix Computation (3rd ed.), Baltimore, MD, The Johns Hopkins University Press, 1996.
39. T. Fawcett, An introduction to roc analysis, Pattern Recognit Lett 27 (2006), 861-874.
40. D. J. HMeasuring classifier performance: a coherent alternative to the area under the roc curve, Mach Learn 77 (2009), 103-123.