Academic literature on the topic 'Класифікації даних'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Класифікації даних.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Класифікації даних"
Prokopiv, M. M., S. K. Yevtushenko, and O. Ye Fartushna. "Класифікація мостових інфарктів." INTERNATIONAL NEUROLOGICAL JOURNAL 18, no. 1 (March 12, 2022): 30–34. http://dx.doi.org/10.22141/2224-0713.18.1.2022.926.
Full textGorokhovatskyi, V., A. Zaporozhchenko, Т. Siryk, and O. Tarasenko. "ДОСЛІДЖЕННЯ РЕЗУЛЬТАТИВНОСТІ ЗАСТОСУВАННЯ ОЗНАК РОЗПОДІЛІВ ДАНИХ ДЛЯ ОБЧИСЛЕННЯ РЕЛЕВАНТНОСТІ ОПИСІВ ЗОБРАЖЕНЬ." Системи управління, навігації та зв’язку. Збірник наукових праць 1, no. 59 (February 26, 2020): 68–73. http://dx.doi.org/10.26906/sunz.2020.1.068.
Full textКондратишин, А. Р., А. А. Курій, Д. Б. Коваль, and Я. І. Юрик. "КЛАСИФІКАЦІЇ КАРДІОМІОПАТІЙ: СУЧАСНИЙ СТАН ПИТАННЯ." Здобутки клінічної і експериментальної медицини, no. 4 (March 25, 2022): 12–20. http://dx.doi.org/10.11603/1811-2471.2021.v.i4.12795.
Full textФеній, Н. С., and Ю. І. Грицюк. "Автоматизація процесу класифікації текстових новин з інтернет-сайтів методами нейронної мережі." Scientific Bulletin of UNFU 30, no. 4 (September 17, 2020): 123–33. http://dx.doi.org/10.36930/40300421.
Full textМАШТАЛІР, Вадим, and Надія РИЖЕВА. "ДОСЛІДЖЕННЯ МЕРЕЖІ ТА КЛАСИФІКАЦІЯ ВІЙСЬКОВО-ІСТОРИЧНИХ МУЗЕЇВ В УКРАЇНІ." Східноєвропейський історичний вісник, no. 19 (June 30, 2021): 217–27. http://dx.doi.org/10.24919/2519-058x.19.233834.
Full textНаливайко, О. Ю. "Методологічні аспекти класифікації персональних даних." Держава і право, Вип. 64 (2014): 167–72.
Find full textGorokhovatskyi, V., S. Gadetska, and R. Ponomarenko. "ЛОГІЧНИЙ АНАЛІЗ ТА ОБРОБЛЕННЯ ДАНИХ ЗАДЛЯ КЛАСИФІКАЦІЇ ЗОБРАЖЕНЬ НА ПІДСТАВІ ФОРМУВАННЯ СТАТИСТИЧНОГО ЦЕНТРУ ОПИСУ." Системи управління, навігації та зв’язку. Збірник наукових праць 4, no. 56 (September 11, 2019): 43–48. http://dx.doi.org/10.26906/sunz.2019.4.043.
Full textМартинюк, Роман. "Класифікація форми правління: проблема вибору критеріїв." Право України, no. 12/2018 (2018): 207. http://dx.doi.org/10.33498/louu-2018-12-207.
Full textЯременко, В., and Д. Будьонний. "Підхід до використання фільтра блума для багатокласової класифікації текстових даних в режимі реального часу." КОМП’ЮТЕРНО-ІНТЕГРОВАНІ ТЕХНОЛОГІЇ: ОСВІТА, НАУКА, ВИРОБНИЦТВО, no. 36 (November 28, 2019): 153–59. http://dx.doi.org/10.36910/6775-2524-0560-2019-36-24.
Full textVerhun, V. R. "Характеристика методів розв'язання задачі класифікації в інтелектуальному аналізі даних навчальних програм." Scientific Bulletin of UNFU 29, no. 6 (June 27, 2019): 136–39. http://dx.doi.org/10.15421/40290626.
Full textDissertations / Theses on the topic "Класифікації даних"
Охотний, С. М. "Логічні закономірності в задачах класифікації даних у технологіях комп’ютерного зору." Thesis, ЦНТУ, 2017. http://dspace.kntu.kr.ua/jspui/handle/123456789/7492.
Full textГалкін, Олександр Анатолійович. "Методика розширюваних гіперсфер на основі методу опорних векторів для задач класифікації даних." Diss. of Candidate of Physical and Mathematical Sciences, М-во освіти і науки України, Київ. нац. ун-т ім. Тараса Шевченка, 2013.
Find full textПовхан, Ігор Федорович. "Методи та принципи побудови дерев класифікації дискретних об’єктів для інтелектуального аналізу даних." Diss., Національний університет "Львівська політехніка", 2021. https://ena.lpnu.ua/handle/ntb/56709.
Full textАбдураімов, Таір Заірович. "Алгоритм глибинного аналізу даних для задачі класифікації на основі штучного бджолиного рою." Master's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/38328.
Full textActuality of theme. As the size of digital information grows exponentially, large amounts of raw data need to be extracted. To date, there are several methods to customize and process data according to our needs. The most common method is to use Data Mining. Data Mining is used to extract implicit, valid and potentially useful knowledge from large amounts of raw data. The knowledge gained must be accurate, readable and easy to understand. In addition, the data mining process is also called the knowledge discovery process, which has been used in most new interdisciplinary fields, such as databases, artificial intelligence statistics, visualization, parallel computing, and other fields. One of the new and extremely powerful algorithms used in Data Mining is evolutionary algorithms and swarm-based approaches, such as the ant algorithm and particle swarm optimization. In this paper, it is proposed to use a fairly new idea of the swarm of bee swarm algorithm for data mining for a widespread classification problem. Purpose: to develop an algorithm for data mining for the classification problem based on the swarm of bee swarms, which exceeds other common classifiers in terms of accuracy of results and consistency. The object of research is the process of data mining for the classification problem. The subject of the study is the use of a swarm of bee swarms for data mining. Research methods. Methods of parametric research of heuristic algorithms, and also methods of the comparative analysis for algorithms of data mining are used. The scientific novelty of the work is as follows: 1. As a result of the analysis of existing solutions for the classification problem, it is decided to use such metaheuristics as the swarm of bee swarm. 2. The implementation of the bee algorithm for data mining is proposed. The practical value of the results obtained in this work is that the developed algorithm can be used as a classifier for data mining. In addition, the proposed adaptation of the bee algorithm can be considered as a useful and accurate solution to such an important problem as the problem of data classification. Approbation of work. The main provisions and results of the work were presented and discussed at the scientific conference of undergraduates and graduate students "Applied Mathematics and Computing" PMK-2019 (Kyiv, 2019), as well as at the scientific conference of undergraduates and graduate students "Applied Mathematics and Computing" PMK-2020 (Kyiv, 2020). Structure and scope of work. The master's dissertation consists of an introduction, four chapters, conclusions and appendices. The introduction provides a general description of the work, assesses the current state of the problem, substantiates the relevance of research, formulates the purpose and objectives of research, shows the scientific novelty of the results and the practical value of the work, provides information on testing and implementation. The first section discusses the data mining algorithms used for the classification problem. The possibility of using heuristic algorithms, namely the bee swarm algorithm for this problem, is substantiated. The second section discusses in detail the algorithm of the bee swarm and the principles of its operation, also describes the proposed method of its application for data mining, namely for the classification problem. The third section describes the developed algorithm and the software application in which it is implemented. In the fourth section the estimation of efficiency of the offered algorithm, on the basis of testing of algorithm, and also the comparative analysis between the developed algorithm and already different is resulted. The conclusions present the results of the master's dissertation. The work is performed on 89 sheets, contains a link to the list of used literature sources with 18 titles. The paper presents 38 figures and 2 appendices.
Безменова, Ольга Миколаївна. "Про результати діагностування наявності захворювань з використанням алгоритмів класифікації на основі нечітких правил." Thesis, Національний технічний університет "Харківський політехнічний інститут", 2016. http://repository.kpi.kharkov.ua/handle/KhPI-Press/45814.
Full textДушутін, Владислав Володимирович. "Паралельний адаптивний вирішувач для лінійних систем на основі нейронної мережі." Master's thesis, Київ, 2018. https://ela.kpi.ua/handle/123456789/23556.
Full textNow one of the main stages in the study of objects, phenomena and processes of different nature is mathematical modeling and related computer experiment. Numerous experiments give an opportunity to plan a full-scale experiment, as well as to get new knowledge about those processes and phenomena for which it is difficult, or in general, impossible to carry out a full-scale experiment. A large number of mathematical models can be described by systems of linear algebraic equations (SLRs) with soldered matrices after performing the corresponding transformations. The main feature of such systems is their large orders and a small number of non-zero elements. Large orders of SLAR arise due to the fact that researchers want to get the most reliable results, which is why more detailed models are being built. The small number of non-zero elements is due to the discretization of the model. In particular, systems of equations with sparse matrices arise in problems of analysis of the strength of structures in civil and industrial construction, filtration, heat and mass transfer, and others like that. Scope of the methods of solving SLR with sparse matrices is constantly expanding. Because of this, there is an interest in the problem of constructing effective methods for solving such systems, whose orders exceed hundreds of thousands. Classical results concerning the development of methods for solving SLRR with rarefied matrices are covered in a series of monographs of American and domestic authors: A. George, J. Liu, S. Pisanetski, J. Golub, R. Tjurson, I. A. Blatova, ME Ekseryrovskaya and others. Also, the requirements for the computer technology used to conduct a computer experiment are growing. It must provide sufficient speed and have the required amount of resources so that the result of the experiment can be obtained over a relatively short period of time. Now in the market there are many different architectures of computers with parallel computing organization. The most productive are the platforms of the so-called "hybrid" architecture. These systems combine MIMD (multiple instructions - multiple data) and SIMD architecture (single instruction - multiple data), in particular, in a multi-core processor system, computations are accelerated by means of a graphical accelerator. Hence, one of the effective approaches to solving SLR with sparse matrices is the construction of parallel algorithms that take into account the peculiarities of computer architecture. The main problems of developing effective parallel algorithms are: analysis of the structure of the matrix, or bringing it to the corresponding form, using appropriate conversion algorithms; choice of effective data decomposition; determining the effective number of processor cores and graphic accelerators used for calculations; definition of the interprocess communication topology, which reduces the number of communications and synchronizations. It is precisely for analyzing the structure of a sparse matrix that a neural network is used which allows the selection of groups of non-zero elements that can be processed independently. The results of the analysis will be based on the decomposition of data and the number of computing cores to be selected, which will provide the shortest settlement time for a particular matrix structure. The purpose and objectives of the study. The purpose of the work is to develop and research parallel methods and computer algorithms for research and solving SLR with sparse matrices of irregular structure on computers of MIMD architecture and MIMD and SIMD architecture combinations, testing of algorithms in mathematical modeling in applied problems. The research tasks include: • development and research of iterative parallel algorithms for SLR with sparse matrices of irregular structure with approximate data; • development of algorithms and programs for investigating the validity of solutions obtained by direct and iterative methods; • Approbation of algorithms for mathematical modeling in applied problems. The object of the study is the mathematical models described by SLAR with sparse matrices of the irregular structure. The subject of the study is parallel methods and computer algorithms for locating the SLR solution with sparse matrices of the irregular structure. Research methods. The paper uses methods of matrix theory, linear algebra, graph theory, functional analysis, error theory, and the theory of neural networks.
Кириченко, І. О. "Інтелектуальна технологія детектування стану трубопроводів з аугментацією даних в режимі екзамену." Master's thesis, Сумський державний університет, 2021. https://essuir.sumdu.edu.ua/handle/123456789/86859.
Full textМельник, Каріна Володимирівна. "Особливості обробки даних для медичної експертної системи." Thesis, Національний технічний університет "Харківський політехнічний інститут", 2010. http://repository.kpi.kharkov.ua/handle/KhPI-Press/44685.
Full textКрамар, Іван Ігорович. "Кластеризація даних, що збираються з відібраних джерел науково-технічної інформації." Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/36639.
Full textThe aim of the work is to use the clustering of scientific and technical data not only for the visual representation of objects, but also for the recognition of new ones. The purpose of document clustering is to automatically detect groups of semantically similar documents among a given fixed set. Groups are formed only on the basis of pairwise similarity of document descriptions, and no characteristics of these groups are set in advance. Methods for deleting uninformative words are considered: deletion of stop words, stemming, N-diagrams, case reduction. The following methods were used to highlight keywords and classify the results: dictionary, statistical and based on the Y-interpretation of Bradford's law, TF-IDF measure, F-measure and the method of licorice patterns. Python programming language was chosen to implement the system of cluster analysis of scientific and technical data, a high-level, the implementation of the interpreter 2.7. This program code is easier to read, its reuse and maintenance is much easier than using program code in other languages.
Целью работы является применение кластеризации научно-технических данных не только для наглядного представления объектов, но и для распознавания новых. Целью кластеризации документов является автоматическое выявление групп семантически похожих документов среди заданной фиксированной множества. Группы формируются только на основе попарно сходства описаний документов, и никакие характеристики этих групп не задаются заранее. Для удаления неинформативных слов рассмотрены методы: удаление стоп-слов, стемминг, N-диаграммы, приведение регистра. Для выделения ключевых слов и классификации результатов использованы следующие методы: словарный, статистический и построен на основе Y-интерпретации закона Брэдфорда, TF-IDF мера, F-мера и способ лакричным шаблонов. Для реализации системы кластерного анализа научно-технических данных избран высокоуровневый язык программирования Python, реализация интерпретатора 2.7. Данный программный код читается легче, его многократное использование и обслуживание выполняется гораздо проще, чем использование программного кода на других языках.
Кунцев, С. В. "Застосування системи data mining бібліотеки Xelopes для розв'язання задач класифікаці." Thesis, ІНЖЕК, 2012. http://essuir.sumdu.edu.ua/handle/123456789/63969.
Full textTo build a model based on the method of classification used software system Data Mining Library Xelopes. Solved two problems of classification. Completed application model for the new data. It is shown that the system is easy, it can be used to teach students techniques Data Mining, as well as for solving classification problems arising in the economy.
Reports on the topic "Класифікації даних"
Загородько, П. Можливості квантового програмування для реалізації задач машинного навчання. Криворізький державний педагогічний університет, 2020. http://dx.doi.org/10.31812/123456789/5380.
Full textЛозовська, Катерина Олександрівна. Стереотипізація жіночих образів (на матеріалі епізодичної відеогри Life is strange). МДУ, 2021. http://dx.doi.org/10.31812/123456789/4391.
Full text