SEMI-SUPERVISED DIMENSIONALITY REDUCTION USING PAIRWISE EQUIVALENCE CONSTRAINTS

Hakan Cevikalp, Jakob Verbeek, Frédéric Jurie, Alexander Kläser

2008

Abstract

To deal with the problem of insufficient labeled data, usually side information – given in the form of pairwise equivalence constraints between points – is used to discover groups within data. However, existing methods using side information typically fail in cases with high-dimensional spaces. In this paper, we address the problem of learning from side information for high-dimensional data. To this end, we propose a semi-supervised dimensionality reduction scheme that incorporates pairwise equivalence constraints for finding a better embedding space, which improves the performance of subsequent clustering and classification phases. Our method builds on the assumption that points in a sufficiently small neighborhood tend to have the same label. Equivalence constraints are employed to modify the neighborhoods and to increase the separability of different classes. Experimental results on high-dimensional image data sets show that integrating side information into the dimensionality reduction improves the clustering and classification performance.

References

  1. Basu, S., Banerjee, A., and Mooney, R. J. (2004). Active semi-supervision for pairwise constrained clustering. In the SIAM International Conference on Data Mining.
  2. Belkin, M. and Niyogi, P. (2001). Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems.
  3. Bilenko, M., Basu, S., and Mooney, R. J. (2004). Integrating constraints and metric learning in semi-supervised clustering. In the 21st International Conference on Machine Learning.
  4. Cevikalp, H., Larlus, D., Neamtu, M., Triggs, B., and Jurie, F. (2007). Manifold based local classifiers: Linear and nonlinear approaches. In Pattern Recognition in review.
  5. He, X. and Niyogi, P. (2003). Locality preserving directions. In Advances in Neural Information Processing Systems.
  6. Hertz, T., Shental, N., Bar-Hillel, A., and Weinshall, D. (2003). Enhancing image and video retrieval: Learning via equivalence constraints. In the 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'03).
  7. Lazebnik, S., Schmid, C., and Ponce, J. (2005). A maximum entropy framework for part-based texture and objcect recognition. In International Conference on Computer Vision (ICCV).
  8. Leibe, B. and Schiele, B. (2003). Interleaved object categorization and segmentation. In British Machine Vision Conference (BMVC).
  9. Lowe, D. (2004). Distinctive image features from scale - invariant keypoints. In International Journal of Computer Vision, volume 60, pages 91-110.
  10. Melia, M. and Shi, J. (2001). A random walks view of spectral segmentation. In the 8th International Workshop on Artificial Intelligence and Statistics.
  11. Shental, N., Bar-Hillel, A., Hertz, T., and Weisnhall, D. (2003). Computing gaussian mixture models with em using equivalance constraints. In Advances in Neural Information Processing Systems (NIPS).
  12. Tsang, I. W. and Kwok, J. T. (2003). Distance metric learning with kernels. In the International Conference on Artificial Neural Networks.
  13. van de Weijer, J. and Schmid, C. (2006). Coloring local feature extraction. In European Conference on Computer Vision (ECCV).
  14. Wagstaff, K. and Rogers, S. (2001). Constrained k-means clustering with background knowledge. In the 18th International Conference on Machine Learning.
  15. Xing, E. P., Ng, A. Y., Jordan, M. I., and Russell, S. (2003). Distance metric learning with application to clustering with side-information. In Advances in Neural Information Processing Systems.
  16. Yan, B. and Domeniconi, C. (2006). Subspace metric ensembles for semi-supervised clustering of high dimensional data. In the 17th European Conference on Machine Learning.
Download


Paper Citation


in Harvard Style

Cevikalp H., Verbeek J., Jurie F. and Kläser A. (2008). SEMI-SUPERVISED DIMENSIONALITY REDUCTION USING PAIRWISE EQUIVALENCE CONSTRAINTS . In Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008) ISBN 978-989-8111-21-0, pages 489-496. DOI: 10.5220/0001070304890496


in Bibtex Style

@conference{visapp08,
author={Hakan Cevikalp and Jakob Verbeek and Frédéric Jurie and Alexander Kläser},
title={SEMI-SUPERVISED DIMENSIONALITY REDUCTION USING PAIRWISE EQUIVALENCE CONSTRAINTS},
booktitle={Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)},
year={2008},
pages={489-496},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001070304890496},
isbn={978-989-8111-21-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)
TI - SEMI-SUPERVISED DIMENSIONALITY REDUCTION USING PAIRWISE EQUIVALENCE CONSTRAINTS
SN - 978-989-8111-21-0
AU - Cevikalp H.
AU - Verbeek J.
AU - Jurie F.
AU - Kläser A.
PY - 2008
SP - 489
EP - 496
DO - 10.5220/0001070304890496