Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Raghunadh Pasunuri"'
Publikováno v:
Proceedings of International Conference on Computational Intelligence and Data Engineering ISBN: 9789811587665
A Spatial data structure such as kd-tree is a proven data structure in searching Nearest Neighbors of a query point. However, constructing a kd-tree for determining the nearest neighbors becomes a computationally difficult task as the size of the dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90df2b1f6e8371df98e3ea4c8a50cc2a
https://doi.org/10.1007/978-981-15-8767-2_4
https://doi.org/10.1007/978-981-15-8767-2_4
Publikováno v:
Communication and Intelligent Systems ISBN: 9789811533242
Principal component analysis (PCA) is a commonly used statistical technique for unsupervised dimensionality reduction, with a drawback of high-computational cost. Random projection (RP) is a matrix-based dimensionality reduction (DR) technique, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5eeb6875e317613aca686d443b98c455
https://doi.org/10.1007/978-981-15-3325-9_26
https://doi.org/10.1007/978-981-15-3325-9_26
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811312793
Principal Component Analysis (PCA) is a very famous statistical tool for representing the data within lower dimension embedding. K-means is a prototype (centroid)-based clustering technique used in unsupervised learning tasks. Random Projection (RP)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5da8a6e2307c4a6ca9a17ccc7b67db5
https://doi.org/10.1007/978-981-13-1280-9_44
https://doi.org/10.1007/978-981-13-1280-9_44
Publikováno v:
Harmony Search and Nature Inspired Optimization Algorithms ISBN: 9789811307607
Random Projection has been used in many applications for dimensionality reduction. In this paper, a variant to the iterative random projection K-means algorithm to cluster high-dimensional data has been proposed and validated experimentally. Iterativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::059132522c8512efd080941fe4497a2e
https://doi.org/10.1007/978-981-13-0761-4_14
https://doi.org/10.1007/978-981-13-0761-4_14
Publikováno v:
2016 2nd International Conference on Contemporary Computing and Informatics (IC3I).
Nearest Neighbor Search is the basic operation that has been used to perform similarity search in vast areas like Content-Based Image Retrieval (CBIR), Web Search Engines, Micro Array Data Analysis, Recommender Systems, and many more. In this work we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bc7085cc67b3600b44c4c1f693b0a11
https://doi.org/10.1109/ic3i.2016.7918012
https://doi.org/10.1109/ic3i.2016.7918012
