Skip to main content

2014 | OriginalPaper | Buchkapitel

3. Modelling the Manifold

verfasst von : Harry Strange, Reyer Zwiggelaar

Erschienen in: Open Problems in Spectral Dimensionality Reduction

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this chapter, an overview of some of the key issues associated with modelling manifolds are provided. This covers the construction of neighbourhood graphs, and automatic estimation of relevant parameters; how manifold modelling techniques deal with various topologies of the data; and the problem of noise. Each of these aspects are supported by an illustrative example. The interaction between these key issues is also discussed.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2322 (2000) Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2322 (2000)
2.
Zurück zum Zitat Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems 14: Proceedings of the 2002 Conference (NIPS), pp. 585–591 (2002) Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems 14: Proceedings of the 2002 Conference (NIPS), pp. 585–591 (2002)
3.
Zurück zum Zitat Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. Computer Vision and Pattern Recognition, Workshop pp. 1–6 (2008) Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. Computer Vision and Pattern Recognition, Workshop pp. 1–6 (2008)
4.
Zurück zum Zitat Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, STOC ’97, pp. 599–608 (1997) Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, STOC ’97, pp. 599–608 (1997)
5.
Zurück zum Zitat Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbour search in high dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9), 989–1003 (1997) Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbour search in high dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9), 989–1003 (1997)
6.
Zurück zum Zitat Samko, O., Marshall, A.D., Rosin, P.: Selection of the optimal parameter value for the Isomap algorithm. Pattern Recognition Letters 27(9), 968–979 (2006) Samko, O., Marshall, A.D., Rosin, P.: Selection of the optimal parameter value for the Isomap algorithm. Pattern Recognition Letters 27(9), 968–979 (2006)
7.
Zurück zum Zitat Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by Locally Linear Embedding. Science 290, 2323–2326 (2000) Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by Locally Linear Embedding. Science 290, 2323–2326 (2000)
8.
Zurück zum Zitat Kouropteva, O., Okun, O., Pietikainen, M.: Selection of the optimal parameter value for the locally linear embedding algorithm. In: Proceedings of the First International Conference on Fuzzy Systems and Knowledge Discovery, pp. 359–363 (2002) Kouropteva, O., Okun, O., Pietikainen, M.: Selection of the optimal parameter value for the locally linear embedding algorithm. In: Proceedings of the First International Conference on Fuzzy Systems and Knowledge Discovery, pp. 359–363 (2002)
9.
Zurück zum Zitat Yang, L.: Building k edge-disjoint spanning trees of minimum total length for isometric data embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(10), 1680–1683 (2005) Yang, L.: Building k edge-disjoint spanning trees of minimum total length for isometric data embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(10), 1680–1683 (2005)
10.
Zurück zum Zitat Wen, G., Jiang, L., Shadbolt, N.R.: Using graph algebra to optimize neighborhood for isometric mapping. In: 20th International Joint Conference on Artificial Intelligence, pp. 2398–2403 (2007) Wen, G., Jiang, L., Shadbolt, N.R.: Using graph algebra to optimize neighborhood for isometric mapping. In: 20th International Joint Conference on Artificial Intelligence, pp. 2398–2403 (2007)
11.
Zurück zum Zitat Kruskal, J.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1956) Kruskal, J.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1956)
12.
Zurück zum Zitat Fischer, B., Buhmann, J.M.: Bagging for path-based clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(1), 1411–1415 (2003)CrossRef Fischer, B., Buhmann, J.M.: Bagging for path-based clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(1), 1411–1415 (2003)CrossRef
13.
Zurück zum Zitat Fischer, B., Buhmann, J.M.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(4), 513–518 (2003) Fischer, B., Buhmann, J.M.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(4), 513–518 (2003)
14.
Zurück zum Zitat Zhang, Z., Zha, H.: Principal manifolds and nonlinear dimension reduction via local tangent space alignment. SIAM Journal on Scientific Computing 26(1), 313–338 (2004) Zhang, Z., Zha, H.: Principal manifolds and nonlinear dimension reduction via local tangent space alignment. SIAM Journal on Scientific Computing 26(1), 313–338 (2004)
15.
Zurück zum Zitat Wang, J., Zhang, Z., Zha, H.: Adaptive manifold learning. In: Advances in Neural Information Processing Systems 16: Proceedings of the 2004 Conference (NIPS), pp. 1473–1480 (2004) Wang, J., Zhang, Z., Zha, H.: Adaptive manifold learning. In: Advances in Neural Information Processing Systems 16: Proceedings of the 2004 Conference (NIPS), pp. 1473–1480 (2004)
16.
Zurück zum Zitat Zhang, Z., Wang, J., Zha, H.: Adaptive Manifold Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 34(2), 253–265 (2012) Zhang, Z., Wang, J., Zha, H.: Adaptive Manifold Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 34(2), 253–265 (2012)
17.
Zurück zum Zitat Mekuz, N., Tsotsos, J.K.: Parameterless Isomap with adaptive neighborhood selection. In: Deutsche Arbeitsgemeinschaft für Mustererkennung DAGM, pp. 364–373 (2006) Mekuz, N., Tsotsos, J.K.: Parameterless Isomap with adaptive neighborhood selection. In: Deutsche Arbeitsgemeinschaft für Mustererkennung DAGM, pp. 364–373 (2006)
18.
Zurück zum Zitat Gao, Z., Liang, J.: The dynamical neighborhood selection based on the sampling density and manifold curvature for isometric data embedding. Pattern Recognition Letters 32, 202–209 (2011) Gao, Z., Liang, J.: The dynamical neighborhood selection based on the sampling density and manifold curvature for isometric data embedding. Pattern Recognition Letters 32, 202–209 (2011)
19.
Zurück zum Zitat Lee, J.A., Verleysen, M.: Nonlinear dimensionality reduction of data manifolds with essential loops. Neurocomputing 67, 29–53 (2005) Lee, J.A., Verleysen, M.: Nonlinear dimensionality reduction of data manifolds with essential loops. Neurocomputing 67, 29–53 (2005)
20.
Zurück zum Zitat Prim, R.C.: Shortes connection networks and some generalisations. Bell System Technical Journal 36, 1389–1401 (1957) Prim, R.C.: Shortes connection networks and some generalisations. Bell System Technical Journal 36, 1389–1401 (1957)
21.
Zurück zum Zitat Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959) Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
22.
Zurück zum Zitat Roychowdhury, S., Ghosh, J.: Robust Laplacian Eigenmaps using global information. In: Manifold Learning and Applications: Papers from the AAAI Fall Symposium (FS-09-04), pp. 42–49 (2009) Roychowdhury, S., Ghosh, J.: Robust Laplacian Eigenmaps using global information. In: Manifold Learning and Applications: Papers from the AAAI Fall Symposium (FS-09-04), pp. 42–49 (2009)
23.
Zurück zum Zitat Gong, D., Zhao, X., Medioni, G.: Robust multiple manifolds structure learning. In: Proceedings of the 29th International Conference on Machine Learning (2012) Gong, D., Zhao, X., Medioni, G.: Robust multiple manifolds structure learning. In: Proceedings of the 29th International Conference on Machine Learning (2012)
24.
Zurück zum Zitat Guo, Q., Li, H., Chen, W., Shen, I.F., Parkkinen, J.: Manifold clustering via energy minimisation. In: Proceedings of the Sixth International Conference on Machine Learning and Applications (2007) Guo, Q., Li, H., Chen, W., Shen, I.F., Parkkinen, J.: Manifold clustering via energy minimisation. In: Proceedings of the Sixth International Conference on Machine Learning and Applications (2007)
25.
Zurück zum Zitat Fan, M., Qiao, H., Zhang, B., Zhang, X.: Isometric mult-manifold learning for feature extraction. In: Proceedings of the 12th International Conference on Data Mining, pp. 241–250 (2012) Fan, M., Qiao, H., Zhang, B., Zhang, X.: Isometric mult-manifold learning for feature extraction. In: Proceedings of the 12th International Conference on Data Mining, pp. 241–250 (2012)
26.
Zurück zum Zitat Elhamifar, E., Vidal, R.: Sparse manifold clustering and embedding. In: Advances in Neural Information Processing Systems 24: Proceedings of the 2011 Conference (NIPS), pp. 55–63 (2011) Elhamifar, E., Vidal, R.: Sparse manifold clustering and embedding. In: Advances in Neural Information Processing Systems 24: Proceedings of the 2011 Conference (NIPS), pp. 55–63 (2011)
27.
Zurück zum Zitat Wang, C., Mahadevan, S.: Manifold alignment using Procrustes analysis. In: Proceedings of the 25th International Conference on Machine Learning, Helsinki, Finland, pp. 1120–1127 (2008) Wang, C., Mahadevan, S.: Manifold alignment using Procrustes analysis. In: Proceedings of the 25th International Conference on Machine Learning, Helsinki, Finland, pp. 1120–1127 (2008)
28.
Zurück zum Zitat Bishop, C.M., Svensen, M., Williams, C.K.I.: Gtm: The generative topographic mapping. Neural Computation 10, 215–234 (1998) Bishop, C.M., Svensen, M., Williams, C.K.I.: Gtm: The generative topographic mapping. Neural Computation 10, 215–234 (1998)
29.
Zurück zum Zitat Park, J., Zhang, Z., Zha, H.: Local smoothing for manifold learning. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. II–452–II–459 Vol. 2 (2004) Park, J., Zhang, Z., Zha, H.: Local smoothing for manifold learning. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. II–452–II–459 Vol. 2 (2004)
30.
Zurück zum Zitat Hein, M., Maier, M.: Manifold denoising. In: Advances in Neural Information Processing Systems 18: Proceedings of the 2006 Conference (NIPS) (2006) Hein, M., Maier, M.: Manifold denoising. In: Advances in Neural Information Processing Systems 18: Proceedings of the 2006 Conference (NIPS) (2006)
31.
Zurück zum Zitat Grassberger, P., Procaccia, I.: Measuring the strangeness of strange attractors. Physica D9(189), 189–208 (1983) Grassberger, P., Procaccia, I.: Measuring the strangeness of strange attractors. Physica D9(189), 189–208 (1983)
32.
Zurück zum Zitat Joliffe, I.T.: Principal Component Analysis. Springer-Verlag, New York (1986) Joliffe, I.T.: Principal Component Analysis. Springer-Verlag, New York (1986)
33.
Zurück zum Zitat de la Torre, F., Black, M.J.: A framework for robust subspace learning. International Journal of Computer Vision 54(1/2/3), 117–142 (2003) de la Torre, F., Black, M.J.: A framework for robust subspace learning. International Journal of Computer Vision 54(1/2/3), 117–142 (2003)
34.
Zurück zum Zitat Chang, H., Yeung, D.Y.: Robust locally linear embedding. Pattern Recognition 39, 1053–1065 (2006) Chang, H., Yeung, D.Y.: Robust locally linear embedding. Pattern Recognition 39, 1053–1065 (2006)
35.
Zurück zum Zitat Holland, P.W., Welsch, R.E.: Robust regression using iteratively reweighted least squares. Communications in Statistics - Theory and Methods 6(9), 813–827 (1977) Holland, P.W., Welsch, R.E.: Robust regression using iteratively reweighted least squares. Communications in Statistics - Theory and Methods 6(9), 813–827 (1977)
36.
Zurück zum Zitat Yin, J., Hu, D., Zhou, Z.: Noisy manifold learning using neighborhood smoothing embedding. Pattern Recognition Letters 29, 1613–1620 (2008) Yin, J., Hu, D., Zhou, Z.: Noisy manifold learning using neighborhood smoothing embedding. Pattern Recognition Letters 29, 1613–1620 (2008)
37.
Zurück zum Zitat Qiu, P.: The local piecewisely linear kernel smoothing procedure for fitting regression surfaces. Technometrics 46, 87–98 (2004) Qiu, P.: The local piecewisely linear kernel smoothing procedure for fitting regression surfaces. Technometrics 46, 87–98 (2004)
Metadaten
Titel
Modelling the Manifold
verfasst von
Harry Strange
Reyer Zwiggelaar
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-03943-5_3