2026-09-19T07:39:05Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/296652022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Joshua B. Tenenbaum.
Jayaraman, Gautam, 1981-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-03-24T16:13:11Z
2006-03-24T16:13:11Z
2003
2003
http://hdl.handle.net/1721.1/29665
53827547
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (p. 95-96).
In this thesis, I implemented a randomized nearest neighbors algorithm in order to optimize an existing dimensionality reduction algorithm. In implementation I resolved details that were not considered in the design stage, and optimized the nearest neighbor system for use by the dimensionality reduction system. By using the new nearest neighbor system as a subroutine, the dimensionality reduction system runs in time O(n log n) with respect to the number of data points. This enables us to examine data sets that were prohibitively large before.
by Gautam Jayaraman.
M.Eng.
96 p.
2810925 bytes
2810731 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Applying a randomized nearest neighbors algorithm to dimensionality reduction
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0b41509d-bb48-4810-ab1d-85e720407926">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Applying a randomized nearest neighbors algorithm to dimensionality reduction</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2003</PublicationDate>
<Authors>
<Author>
<DisplayName>Jayaraman, Gautam, 1981-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis, I implemented a randomized nearest neighbors algorithm in order to optimize an existing dimensionality reduction algorithm. In implementation I resolved details that were not considered in the design stage, and optimized the nearest neighbor system for use by the dimensionality reduction system. By using the new nearest neighbor system as a subroutine, the dimensionality reduction system runs in time O(n log n) with respect to the number of data points. This enables us to examine data sets that were prohibitively large before.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>