Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarbauskaitė, Rasa-
dc.contributor.authorKurasova, Olga-
dc.contributor.authorDzemyda, Gintautas-
dc.description.abstractThis paper deals with a method, called locally linear embedding. It is a nonlinear dimensionality reduction technique that computes low-dimensional, neighbourhood preserving embeddings of high dimensional data and attempts to discover nonlinear structure in high dimensional data. The implementation of the algorithm is fairly straightforward, as the algorithm has only two control parameters: the number of neighbours of each data point and the regularisation parameter. The mapping quality is quite sensitive to these parameters. In this paper, we propose a new way for selecting the number of the nearest neighbours of each data point. Our approach is experimentally verified on two data sets: artificial data and real world picturesen
dc.description.sponsorshipMatematikos ir informatikos institutas-
dc.description.sponsorshipVilniaus pedagoginis universitetas-
dc.description.sponsorshipVytauto Didžiojo universitetas-
dc.description.sponsorshipŠvietimo akademija-
dc.format.extentp. 359-364-
dc.relation.ispartofInformation technology and control = Informacinės technologijos ir valdymas. Kaunas : Technologija, 2007, Vol. 36, no. 4-
dc.relation.isreferencedbyScience Citation Index Expanded (Web of Science).-
dc.subjectLocally linear embeddingen
dc.subjectDimensionality reductionen
dc.subjectManifold learningen
dc.subject.otherInformatika / Informatics (N009)-
dc.titleSelection of the number of neighbours of each data point for the locally linear embedding algorithmen
dc.typeStraipsnis kitose duomenų bazėse / Article in other databases (S4)-
local.object{"source": {"code": "vdu", "handle": "55796"}, "publisher": {"other": ["Technologija"], "list": false}, "db": {"clarivate": false, "scopus": false, "list": true}, "issn": ["1392-124X"], "code": "S4", "subject": ["N009"], "url": [""], "country": "LT", "language": "en", "area": "N", "original": true, "pages": 6, "sheets": 0.429, "timestamp": "20200129153255.0", "account": {"year": 2007, "late": false}, "na": 3, "nip": 0, "affiliation": [{"contribution": 0.33333333333333, "aip": 2, "rel": "aut", "org": [{"create": false, "contribution": 0.16666666666667, "name": "Vilniaus pedagoginis universitetas", "id": "111955557"}, {"create": true, "contribution": 0.16666666666667, "name": "Vytauto Didžiojo universitetas", "id": "111950396", "level": "0", "type": "uni", "research": "1", "status": "1", "unit": {"name": "Švietimo akademija", "id": "08", "level": "1", "type": "fak", "research": "1", "status": "1"}}], "id": "F1EE210C24B0960D7FD8C1EDE0777D10", "lname": "Karbauskaitė", "fname": "Rasa", "status": "0", "name": "Karbauskaitė, Rasa"}, {"contribution": 0.33333333333333, "aip": 2, "rel": "aut", "org": [{"create": true, "contribution": 0.16666666666667, "name": "Vytauto Didžiojo universitetas", "id": "111950396", "level": "0", "type": "uni", "research": "1", "status": "1", "unit": {"name": "Švietimo akademija", "id": "08", "level": "1", "type": "fak", "research": "1", "status": "1"}}, {"create": false, "contribution": 0.16666666666667, "name": "Matematikos ir informatikos institutas", "id": "111955557"}], "id": "DDC965361F1E596228637C42D52F5CA3", "lname": "Kurasova", "fname": "Olga", "status": "0", "name": "Kurasova, Olga"}, {"contribution": 0.33333333333333, "aip": 2, "rel": "aut", "org": [{"create": true, "contribution": 0.16666666666667, "name": "Vytauto Didžiojo universitetas", "id": "111950396", "level": "0", "type": "uni", "research": "1", "status": "1", "unit": {"name": "Švietimo akademija", "id": "08", "level": "1", "type": "fak", "research": "1", "status": "1"}}, {"create": false, "contribution": 0.16666666666667, "name": "Matematikos ir informatikos institutas", "id": "111955557"}], "id": "8E8A41FB1CF2AC86A63038CEF0ABE71F", "lname": "Dzemyda", "fname": "Gintautas", "status": "0", "name": "Dzemyda, Gintautas"}]}-
item.fulltextWith Fulltext-
item.grantfulltextopen-Švietimo akademija-Švietimo akademija-Švietimo akademija-
Appears in Collections:Universiteto mokslo publikacijos / University Research Publications
Files in This Item:
marc.xml8 kBXMLView/Open

MARC21 XML metadata

Show simple item record
Export via OAI-PMH Interface in XML Formats
Export to Other Non-XML Formats

CORE Recommender

Citations 1

checked on Sep 12, 2020

Page view(s)

checked on Jan 7, 2020


checked on Jan 7, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.