Pattern Recognition of Subconscious Underpinnings of Cognition using Ultrametric Topological Mapping of Thinking and Memory

Pattern Recognition of Subconscious Underpinnings of Cognition using Ultrametric Topological Mapping of Thinking and Memory

Fionn Murtagh (Department of Computing and Mathematics, University of Derby, Derby, UK & Department of Computing, Goldsmiths University of London, London, UK)
DOI: 10.4018/ijcini.2014100101
OnDemand PDF Download:
No Current Special Offers


The author reviews the theory and practice of determining what parts of a data set are ultrametric. He describes the potential relevance of ultrametric topology as a framework for unconscious thought processes. This view of ultrametric topology as a framework that complements metric-based, conscious, Aristotelian logical reasoning comes from the work of the Chilean psychoanalyst, Ignacio Matte Blanco. Taking text data, the author develops an algorithm for finding local ultrametricity in such data. He applies that in two case studies. The first relates to a large set of dream reports, and therefore can possibly recall traces of unconscious thought processes. The second case study uses Twitter social media, and has the aim of picking up underlying associations. The author's case studies are selective in regard to names of people and objects, and are focused in order to highlight the principle of his approach, which is one of particular pattern finding in textual data.
Article Preview

1. Introduction

First, we consider inherent metric and ultrametric properties of data, given either a set of points endowed with at least a dissimilarity function, or a set of points in a coordinate space. Following the outlining of how we can characterize data in regard to how metric it is, we review the characterizing of data in regard to how ultrametric the data is. That can include signal data in meteorology, finance, biomedicine, telecommunications, and so on. It can also include document texts such as literature, technical reports, and social media. Objectives of such characterization include the following:

  • The embeddability of data, in a metric space if metric characterization is the aim, and in an ultrametric topology or hierarchical clustering or rooted tree topology, if ultrametric characterization is the aim;

  • In this work, with the research hypothesis that ultrametric topology can express or represent subconscious thought processes, we want to determine “islands” of inherent local ultrametricity.

Our motivation is to determine vestiges, or after effects, of subconscious processes. Examples of such processes are emotion, trauma, dream, infantile development and growth, and so on. We will note how there is integral linkage with cognitive, behavioural, activity-related and conscious reasoning processes. In Murtagh (2014a) we began this work. The computational implications are profound: subconscious and unconscious thought processes are vastly more efficient that conscious thought processes (Murtagh, 2014b). Clearly, conscious and unconscious thought processes are very different, and they are complementary and integrated.

Another different view of our work is that of pattern recognition involving motifs in the form of relationship triangles, as described in chapter 9 of Neuman (2014).

1.1. Metric and Ultrametric

A metric space ijcini.2014100101.m01 consists of a set ijcini.2014100101.m02 on which is defined a distance function d which assigns to each pair of points of ijcini.2014100101.m03 a distance between them, and satisfies the following four axioms, first for any pair of points, referred to as positiveness, reflexivity and symmetry:

ijcini.2014100101.m04 if: ijcini.2014100101.m05

For any triplet of points we have the triangular inequality:


If these properties with the exception of the triangular inequality are respected, we speak of dissimilarities. Through subtraction from the maximum value, similarities are transformed into dissimilarities.

When considering an ultrametric space we need to consider the strong triangular inequality or ultrametric inequality defined as:

and this in addition to the positivity, reflexivity and symmetry properties for any triplet of point ijcini.2014100101.m08.

Measurements of a set of observations, related to a set of attributes, can be converted to a metric principal component, or principal axis, space using Principal Components Analysis. For contingency table data, i.e. frequency of occurrence data, Correspondence Analysis is typically used, since such data is categorical or qualitative rather than quantitative. Depending on input data preprocessing, Principal Components Analysis may be on (i) the sums of squares and cross-products matrix, (ii) variances-covariances, and (iii) correlations.

Principal Coordinates Analysis, also known as Classical Multidimensional Scaling, takes dissimilarities as input and reconstructs a coordinate space (Torgerson, 1958). The principal component, or principal coordinate, space has orthonormal axes. The mapping from the set of dissimilarities to the orthonormal axis space is carried out by singular value decomposition, i.e. eigenvalue, eigenvector decomposition. For an orthonormal decomposition with non-negative eigenvalues, the input data must comprise a positive, semi-definite matrix. With dissimilarity, as opposed to distance, input, we are not guaranteed to have a metric-embeddable output, nor to have all non-negative eigenvalues. From this a measure of how metric a given set of data is, that is endowed with a dissimilarity: we retain the metric embedding associated with the non-negative eigenvalues. Negative eigenvalues are associated with that part of the data that is not metric-embeddable.

Complete Article List

Search this Journal:
Volume 16: 1 Issue (2022)
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing