Detecting F-formations as dominant sets
Citations Over TimeTop 10% of 2011 papers
Abstract
The first step towards analysing social interactive behaviour in crowded environments is to identify who is interacting with whom. This paper presents a new method for detecting focused encounters or F-formations in a crowded, real-life social environment. An F-formation is a specific instance of a group of people who are congregated together with the intent of conversing and exchanging information with each other. We propose a new method of estimating F-formations using a graph clustering algorithm by formulating the problem in terms of identifying dominant sets. A dominant set is a form of maximal clique which occurs in edge weighted graphs. As well as using the proximity between people, body orientation information is used; we propose a socially motivated estimate of focus orientation (SMEFO), which is calculated with location information only. Our experiments show significant improvements in performance over the existing modularity cut algorithm and indicates the effectiveness of using a local social context for detecting F-formations.
Related Papers
- → An a posteriori measure of network modularity(2013)11 cited
- → An a posteriori measure of network modularity(2013)7 cited
- → Improving Effectiveness and Efficiency in Wagner’s Modularity-Evolving Artificial Gene Regulatory Networks(2020)1 cited
- Modified modularity and the corresponding community structure detecting algorithm(2010)
- → Security Through Modularity(2019)