Informacja

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

Wyszukujesz frazę "k-NN classification" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Some problems with construction of the k-NN classifier for recognition of an experimental respiration pathology
Autorzy:
Jóźwik, A.
Sokołowska, B.
Powiązania:
https://bibliotekanauki.pl/articles/332910.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
rozpoznawanie wzorców
klasyfikacja nadzorowana
zasada k-NN
wybór funkcji
oddychanie
wentylacja
paraliż
przepona
pattern recognition
supervised classification
k-NN rule
feature selection
respiration
ventilation
paralysis
diaphragm
Opis:
An objective of the work is to demonstrate some difficulties with construction of a classifier based on the k-NN rule. The standard k-NN classifier and the parallel k-NN classifier have been chosen as the two most powerful approaches. This kind of classifiers has been applied to automatic recognition of diaphragm paralysis degree. The classifier construction consists in determination of the number of nearest neighbors, selection of features and estimation of the classification quality. Three classes of muscle pathology, including the control class, and five ventilatory parameters are taken into account. The data concern a model of the diaphragm pathology in a cat. The animals were forced to breathe in three different experimental situations: air, hypercapnic and hypoxic conditions. A separate classifier is constructed for each kind of the mentioned situations. The calculation of the misclassification rate is based on the leave one out and on the testing set method. Several computational experiments are suggested for the correct feature selection, the classifier type choice and the misclassification probability estimation.
Źródło:
Journal of Medical Informatics & Technologies; 2002, 3; MI89-97
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Music Playlist Generation using Facial Expression Analysis and Task Extraction
Autorzy:
Sen, A.
Popat, D.
Shah, H.
Kuwor, P.
Johri, E.
Powiązania:
https://bibliotekanauki.pl/articles/908868.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
facial expression analysis
emotion recognition
feature extraction
viola jones face detection
gabor filter
adaboost
k-NN algorithm
task extraction
music classification
playlist generation
Opis:
In day to day stressful environment of IT Industry, there is a truancy for the appropriate relaxation time for all working professionals. To keep a person stress free, various technical or non-technical stress releasing methods are now being adopted. We can categorize the people working on computers as administrators, programmers, etc. each of whom require varied ways in order to ease themselves. The work pressure and the vexation of any kind for a person can be depicted by their emotions. Facial expressions are the key to analyze the current psychology of the person. In this paper, we discuss a user intuitive smart music player. This player will capture the facial expressions of a person working on the computer and identify the current emotion. Intuitively the music will be played for the user to relax them. The music player will take into account the foreground processes which the person is executing on the computer. Since various sort of music is available to boost one's enthusiasm, taking into consideration the tasks executed on the system by the user and the current emotions they carry, an ideal playlist of songs will be created and played for the person. The person can browse the playlist and modify it to make the system more flexible. This music player will thus allow the working professionals to stay relaxed in spite of their workloads.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2016, 16, 2; 1-6
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Binary Classification of Heart Failures Using k-NN with Various Distance Metrics
Autorzy:
Udovychenko, Y.
Popov, A.
Chaikovsky, I.
Powiązania:
https://bibliotekanauki.pl/articles/226330.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
magnetocardiography
current density imaging
current density distribution map
k-NN classification
negative Tpeak
heart failure diagnostics
Mahalanobis distance
Cityblock distance
Eucleadian distance
Chebyshev distance
Opis:
Magnetocardiography is a sensitive technique of measuring low magnetic fields generated by heart functioning, which is used for diagnostics of large number of cardiovascular diseases. In this paper, k-nearest neighbor (k-NN) technique is used for binary classification of myocardium current density distribution maps (CDDM) from patients with negative T-peak, male and female patients with microvessels (diffuse) abnormalities and sportsmen, which are compared with normal control subjects. Number of neighbors for k-NN classifier was selected to obtain highest classification characteristics. Specificity, accuracy, precision and sensitivity of classification as functions of number of neighbors in k-NN are obtained for classification with several distance measures: Mahalanobis, Cityblock, Eucleadian and Chebyshev. Increase of the accuracy of classification for all groups up to 10% was obtained using Cityblock distance metric in binary k-NN classifier with 19 - 27 neighbors, comparing to other metrics. Obtained results are acceptable for further patient’s state evaluation.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 4; 339-344
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A k-Nearest Neighbors Method for Classifying User Sessions in E-Commerce Scenario
Autorzy:
Suchacka, G.
Skolimowska-Kulig, M.
Potempa, A.
Powiązania:
https://bibliotekanauki.pl/articles/308645.pdf
Data publikacji:
2015
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
data mining
e-commerce
k-Nearest Neighbors
k-NN
log file analysis
online store
R-project
supervised classification
web mining
Web store
Web traffic
Web usage mining
Opis:
This paper addresses the problem of classification of user sessions in an online store into two classes: buying sessions (during which a purchase confirmation occurs) and browsing sessions. As interactions connected with a purchase confirmation are typically completed at the end of user sessions, some information describing active sessions may be observed and used to assess the probability of making a purchase. The authors formulate the problem of predicting buying sessions in a Web store as a supervised classification problem where there are two target classes, connected with the fact of finalizing a purchase transaction in session or not, and a feature vector containing some variables describing user sessions. The presented approach uses the k-Nearest Neighbors (k-NN) classification. Based on historical data obtained from online bookstore log files a k-NN classifier was built and its efficiency was verified for different neighborhood sizes. A 11-NN classifier was the most effective both in terms of buying session predictions and overall predictions, achieving sensitivity of 87.5% and accuracy of 99.85%.
Źródło:
Journal of Telecommunications and Information Technology; 2015, 3; 64-69
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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