Filter by keyword, subject, or both. Updates live as new model answers are added to our portal.
Computer Science / Algorithms / Parallel Computing / Clustering
Parallel Algorithms for Hierarchical Clustering: Single-Link, Minimum Spanning Trees and Parallel Architectures
This research paper investigates parallel algorithms for hierarchical clustering, a clustering technique in which individual data points initially form separate clusters and the closest clusters are repeatedly merged until a hierarchical tree structure, or dendrogram, is formed. The paper reviews important sequential clustering algorithms, surveys previous parallel approaches and proposes parallel methods for several commonly used inter-cluster distance metrics. Prims_algorithm_for_hierarchica… The paper distinguishes between graph-based metrics and geometric metrics. Graph metrics include single-link, average-link and complete-link clustering, while geometric metrics include centroid, median and minimum-variance methods. It also discusses the Lance–Williams updating formula, which provides a general framework for updating inter-cluster distances after agglomeration. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… A major focus is the relationship between single-link hierarchical clustering and the Euclidean minimum spanning tree. The paper explains that the cluster hierarchy for single-link clustering can be obtained from a minimum spanning tree, making minimum-spanning-tree algorithms highly relevant to efficient hierarchical clustering. It presents practical single-link algorithms with O(n²) time complexity and discusses space requirements and nearest-neighbour update properties. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… The paper also examines algorithms for metrics satisfying the reducibility property, where nearest-neighbour chains can be used to efficiently determine which clusters to merge. Minimum-variance and graph-based metrics satisfy this property, while centroid and median metrics do not necessarily do so. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… For more general clustering metrics, the paper describes priority-queue-based algorithms with O(n² log n) sequential time complexity. It then reviews previous parallel work, including parallel implementations of SLINK, Ward’s method and Prim’s minimum spanning tree algorithm. The cited parallel Prim implementation achieves O(n log n) time when sufficient processors are available. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… The core contribution is a set of parallel algorithms for hierarchical clustering on PRAM, butterfly and tree architectures. For single-link clustering, the paper shows how a parallel minimum-spanning-tree approach can be used and reports an O(n log n) running time using n/log n processors. Similar optimal results are described for centroid, median and minimum-variance clustering, while average-link and complete-link methods are more difficult to optimise on local-memory architectures. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… Overall, the paper demonstrates how hierarchical clustering can be accelerated through parallel computation while preserving the computational structure of different clustering metrics. Its main themes include minimum spanning trees, Prim’s algorithm, single-link clustering, nearest-neighbour methods, PRAM computation, parallel data structures and asymptotic complexity analysis. Prims_algorithm_for_hierarchica… Important: because this file is a journal research paper rather than a university assessment brief, fields such as module name, academic level, assignment type and formal word count do not genuinely apply.
Read Model Answer →
Critical Analysis of Computational Algorithms: Research Paper Evaluation and Complexity Analysis
This postgraduate Computer Science coursework requires students to undertake a critical technical analysis of a computational algorithm presented in a prescribed academic research paper. Students select one paper from the available options and demonstrate that they understand both the research problem addressed by the authors and the algorithmic solution proposed. The assessment contributes 30% of the overall module grade and is completed individually. assignment The available research papers cover several algorithmic topics, including an improved Dijkstra shortest-path algorithm for sparse networks, a modified merge-sort approach for large-scale datasets, parallel merge sort with load balancing, and a Prim-based algorithm for hierarchical clustering. Students must extract the principal algorithm from their selected paper and explain its purpose, inputs, outputs and operating procedure. A major component involves identifying the research question and computational problem addressed by the selected study. Students then reproduce or extract the proposed algorithm in pseudocode form and clearly identify the information supplied to the algorithm and the outputs it generates. The algorithm must also be explained step by step using straightforward language so that its operation can be understood without relying exclusively on formal notation. The coursework further requires a detailed time-complexity analysis, demonstrating understanding of how computational requirements grow with input size and how the proposed technique compares with alternative or conventional approaches. Students must critically evaluate the algorithm’s strengths, weaknesses, performance characteristics and limitations, and suggest potential improvements where appropriate. The marking rubric gives substantial emphasis to five areas: identifying the computational problem and research questions, extracting the proposed algorithm, identifying inputs and outputs, explaining the algorithm clearly, analysing its time complexity, and critically evaluating its strengths and weaknesses. assignment The written submission must be 800–1,000 words, although the inputs/outputs, pseudocode and time-complexity sections are excluded from that limit. Figures and images are not permitted, and the work must be submitted using the prescribed coursework template in DOC/DOCX format. Overview word count: approximately 340 words. AI-use note: the guideline permits generative AI only for proofreading. AI tools are explicitly not permitted to create the assessed work itself. assignment
Read Model Answer →
Big Data Analytics / Machine Learning
3,000 words
Machine Learning on Big Data Using PySpark: Large-Scale Data Analysis and Predictive Modelling
This group-based Machine Learning on Big Data project requires students to apply machine learning techniques to a large real-world dataset using PySpark DataFrames and Spark machine-learning libraries. Students select a substantial dataset, ideally between approximately 300 MB and 1 GB, from sources such as Kaggle, workplace data or other valid repositories, and develop an end-to-end big-data analytics workflow. CN7030 CRWK 26T1 The project begins with data loading and preprocessing using PySpark. Students are expected to handle missing values, perform data normalisation and feature engineering, identify class imbalance and propose appropriate mitigation strategies. Where text datasets are selected, additional preprocessing may include stemming, lemmatization and TF-IDF representation. CN7030 CRWK 26T1 The modelling stage requires implementation of an appropriate machine-learning approach using PySpark MLlib or Spark ML. The brief expects a multiclass rather than binary classification problem and allows techniques including multiclass classification, ensemble learning, clustering and text mining. Students must justify their model choice and consider model robustness, bias and variance when attempting to improve predictive performance. CN7030 CRWK 26T1 Students then perform hyperparameter tuning using techniques such as grid search or random search and evaluate the resulting model with appropriate measures. Relevant evaluation outputs may include accuracy, F1-score, precision, recall and a confusion matrix. Results should also be visualised or clearly presented and interpreted to identify meaningful patterns and performance characteristics. CN7030 CRWK 26T1 The project additionally requires consideration of Legal, Social, Ethical and Professional (LSEP) issues. Students discuss potential ethical concerns associated with their dataset, including bias and privacy risks, and propose suitable mitigation strategies. The final work is consolidated into a single user-friendly HTML analytics report that clearly presents the group's preprocessing, modelling, optimisation, evaluation and interpretation. CN7030 CRWK 26T1 CN7030 CRWK 26T1 Overview word count: approximately 335 words. If you are also uploading the presentation separately to the Reference Library, that should be a second entry under “Presentations and Academic Posters”, because the presentation forms a distinct 40% component and assesses understanding of Spark, preprocessing, modelling, optimisation, evaluation and responses to examiner questions. CN7030 CRWK 26T1
Read Model Answer →
Data Mining / Data Science
Customer Service Escalation Risk Analytics Using Data Mining and Machine Learning
This advanced Data Mining assessment applies the Knowledge Discovery in Databases (KDD) process to a realistic customer-service risk scenario. Acting as a Data Scientist, students analyse a historical Customer Service Escalation Risk dataset to help an organisation identify early indicators of dissatisfaction and operational bottlenecks that may lead to serious or legal customer escalations. The resulting analysis is intended to support strategic decisions relating to staffing, employee training, customer-journey improvement and escalation prevention. CMP-7023B_Assessement_2 (2) The dataset incorporates customer demographics, account characteristics, communication channels, issue categories, operational measures such as waiting times, transfers and SLA breaches, behavioural indicators including sentiment and response delays, and commercial variables such as monthly fees and contract value. The target variable, escalation_level, contains four categories: No escalation, Minor escalation, Serious escalation and Legal escalation. CMP-7023B_Assessement_2 (2) Students begin with data exploration and visualisation, producing appropriate descriptive statistics and identifying patterns, distributions and potential data-quality concerns. They then perform data cleansing, transformation, feature engineering and preprocessing. Variables that may introduce leakage or unreliable predictions because of their meaning, timing or quality must be critically assessed and justified. CMP-7023B_Assessement_2 (2) The supervised-learning stage requires students to develop, tune and compare predictive models using techniques such as k-nearest neighbours, Decision Trees, Support Vector Machines, ensemble methods or neural networks. Appropriate multiclass evaluation metrics must be used, alongside interpretation of influential variables and model behaviour. CMP-7023B_Assessement_2 (2) The assessment also includes unsupervised learning, requiring comparison of clustering methods such as K-Means and hierarchical clustering after removal of the target variable. Students may apply encoding, normalisation and dimensionality-reduction methods such as PCA or t-SNE and must interpret how the resulting clusters relate to escalation behaviour. CMP-7023B_Assessement_2 (2) Overall, the project assesses independent analytical judgement, modelling justification, comparative evaluation and clear communication of actionable findings for both technical and executive audiences. CMP-7023B_Assessement_2 (2) Overview word count: approximately 340 words. AI-use note: AI tools may only assist with small, specific code snippets. Any AI-generated code must be clearly acknowledged and cited, while the analysis, coding decisions, interpretation and final evaluation must remain the student's own work. CMP-7023B_Assessement_2 (2)
Read Model Answer →
Principles of Data Science
2,000 words
Principles of Data Science – Data Analysis Portfolio
This portfolio assignment for the Principles of Data Science module at Coventry University requires students to analyse the Global Life-Work Balance Index 2025 dataset using statistical and data science techniques in R. The dataset ranks 60 countries according to life-work balance using factors including statutory annual leave, paid maternity leave, sick leave, healthcare, public safety, public happiness, LGBTQ inclusivity and average working hours per employee. The assignment has a 2,000-word equivalent limit, excluding the reference list and output. The portfolio consists of two main tasks. Task 1 is a group task involving multivariate data analysis. Students must use R to perform Principal Component Analysis (PCA) and Cluster Analysis on the dataset. For PCA, students analyse quantitative variables, produce and interpret relevant visualisations such as screeplots, biplots and loadings plots, and investigate the effects of Region and Healthcare System. The PCA analysis also requires comparison of the overall dataset with countries from Europe. The cluster analysis component requires students to cluster both countries and variables using different distance metrics and hierarchical clustering methods. Students compare methods such as Manhattan and Euclidean distances and single linkage and Ward’s method, present comparisons in compact tables, and interpret relevant dendrograms. They must then compare the conclusions obtained from PCA and Cluster Analysis, identifying common insights and apparent conflicts and discussing the extent to which the results are explainable rather than simply interpretable. Task 2 is an individual task focusing on Exploratory Data Analysis and Linear Models. Students create a scatter matrix using ggpairs(), investigate strongly correlated variables, and identify quantitative variables that may help predict Region for European and Asian countries. They then develop and critically assess linear regression models for predicting Score, including models based on employment variables and broader quantitative predictors. Model comparison and selection use concepts including AIC, while diagnostic plots are used to identify countries requiring further investigation. The individual task also requires students to use European Life-Work Balance Index 2023 data to make predictions for European countries not included in the 2025 dataset and to construct a Residuals versus Fitted Values plot. Finally, students must combine the conclusions from their individual linear modelling work with the PCA and Cluster Analysis findings to identify specific discoveries about the variables and countries in the dataset. R code, output and relevant plots must be included directly within the reports. The assignment encourages use of the R tidyverse and requires appropriate referencing of sources. The brief specifies APA-style referencing for the individual and group work. It also states that generative AI may be used for inspiration but not for generating answers or analysing the datasets, and any permitted AI use must be acknowledged and documented.
Read Model Answer →
Data Mining / Data Science
Customer Service Escalation Risk Analytics Using Data Mining and Machine Learning
This advanced Data Mining assessment applies the Knowledge Discovery in Databases (KDD) process to a real-world customer-service analytics scenario. Acting as a Data Scientist, students analyse a historical Customer Service Escalation Risk dataset to help an organisation reduce serious and legal customer escalations by identifying early signs of dissatisfaction, service bottlenecks and operational risk. The findings are intended to support business decisions relating to staffing, employee training, customer-journey improvement and escalation prevention. The dataset contains information covering customer demographics, account characteristics, communication channels, issue categories, operational measures such as wait times, transfers and SLA breaches, behavioural indicators including sentiment and response delays, and commercial variables such as monthly fees and contract value. The target variable contains four escalation outcomes: No escalation, Minor escalation, Serious escalation and Legal escalation. The first stage requires data exploration, visualisation and summary, including examination of variable distributions, dataset structure, descriptive characteristics and potential data-quality issues. Students then perform appropriate data cleaning, transformation, feature engineering and preprocessing. Particular attention must be given to variables that could introduce prediction leakage because of their meaning, timing or reliability. The supervised-learning component requires development and tuning of predictive models using suitable techniques such as k-nearest neighbours, Decision Trees, Support Vector Machines, ensembles or neural networks. Models must be evaluated using appropriate multiclass metrics and compared systematically, with interpretation of influential features and model behaviour. The assessment also requires unsupervised learning. After removing the escalation target, students apply and compare clustering approaches such as K-Means and hierarchical clustering. Appropriate preprocessing, encoding, normalisation or dimensionality reduction may be used, with visualisations such as PCA, t-SNE or scatterplots used to explore cluster structure and its relationship with escalation behaviour. Overall, the project assesses the student's ability to independently design a coherent KDD workflow, justify analytical decisions, compare alternative modelling approaches and communicate actionable findings to both technical and executive audiences. Overview word count: approximately 350 words. AI-use note: the brief permits AI tools only to assist with small, specific code snippets. Any AI-generated code must be clearly acknowledged and cited, while the submitted coding, analysis, interpretation and decision-making must remain the student's own work.
Read Model Answer →