Zobrazeno 1 - 10
of 79
pro vyhledávání: '"partial distance"'
Publikováno v:
Cybernetics and Information Technologies, Vol 22, Iss 2, Pp 36-49 (2022)
Learning Vector Quantization (LVQ) is one of the most widely used classification approaches. LVQ faces a problem as when the size of data grows large it becomes slower. In this paper, a modified version of LVQ, which is called PDLVQ is proposed to ac
Externí odkaz:
https://doaj.org/article/d0037f682795414fb6790d5845ff5238
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Access, Vol 7, Pp 37059-37070 (2019)
Non-exhaustive search is widely used in the approximate nearest neighbor (ANN) search. In this paper, we propose a new cell-level search-based non-exhaustive ANN search algorithm in the framework of product quantization (PQ) called cell-level PQ to s
Externí odkaz:
https://doaj.org/article/a7eb7712f59e4db893aa9438b8d2970a
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
This paper explores intellectual and social proximity among scholarly journals by using network fusion techniques. Similarities among journals are initially represented by means of a three-layer network based on co-citations, common authors and commo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2f684fcf30f1cc286eb086240517e28
http://hdl.handle.net/11365/1173323
http://hdl.handle.net/11365/1173323
Autor:
Han, Zhi
This dissertation is dedicated to study the modeling of drift control in foreign exchange reserves management and design the fast algorithm of statistical inference with its application in high dimensional data analysis. The thesis has two parts. The
Externí odkaz:
http://hdl.handle.net/1853/54401
Autor:
Panday, Deepak
The weighted variant of k-Means (Wk-Means), which assigns values to features based on their relevance, is a well-known approach to address the shortcoming of k-Means with data containing noisy and irrelevant features. This research aims first to expl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1972368fbeb877f1f89d80f7a003358a
Archetypal Analysis With Missing Data: See All Samples by Looking at a Few Based on Extreme Profiles
Publikováno v:
AMERICAN STATISTICIAN
r-FISABIO: Repositorio Institucional de Producción Científica
Fundación para el Fomento de la Investigación Sanitaria y Biomédica de la Comunitat Valenciana (FISABIO)
Repositori Universitat Jaume I
Universitat Jaume I
r-FISABIO. Repositorio Institucional de Producción Científica
instname
r-FISABIO: Repositorio Institucional de Producción Científica
Fundación para el Fomento de la Investigación Sanitaria y Biomédica de la Comunitat Valenciana (FISABIO)
Repositori Universitat Jaume I
Universitat Jaume I
r-FISABIO. Repositorio Institucional de Producción Científica
instname
In this article, we propose several methodologies for handling missing or incomplete data in archetype analysis (AA) and archetypoid analysis (ADA). AA seeks to find archetypes, which are convex combinations of data points, and to approximate the sam
Publikováno v:
IEEE Access, Vol 7, Pp 37059-37070 (2019)
Non-exhaustive search is widely used in the approximate nearest neighbor (ANN) search. In this paper, we propose a new cell-level search-based non-exhaustive ANN search algorithm in the framework of product quantization (PQ) called cell-level PQ to s
Autor:
Byoungwook Kim
Publikováno v:
Symmetry, Vol 9, Iss 4, p 58 (2017)
The k-means is one of the most popular and widely used clustering algorithm; however, it is limited to numerical data only. The k-prototypes algorithm is an algorithm famous for dealing with both numerical and categorical data. However, there have be
Externí odkaz:
https://doaj.org/article/a4f9071c2e884f619188654444322d10