Pattern recognition as a learning strategy in the study of engineering dynamics
Bibliographic record
Abstract
As engineering dynamics remains a difficult subject to teach and learn, this study was initiated by an observation from the authors’ experience of how students pass dynamics without necessarily understanding all the fundamental concepts. This observation motivates the research on ‘pattern recognition’ as a learning strategy that emphasizes practising sample problems and solving similar problems in assessments. This research consisted of two parts. First, we analysed the notion of pattern recognition from two angles: (a) how it is contrasted with conceptual understanding in view of mental simulation and (b) how it is defined in the fields of computer science and cognitive psychology. We found that pattern recognition could be characterized using three features: (a) use of sample cases, (b) learning through practice, and (c) emphasis on correct patterns. Subsequently, we conducted a survey to identify evidence of pattern recognition from students as their learning strategy. With Cronbach’s alpha coefficient value at 0.649, a moderate but acceptable value, we discovered that our survey instrument was able to distinguish learners who tend to use pattern recognition as a strategy to solve problems, which is considered reasonable for a pilot investigation. We also found evidence that learners using pattern recognition tend to emphasize practice problems and memorization and de-emphasize the learning of fundamental concepts. We consider that pattern recognition could provide a new aspect to understand how learners learn technical subjects in engineering education.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".