DETECT: A Hierarchical Clustering Algorithm for Behavioural Trends in Temporal Educational Data

• URL: http://arxiv.org/abs/2005.10640v1
• Date: Mon, 4 May 2020 01:34:47 GMT
• Title: DETECT: A Hierarchical Clustering Algorithm for Behavioural Trends in Temporal Educational Data
• Authors: Jessica McBroom, Kalina Yacef and Irena Koprinska
• Abstract summary: DETECT (Detection of Educational Trends Elicited by Clustering Time-series data) is a novel divisive hierarchical clustering algorithm. It incorporates temporal information into its objective function to prioritise the detection of behavioural trends. It is easy to apply, highly customisable, applicable to a wide range of educational datasets and yields easily interpretable results.
• Score: 2.438894206045968
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Techniques for clustering student behaviour offer many opportunities to improve educational outcomes by providing insight into student learning. However, one important aspect of student behaviour, namely its evolution over time, can often be challenging to identify using existing methods. This is because the objective functions used by these methods do not explicitly aim to find cluster trends in time, so these trends may not be clearly represented in the results. This paper presents `DETECT' (Detection of Educational Trends Elicited by Clustering Time-series data), a novel divisive hierarchical clustering algorithm that incorporates temporal information into its objective function to prioritise the detection of behavioural trends. The resulting clusters are similar in structure to a decision tree, with a hierarchy of clusters defined by decision rules on features. DETECT is easy to apply, highly customisable, applicable to a wide range of educational datasets and yields easily interpretable results. Through a case study of two online programming courses (N>600), this paper demonstrates two example applications of DETECT: 1) to identify how cohort behaviour develops over time and 2) to identify student behaviours that characterise exercises where many students give up.

Related papers

• Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection [2.428031280449541]
  Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. Existing clustering approaches often neglect individual differences in feature importance and rely on a homogenized feature set. We introduce Interpret3C, a novel clustering pipeline that incorporates interpretable neural networks (NNs) in an unsupervised learning context.
  arXiv  Detail & Related papers  (2024-05-28T15:32:05Z)
• Deep Contrastive Graph Learning with Clustering-Oriented Guidance [61.103996105756394]
  Graph Convolutional Network (GCN) has exhibited remarkable potential in improving graph-based clustering. Models estimate an initial graph beforehand to apply GCN. Deep Contrastive Graph Learning (DCGL) model is proposed for general data clustering.
  arXiv  Detail & Related papers  (2024-02-25T07:03:37Z)
• Spatiotemporal Self-supervised Learning for Point Clouds in the Wild [65.56679416475943]
  We introduce an SSL strategy that leverages positive pairs in both the spatial and temporal domain. We demonstrate the benefits of our approach via extensive experiments performed by self-supervised training on two large-scale LiDAR datasets.
  arXiv  Detail & Related papers  (2023-03-28T18:06:22Z)
• DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph [59.583555454424]
  We propose a novel disenTangled representation learning framework for discrete-time Dynamic graphs, namely DyTed. We specially design a temporal-clips contrastive learning task together with a structure contrastive learning to effectively identify the time-invariant and time-varying representations respectively.
  arXiv  Detail & Related papers  (2022-10-19T14:34:12Z)
• Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation [102.24108167002252]
  We propose a novel attention network, named self-modulating attention, that models the complex and non-linearly evolving dynamic user preferences. We empirically demonstrate the effectiveness of our method on top-N sequential recommendation tasks, and the results on three large-scale real-world datasets show that our model can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-03-30T03:54:11Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Temporal graph-based approach for behavioural entity classification [0.0]
  In this study, a two phased approach for exploiting the potential of graph structures in the cybersecurity domain is presented. The main idea is to convert a network classification problem into a graph-based behavioural one. We extract these graph structures that can represent the evolution of both normal and attack entities. Three clustering techniques are applied to the normal entities in order to aggregate similar behaviours, mitigate the imbalance problem and reduce noisy data.
  arXiv  Detail & Related papers  (2021-05-11T06:13:58Z)
• Clustering Analysis of Interactive Learning Activities Based on Improved BIRCH Algorithm [0.0]
  The construction of good learning behavior is of great significance to learners' learning process and learning effect, and is the key basis of data-driven education decision-making. It is necessary to obtain the online learning behavior big data set of multi period and multi course, and describe the learning behavior as multi-dimensional learning interaction activities. We design an improved algorithm of BIRCH clustering based on random walking strategy, which realizes the retrieval evaluation and data of key learning interaction activities.
  arXiv  Detail & Related papers  (2020-10-08T07:46:46Z)
• Few-Shot Unsupervised Continual Learning through Meta-Examples [21.954394608030388]
  We introduce a novel and complex setting involving unsupervised meta-continual learning with unbalanced tasks. We exploit a meta-learning scheme that simultaneously alleviates catastrophic forgetting and favors the generalization to new tasks. Experimental results on few-shot learning benchmarks show competitive performance even compared to the supervised case.
  arXiv  Detail & Related papers  (2020-09-17T07:02:07Z)
• Data-driven modelling and characterisation of task completion sequences in online courses [0.0]
  We show how data-driven analysis of temporal sequences of task completion in online courses can be used. We identify critical junctures and differences among types of tasks within the course design. We find that non-rote learning tasks, such as interactive tasks or discussion posts, are correlated with higher performance.
  arXiv  Detail & Related papers  (2020-07-14T12:39:03Z)
• Learning What Makes a Difference from Counterfactual Examples and Gradient Supervision [57.14468881854616]
  We propose an auxiliary training objective that improves the generalization capabilities of neural networks. We use pairs of minimally-different examples with different labels, a.k.a counterfactual or contrasting examples, which provide a signal indicative of the underlying causal structure of the task. Models trained with this technique demonstrate improved performance on out-of-distribution test sets.
  arXiv  Detail & Related papers  (2020-04-20T02:47:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.