z-logo
Premium
Spectral clustering in eye‐movement researches
Author(s) -
Gere Attila,
Kovács Sándor,
Sipos László
Publication year - 2018
Publication title -
journal of chemometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.47
H-Index - 92
eISSN - 1099-128X
pISSN - 0886-9383
DOI - 10.1002/cem.3003
Subject(s) - cluster analysis , computer science , artificial intelligence , fuzzy clustering , pattern recognition (psychology) , silhouette , centroid , spectral clustering , hierarchical clustering , single linkage clustering , correlation clustering , cure data clustering algorithm , data mining
Eye tracking is a widely used technology to capture the eye movements of participants completing different tasks. Several eye‐tracking parameters are measured, which later can be used to characterize the gazing pattern of the individuals. Clustering based on the path walked on by the participants may enable the researchers to create clusters based on the unconscious personality and thinking style. Common clustering methods generally are unable to handle path data; hence, new dynamic variables are needed. Spectral clustering can handle these types of data well. Spectral clustering handles clustering as a graph partitioning problem without making specific assumptions on the form of the clusters and uses eigenvectors of matrices derived from the data. This way, data are mapped to a low‐dimensional space, which can be easily clustered. Different food choice tasks were presented, and each of the 149 participants had to choose 1 product of the presented 4 and later from 8 alternatives. A new measure was introduced based on all 3 consecutive points from the fixations, and the areas of the triangles formed by these 3 points were computed. The new eye‐movement index captures the temporal variation and also considers the orientation of the fixation points. Spectral clustering resulted 5 balanced clusters defined by Dunn, Silhouette, and C‐indices. Results were compared to the most widely applied hierarchical and centroid‐based clustering ( k ‐means) methods. Spectral clustering achieved the best results in clustering indices and cluster sizes proved to be more balanced; hence, it outperforms the commonly used applied hierarchical and k ‐means.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here