<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Classification of perimetric data for supporting glaucoma diagnosis</dc:title><dc:creator>Belinc,	Janja	(Avtor)
	</dc:creator><dc:creator>Zorman,	Milan	(Mentor)
	</dc:creator><dc:subject>Eye disease</dc:subject><dc:subject>visual field</dc:subject><dc:subject>SPARK perimetry</dc:subject><dc:subject>pattern recognition</dc:subject><dc:subject>machine learning</dc:subject><dc:subject>supervised learning</dc:subject><dc:subject>ROC analysis</dc:subject><dc:description>The aim of the study: Glaucoma is a chronic, progressive and asymptomatic retinal disease which results in an irreversible visual field loss. The main objective of this Master’s thesis work was to study the applicability of classification techniques for supporting glaucoma diagnosis.
Research Methodology: In this study perimetric data was obtained by SPARK strategy implemented in Oculus perimeters and provided by medical experts from the Hospital Universitario de Canarias (HUC). This data was used for constructing the feature vectors for the classification problem. Feature vectors of 66 values and feature vectors of 6 values were tested in the experiments. The proposed classification study attempted to: a) demonstrate that the studied classifiers were able to distinguish between “healthy” and “glaucomatous” eyes using only perimetric data, and b) analyse which feature vector design was the most suitable to accomplish this task.
Results: The classification results showed that classifiers performed better on 6 than on 66 perimetry values, which demonstrated the suitability of the 6 points selected by the SPARK strategy and supported its use in medical field. 
Conclusion: In this study two remarkable findings for pattern recognition in perimetric data were obtained. Firstly, that reducing the dataset improved the efficiency of the studied classifier, and secondly, that simple pattern recognition models types were more efficient than complex ones.</dc:description><dc:publisher>[J. Belinc]</dc:publisher><dc:date>2018</dc:date><dc:date>2018-05-30 20:13:13</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>70615</dc:identifier><dc:identifier>UDK: 617.7-007.681:004.8(043.2)</dc:identifier><dc:identifier>COBISS_ID: 2428580</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:UDAM0HZP</dc:identifier><dc:language>sl</dc:language></metadata>
