ACM Home Page
Please provide us with feedback. Feedback
Data embedding techniques and applications
Full text PdfPdf (521 KB)
Source ACM International Conference Proceeding Series; Vol. 160 archive
Proceedings of the 2nd international workshop on Computer vision meets databases table of contents
Baltimore, MD
SESSION: Multimedia modeling and querying table of contents
Pages: 29 - 33  
Year of Publication: 2005
ISBN:1-59593-151-1
Author
Li Yang  Western Michigan University, Kalamazoo, Michigan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 38,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1160939.1160948
What is a DOI?

ABSTRACT

As an effective way for dimensionality reduction, data embedding has direct applications in data mining, data indexing and searching, information retrieval, and multimedia data processing. As two representative techniques for data embedding, both Isomap and LLE require the construction of neighborhood graphs on which every point is connected to its neighbors. This paper reviews several techniques that have been developed to construct connected neighborhood graphs. These methods have made Isomap and LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. Application-related issues of data embedding techniques are also discussed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Balasubramanian, E. L. Schwartz, J. B. Tenenbaum, V. de Silva, and J. C. Langford. The Isomap algorithm and topological stability. Science, 295:7a, Jan. 2002.
 
2
T. F. Cox and M. A. A. Cox. Multidimensional Scaling, 2nd Edition. Chapman & Hall, 2001.
 
3
P. Demartines and J. Herault. Curvilinear component analysis: A self-organizing neural network for nonlinear mapping of data sets. IEEE Trans. Neural Networks, 8(1):148--154, Jan. 1997.
4
 
5
S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM J. Computing, 4(4):507--518, Dec. 1975.
 
6
 
7
J. J. W. Sammon. A nonlinear mapping for data structure analysis. IEEE Trans. Computers, C-18(5):401--409, May 1969.
 
8
J. Kruskal. Multidimensional scaling by optimizing goodness-of-fit to a nonmetric hypothesis. Psychometrika, 29:1--27, 1964.
 
9
J. A. Lee, A. Lendasse, N. Donckers, and M. Verleysen. A robust nonlinear projection method. In Proc. 8th European Symp. Artificial Neural Networks (ESANN2000), Bruges, Belgium, Apr. 2000.
 
10
K. Menger. Zur allgemeinen kurventheorie. Fund. Math., 10:95--115, 1927.
 
11
S. T. Roweis and L. K. Saul. Nonlineaar dimensionality reduction by locally linear embedding. Science, 290:2323--2326, Dec. 2000.
 
12
 
13
H. S. Seung and D. Lee. The manifold ways of perception. Science, 290:2268--2269, Dec. 2000.
 
14
J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319--2323, Dec. 2000.
 
15
 
16
 
17
 
18
 
19
 
20
H. Zha and Z. Zhang. Isometric embedding and continuum ISOMAP. In Proc. 20th Inter. Conf. Machine Learning (ICML'03), pages 864--871, Washington, DC, Aug. 2003.
 
21
C. Zhang, J. Wang, N. Zhao, and D. Zhang. Reconstruction and analysis of multi-pose face images based on nonlinear dimensionality reduction. Pattern Recognition, 37(2):325--336, Feb. 2004.