SearcharxivSearch

arXiv subjects

Dan Hudson

Publications and source records attributed to Dan Hudson.

4 recordsLinked to original sources

Finding One's Bearings in the Hyperparameter Landscape of a Wide-Kernel Convolutional Fault Detector

State-of-the-art algorithms are reported to be almost perfect at distinguishing the vibrations arising from healthy and damaged machine bearings, according to benchmark datasets at least. However, what about their application to new data? In this paper, we confirm that neural networks for bearing fault detection can be crippled by incorrect hyperparameterisation, and also that the correct hyperparameter settings can change when transitioning to new data. The paper combines multiple methods to explain the behaviour of the hyperparameters of a wide-kernel convolutional neural network and how to set them. Since guidance already exists for generic hyperparameters like minibatch size, we focus on how to set architecture-specific hyperparameters such as the width of the convolutional kernels, a topic which might otherwise be obscure. We reflect different data properties by fusing information from seven different benchmark datasets, and our results show that the kernel size in the first layer in particular is sensitive to changes in the data. Looking deeper, we use manipulated copies of one dataset in an attempt to spot why the kernel size sometimes needs to change. The relevance of sampling rate is studied by using different levels of resampling, and spectral content is studied by increasingly filtering out high frequencies. We find that, contrary to speculation in earlier work, high-frequency noise is not the main reason why a wide kernel is preferable to a narrow kernel. Finally, we conclude by stating clear guidance on how to set the hyperparameters of our neural network architecture to work effectively on new data.

cs.LG

Social Analytics of Team Interaction using Dynamic Complexity Heat Maps and Network Visualizations

Given the increasing complexity of many sociotechnical work domains, effective teamwork has become increasingly crucial. While there is evidence that face-to-face communication contributes to effective teamwork, methods for understanding the time-varying nature and structure of team communication are limited. In this work, we combine sensor-based social analytics of Sociometric badges (Rhythm Badge) with two visualization techniques (Dynamic Complexity Heat Maps and Network Visualizations) to advance an intuitive way of understanding the dynamics of team interaction. To demonstrate the utility of our approach, we provide a case study that examines one team's interaction for a Lost at Sea simulation. We were able to recover transitions in the task and team interaction as well as uncover structural changes in team member energy and engagement, which we visualize using networks. Taken together, this work represents an important first step at optimizing team effectiveness by identifying critical transitions/events in team communication and interaction patterns.

cs.SI

Local Exceptionality Detection in Time Series Using Subgroup Discovery

In this paper, we present a novel approach for local exceptionality detection on time series data. This method provides the ability to discover interpretable patterns in the data, which can be used to understand and predict the progression of a time series. This being an exploratory approach, the results can be used to generate hypotheses about the relationships between the variables describing a specific process and its dynamics. We detail our approach in a concrete instantiation and exemplary implementation, specifically in the field of teamwork research. Using a real-world dataset of team interactions we include results from an example data analytics application of our proposed approach, showcase novel analysis options, and discuss possible implications of the results from the perspective of teamwork research.

cs.LG

Baum-Connes and the Fourier-Mukai transform

The Baum-Connes map for finitely generated free abelian groups is a K-theoretic analogue of the Fourier-Mukai transform from algebraic geometry. We describe this K-theoretic transform in the language of topological correspondences, and compute its action on K-theory (of tori) described geometrically in terms of Baum-Douglas cocycles, showing that the Fourier-Mukai transform maps the class of a subtorus to the class of a suitably defined dual torus. We deduce the Fourier-Mukai inversion formula. We use these results to give a purely geometric description of the Baum-Connes assembly map for free abelian groups.

math.KT