| Literature DB >> 34755285 |
Alexander Mielke1,2, Bridget M Waller3, Claire Pérez1, Alan V Rincon1, Julie Duboscq4, Jérôme Micheletta1.
Abstract
Understanding facial signals in humans and other species is crucial for understanding the evolution, complexity, and function of the face as a communication tool. The Facial Action Coding System (FACS) enables researchers to measure facial movements accurately, but we currently lack tools to reliably analyse data and efficiently communicate results. Network analysis can provide a way to use the information encoded in FACS datasets: by treating individual AUs (the smallest units of facial movements) as nodes in a network and their co-occurrence as connections, we can analyse and visualise differences in the use of combinations of AUs in different conditions. Here, we present 'NetFACS', a statistical package that uses occurrence probabilities and resampling methods to answer questions about the use of AUs, AU combinations, and the facial communication system as a whole in humans and non-human animals. Using highly stereotyped facial signals as an example, we illustrate some of the current functionalities of NetFACS. We show that very few AUs are specific to certain stereotypical contexts; that AUs are not used independently from each other; that graph-level properties of stereotypical signals differ; and that clusters of AUs allow us to reconstruct facial signals, even when blind to the underlying conditions. The flexibility and widespread use of network analysis allows us to move away from studying facial signals as stereotyped expressions, and towards a dynamic and differentiated approach to facial communication.Entities:
Keywords: Communication; Facial action coding system; Facial signals; Network analysis
Mesh:
Year: 2021 PMID: 34755285 PMCID: PMC9374617 DOI: 10.3758/s13428-021-01692-5
Source DB: PubMed Journal: Behav Res Methods ISSN: 1554-351X
Fig. 1a Network representing the probability for any AU to be present in each condition. Only edges that were significantly more likely than expected are displayed (in dark with associated probabilities aside). Squared red numbers are the AUs and conditions are labelled in blue. b Network representing the probability for any condition to be shown when an AU was active. Only edges that were significantly more likely than expected are displayed (in dark with associated probabilities aside). Squared red numbers are the AUs and conditions are labelled in blue
Fig. 2Network representing the probability for any condition to be present when an AU was active. Only edges that were significantly more likely than expected are displayed. Colours represent the different clusters (modularity = 0.50)
Fig. 3a Network representing conditional probabilities of co-occurrence in ‘surprise’. Only connections with probabilities above 0.3 and at least three instances are represented to facilitate comprehension. If conditional probabilities going both ways surpass this threshold, they are represented with two values: above and below the arrow. More common AUs appear larger in the graph. b Network representing conditional probabilities of co-occurrence in ‘sadness’. Only connections with probabilities above 0.3 and at least three instances are represented to facilitate comprehension. If conditional probabilities going both ways surpass this threshold, they are represented with two values, above and below the arrow. More common AUs appear larger in the graph
Fig. 4Network graphs for all seven conditions. Only significant connections are portrayed; thicker edges indicate higher probability of co-occurrence. Large points indicate AUs that are significantly more common than expected in this condition, small points indicate AUs that were observed but not significant, no point indicates that the AU was not observed in this condition
Network summary statistics for the seven conditions
| Number of nodes | Number of edges | Density | Transitivity | |
|---|---|---|---|---|
| Anger | 18 | 23 | 0.15 | 0.78 |
| Contempt | 18 | 4 | 0.03 | 0.60 |
| Disgust | 18 | 14 | 0.09 | 0.78 |
| Fear | 18 | 35 | 0.23 | 0.56 |
| Happy | 18 | 6 | 0.04 | 0.55 |
| Sadness | 18 | 10 | 0.07 | 0.78 |
| Surprise | 18 | 17 | 0.11 | 0.81 |
Fig. 5Graph representing data combining all conditions, with colours representing the different clusters identified by the algorithm. Clusters have higher connections within than without. Modularity was 0.49, indicating clear clusters
| Action unit | Smallest unit of visible facial movement, based on underlying muscle distribution |
| Unconditional probability | Proportion of events in which a unit or combination of units occurs in a condition or dataset: |
| Conditional probability | Proportion of events in which a unit occurs, given that another unit is already present: |
| Specificity | Proportion of events in which a condition is observed if an element is present; strength of evidence that AU is connected to a condition rather than another: |
| Bootstrap | A resampling method in which cases of a condition are repeatedly randomly selected with replacement and the statistic of interest is calculated for each iteration, to provide estimates of the distribution of the statistic in the sample |
| Permutation | A resampling method in which the null distribution of a statistic of interest is created by randomly shuffling some aspect of the original distribution repeatedly |
| Node | Element of the network, in this case the AUs |
| Edge | Connection between elements/nodes in a network; e.g., based on the co-occurrence of AUs or on their conditional probability |
| Weighted network | Network in which the edges between nodes can take different values depending on how weakly or strongly the nodes are connected |
| Unweighted network | Network in which the edges between nodes are either 1 (present) or 0 (absent) |
| Directed network | Network in which the connections between two nodes can be asymmetrical, i.e., |
| Undirected network | Network in which the connections between two nodes is symmetrical, i.e., |
| Bipartite graph | Network in which nodes from two different categories (e.g., condition and AU) can be connected between categories ( |
| Node cluster | Structural element of a network, group of nodes that have strong connection with each other, but weak connections with other nodes outside the cluster |
| Transitivity | Triads of nodes are considered transitive if all three nodes are connected with each other; a network has high transitivity if a large number of triads are closed ( |
| Density | Proportion of the potential connections between nodes that are actual existing connections. In a dense network, all or most connections are present; in a sparse network, only few connections are present |
| Degree | Number of actual connections a node has with other nodes in a network. Nodes with high degree co-occur frequently with other nodes |
| Strength | Mean weight of connections of a node with all other nodes in a weighted network |