Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "k-nearest neighbor" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Optimized jk-nearest neighbor based online signature verification and evaluation of main parameters
    Autorzy:
    Saleem, Muhammad
    Kovari, Bence
    Powiązania:
    https://bibliotekanauki.pl/articles/2097967.pdf
    Data publikacji:
    2021
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    k-nearest neighbor
    online signature verification
    classification
    Opis:
    In this paper, we propose an enhanced jk-nearest neighbor (jk-NN) algorithm for online signature verification. The effect of its main parameters is evaluated and used to build an optimized system. The results show that the jk-NN classifier improves the verification accuracy by 0.73–10% as compared to a traditional one-class k-NN classifier. The algorithm achieved reasonable accuracy for different databases: a 3.93% average error rate when using the SVC2004, 2.6% for the MCYT-100, 1.75% for the SigComp’11, and 6% for the SigComp’15 databases. These results followed a state-of-the-art accuracy evaluation where both forged and genuine signatures were used in the training phase. Another scenario is also presented in this paper by using an optimized jk-NN algorithm that uses specifically chosen parameters and a procedure to pick the optimal value for k using only the signer’s reference signatures to build a practical verification system for real-life scenarios where only these signatures are available. By applying the proposed algorithm, the average error rates that were achieved were 8% for SVC2004, 3.26% for MCYT-100, 13% for SigComp’15, and 2.22% for SigComp’11.
    Źródło:
    Computer Science; 2021, 22 (4); 539--551
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non-Invasive Hemoglobin Monitoring Device Using K-Nearest Neighbor and Artificial Neural Network Back Propagation Algorithms
    Autorzy:
    Munadi, R.
    Sussi, S.
    Fitriyanti, N.
    Ramadan, D. N.
    Powiązania:
    https://bibliotekanauki.pl/articles/2055237.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    invasive
    non-invasive
    k-nearest neighbor
    artificial neural network
    back propagation
    Opis:
    The invasive method of medically checking hemoglobin level in human body by taking the blood sample of the patient requiring a long time and injuring the patient is seen impractical. A non-invasive method of measuring hemoglobin levels, therefore, is made by applying the K-Nearest Neighbor (KNN) algorithm and the Artificial Neural Network Back Propagation (ANN-BP) algorithm with the Internet of Things-based HTTP protocol to achieve the high accuracy and the low end-to-end delay. Based on tests conducted on a Noninvasive Hemoglobin measuring device connected to Cloud Things Speak, the prediction process using algorithm by means of Python programming based on Android application could work well. The result of this study showed that the accuracy of the K-Nearest Neighbor algorithm was 94.01%; higher than that of the Artificial Neural Network Back Propagation algorithm by 92.45%. Meanwhile, the end-to-end delay was at 6.09 seconds when using the KNN algorithm and at 6.84 seconds when using Artificial Neural Network Back Propagation Algorithm.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 1; 13--18
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-view learning for software defect prediction
    Autorzy:
    Kiyak, Elife Ozturk
    Birant, Derya
    Birant, Kokten Ulas
    Powiązania:
    https://bibliotekanauki.pl/articles/2060905.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    software defect prediction
    multi-view learning
    machine learning
    k-nearest neighbor
    Opis:
    Background: Traditionally, machine learning algorithms have been simply applied for software defect prediction by considering single-view data, meaning the input data contains a single feature vector. Nevertheless, different software engineering data sources may include multiple and partially independent information, which makes the standard single-view approaches ineffective. Objective: In order to overcome the single-view limitation in the current studies, this article proposes the usage of a multi-view learning method for software defect classification problems. Method: The Multi-View k-Nearest Neighbors (MVKNN) method was used in the software engineering field. In this method, first, base classifiers are constructed to learn from each view, and then classifiers are combined to create a robust multi-view model. Results: In the experimental studies, our algorithm (MVKNN) is compared with the standard k-nearest neighbors (KNN) algorithm on 50 datasets obtained from different software bug repositories. The experimental results demonstrate that the MVKNN method outperformed KNN on most of the datasets in terms of accuracy. The average accuracy values of MVKNN are 86.59%, 88.09%, and 83.10% for the NASA MDP, Softlab, and OSSP datasets, respectively. Conclusion: The results show that using multiple views (MVKNN) can usually improve classification accuracy compared to a single-view strategy (KNN) for software defect prediction.
    Źródło:
    e-Informatica Software Engineering Journal; 2021, 15, 1; 163--184
    1897-7979
    Pojawia się w:
    e-Informatica Software Engineering Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Face Recognition Comparative Analysis Using Different Machine Learning Approaches
    Autorzy:
    Ahmed, Nisar
    Khan, Farhan Ajmal
    Ullah, Zain
    Ahmed, Hasnain
    Shahzad, Taimur
    Ali, Nableela
    Powiązania:
    https://bibliotekanauki.pl/articles/2024199.pdf
    Data publikacji:
    2021
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    linear discriminant analysis
    k-nearest neighbor
    support vector machine
    principal component analysis
    liniowa analiza dyskryminacyjna
    maszyna wektorów podporowych
    analiza głównych składowych
    Opis:
    The problem of a facial biometrics system was discussed in this research, in which different classifiers were used within the framework of face recognition. Different similarity measures exist to solve the performance of facial recognition problems. Here, four machine learning approaches were considered, namely, K-nearest neighbor (KNN), Linear Discriminant Analysis (LDA), Support Vector Machine (SVM), and Principal Component Analysis (PCA). The usefulness of multiple classification systems was also seen and evaluated in terms of their ability to correctly classify a face. A combination of multiple algorithms such as PCA+1NN, LDA+1NN, PCA+ LDA+1NN, SVM, and SVM+PCA was used. All of them performed with exceptional values of above 90% but PCA+LDA+1N scored the highest average accuracy, i.e. 98%.
    Źródło:
    Advances in Science and Technology. Research Journal; 2021, 15, 1; 265-272
    2299-8624
    Pojawia się w:
    Advances in Science and Technology. Research Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Zastosowanie metody mini-modeli opartej na hipersześcianie w procesie modelowania danych wielowymiarowych
    Application of mini-models method based on hypercube in the modeling process of multidimensional data
    Autorzy:
    Pietrzykowski, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/1367439.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Szczeciński. Wydawnictwo Naukowe Uniwersytetu Szczecińskiego
    Tematy:
    mini-model
    local regression
    k-nearest neighbor
    mathematical modeling
    instance based learning
    modelowania matematyczne
    algorytm najbliższych sąsiadów
    lokalna regresja
    metody bazujące na próbkach
    Opis:
    W artykule zaprezentowano metodę samo-uczenia mini-modeli (metodę MM) opartą na hiperbryłach w przestrzeni wielowymiarowej. Jest to metoda nowa i rozwojowa, będąca w trakcie intensywnych badań. Bazuje ona na próbkach pobieranych jedynie z lokalnego otoczenia punktu zapytania, a nie z obszarów odległych od tego punktu. Grupa punktów, używana w procesie uczenia mini-modelu jest ograniczona obszarem hiperbryły. Na tak zdefiniowanym lokalnym otoczeniu punktu zapytania metoda MM w procesie uczenia oraz obliczania odpowiedzi można użyć dowolnej metody aproksymacji. W artykule przedstawiono algorytm uczenia i działania metody w przestrzeni wielowymiarowej bazujący na hipersferycznym układzie współrzędnych. Metodę przebadano na zbiorach danych wielowymiarowych, a wyniki porównano z innymi metodami bazującymi na próbkach.
    The article presents self-learning method of mini-models (MM-method) based on polytopes in multidimensional space. The method is new and is an object of intensive research. MM method is the instance based learning method and uses data samples only from the local neighborhood of the query point. Group of points which are used in the model-learning process is constrained by a polytope area. The MM-method can on a defined local area use any approximation algorithm to compute mini-model answer for the query point. The article describes a learning technique based on hyper-spherical coordinate system. The method was used in the modeling task with multidimensional datasets. The results of numerical experiments were compared with other instance based methods.
    Źródło:
    Zeszyty Naukowe. Studia Informatica; 2015, 38; 91-103
    0867-1753
    Pojawia się w:
    Zeszyty Naukowe. Studia Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Machine learning-based analysis of English lateral allophones
    Autorzy:
    Piotrowska, Magdalena
    Korvel, Gražina
    Kostek, Bożena
    Ciszewski, Tomasz
    Czyżewski, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/908115.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    allophone
    audio features
    artificial neural network
    k-nearest neighbor
    self organizing map
    alofon
    cechy akustyczne
    sztuczna sieć neuronowa
    metoda najbliższych sąsiadów
    mapa samoorganizująca
    Opis:
    Automatic classification methods, such as artificial neural networks (ANNs), the k-nearest neighbor (kNN) and self-organizing maps (SOMs), are applied to allophone analysis based on recorded speech. A list of 650 words was created for that purpose, containing positionally and/or contextually conditioned allophones. For each word, a group of 16 native and non-native speakers were audio-video recorded, from which seven native speakers’ and phonology experts’ speech was selected for analyses. For the purpose of the present study, a sub-list of 103 words containing the English alveolar lateral phoneme /l/ was compiled. The list includes ‘dark’ (velarized) allophonic realizations (which occur before a consonant or at the end of the word before silence) and 52 ‘clear’ allophonic realizations (which occur before a vowel), as well as voicing variants. The recorded signals were segmented into allophones and parametrized using a set of descriptors, originating from the MPEG 7 standard, plus dedicated time-based parameters as well as modified MFCC features proposed by the authors. Classification methods such as ANNs, the kNN and the SOM were employed to automatically detect the two types of allophones. Various sets of features were tested to achieve the best performance of the automatic methods. In the final experiment, a selected set of features was used for automatic evaluation of the pronunciation of dark /l/ by non-native speakers.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 393-405
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies