A decoupled approach to exemplar-based unsupervised learning

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 704-711

  Nowozin, Sebastian ^a   Bakir, Gökhan ^b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b GOOGLE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; MACHINE LEARNING; LEARNING SYSTEMS; ROBOT LEARNING; UNSUPERVISED LEARNING; VECTOR QUANTIZATION;

CONVEX OPTIMIZATION PROBLEMS; EXEMPLAR-BASED; LEARNING PROBLEM; LEARNING TASKS; MASTER PROBLEMS; MIXTURE MODEL; NOVEL ALGORITHM; RECENT TRENDS;

UNSUPERVISED LEARNING; EDUCATION;

CONVEX OPTIMIZATION PROBLEMS; LEARNING PROBLEMS; LEARNING TASKS; MIXTURE MODELS; NOVEL ALGORITHMS; RECENT TRENDS; SUB-PROBLEMS;

EID: 56449111426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390245     Document Type: Conference Paper

References (20)

1. Banerjee, A., Merugu, S., Dhillon, I. S., & Ghosh, J. (2005). Clustering with bregman divergences. Journal of Machine Learning Research, 6, 1705-1749.
2. Bengio, Y., Roux, N. L., Vincent, P., Delalleau, O., & Marcotte, P. (2005). Convex neural networks. NIPS.
3. Bertsekas, D. P. (1999). Nonlinear programming. Athena Scientific. 2nd edition.
4. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
5. Carreira-Perpiñán, M. Á. (2000). Mode-finding for mixtures of gaussian distributions. IEEE Trans. Pattern Anal. Mach. Intell, 22, 1318-1323.
6. Carreira-Perpiñán, M. Á., & Williams, C. K. I. (2003). An isotropic gaussian mixture can have more modes than components.
7. Cheng, Y. (1995). Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Analysis and Machine Intelligence, 17, 790-799.
8. Comaniciu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Mach. Intell, 24, 603-619.
9. Cornuejols, G., & Tütüncü, R. (2007). Optimization methods in finance. Mathematics, Finance and Risk.
10. Fukunaga, K., & Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Trans. Information Theory, 21, 32-40.
11. Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10, 237-260.
12. Lashkari, D., & Golland, P. (2007). Convex clustering with exemplar-based models. NIPS.
13. Rätsch, G., Schölkopf, B., & Mika, S. (2001). SVM and boosting: One class.
14. Rosset, S., & Segal, E. (2002). Boosting density estimation. NIPS (pp. 641-648). MIT Press.
15. Rückert, U., & Kramer, S. (2006). A statistical approach to rule learning. ICML (pp. 785-792).
16. Schölkopf, B., Mika, S., Burges, C. J. C., Knirsch, P., Mueller, K.-R., Raetsch, G., & Smola, A. J. (1999). Input Space versus Feature Space in Kernel-Based Methods. IEEE-NN, 10, 1000.
17. Schölkopf, B., & Smola, A. J. (2002). Learning with kernels. MIT Press.
18. Shen, C., Brooks, M. J., & van den Hengel, A. (2007). Fast global kernel density mode seeking: Applications to localization and tracking. IEEE Transactions on Image Processing, 16, 1457-1469.
19. Tipping, M., & Schölkopf, B. (2001). A kernel approach for vector quantization with guaranteed distortion bounds. AISTATS.
20. Wächter, A., & Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106, 25-57.