Computational Engineering Commons^™

Apache Hadoop Installation And Configuration Steps, Safet Jahaj

Open Educational Resources

This tutorial covers the installation and configuration steps of Apache Hadoop on a Windows operating system.

Unveiling The Transformative Power Of Unsupervised Machine Learning Through Clustering, Vishnu S. Pendyala

Open Educational Resources

Clustering methods demonstrated their transformative potential across various industries through image segmentation, anomaly detection, bioinformatics, and customer segmentation. The presentation explores these techniques in unsupervised machine learning, focusing on foundational clustering algorithms such as K-means, Hierarchical Clustering, and DBSCAN. Through an in-depth analysis of their underlying principles and computational intricacies, the presentation highlights how these methods have evolved to address complex, high-dimensional data problems. The presentation provides insights into how K-means remains a versatile tool for partitioning data in linear spaces. It delves into Hierarchical Clustering's unique approach to building dendrograms and capturing multi-scale data relationships, and how DBSCAN's density-based …

Collaborative Ai: Oer Materials For Exploring Ai As A Partner Rather Than A Tool, David Smith

Open Educational Resources

The Collaborative AI Open Educational Resource (OER) explores how artificial intelligence can act as a creative and analytical collaborator rather than a tool. Centered on the Balanced Blended Space (BBS) framework and the philosophy of the Center for Holistic Integration (CHI), the OER includes curriculum materials, theoretical models, and live research environments. It offers an interesting approach to blending physical, virtual, and conceptual spaces through shared human–AI agency and invites ongoing participation in interdisciplinary meta-projects.

Csc 22100 Software Development Laboratory Homework Assignment #1, Mitch Gershonowitz

Open Educational Resources

This is the first homework assignment for an Introduction to Java Programming course, which requires the students to write Java code using industry-accepted conventions. The assignment requires the student to write a Java method that accepts a date in an internationally-recognized format and returns a String object in Julian Date Format (JDF) with format YYDDD.

Csc 22100 Software Development Laboratory Homework Assignment #3, Mitch Gershonowitz

Open Educational Resources

This is the third homework assignment for an Introduction to Java Programming course, which requires the students to write Java code using industry-accepted conventions. The assignment requires the student to write a Java classes and interfaces that demonstrate usage of passing lambda expressions to methods, as well as demonstrating polymorphism and inheritance.

Quantitative Analysis Of Machine Learning Model Performance And The Need To Consider Explainability, Vishnu S. Pendyala

Open Educational Resources

This presentation, titled "Quantitative analysis of Machine Learning model performance and the need to consider explainability," delves into various metrics used for evaluating machine learning models. It thoroughly examines fundamental classification metrics like accuracy, precision, recall, and F-score, while also discussing more advanced measures such as the Kappa Statistic and Matthews Correlation Coefficient (MCC), particularly highlighting their relevance in scenarios with imbalanced datasets. The presentation underscores the importance of model accuracy in real-world applications and briefly introduces regression metrics like R-squared and F-statistic. Additionally, it addresses challenges related to data imbalance and fairness in ML models, stressing the critical need …

Problem Solving / Javascript Programming, Sarah Zelikovitz, Orit D. Gruber

Open Educational Resources

This Lab Experiment focuses on JavaScript Programming. Upon completing the lab, you will be able to understand the following:

· The definition of Algorithmic Problem Solving.

· The role of JavaScript in web pages.

· The concept of Iteration in computer programming.

Finding The Shortest Path Using Dijkstra’S Algorithm, Orit D. Gruber, Deborah Sturm

Open Educational Resources

This lab experiment explores an algorithm which is used to find the shortest path between two or more locations. After completing the lab, you will be able to answer the following questions in the final lab report:

1. What is an Algorithm?
2. What is a Graph ?
3. What is the purpose and operation of Dijkstra’s Algorithm ?

Machine Learning Applications And Sustainable Development, Vishnu Pendyala

Open Educational Resources

This presentation, "Machine Learning Applications and Sustainable Development," explores the intersection of machine learning and its impact on privacy, equity, and societal well-being. It delves into the potential for re-identification of "anonymized" data through various techniques like k-anonymity, L-diversity, and the vulnerabilities of large language models, illustrating these concepts with real-world examples such as the AOL search data, Netflix Prize dataset, and Strava's fitness tracking. The presentation also discusses solutions to enhance data privacy, including differential privacy and the emerging field of machine unlearning, highlighting their applications and limitations. Finally, it addresses the broader implications for civil rights and ethical …

Slowly Changing Dimensions And Fast Changing Facts - The Story Of The Traditional Data Warehouse, Vishnu Pendyala

Open Educational Resources

This presentation, "Slowly Changing Dimensions and Fast Changing Facts - The Story of the Traditional Data Warehouse," explores how to generate actionable insights from organizational performance data. It begins by discussing the challenges of generating insights directly from existing databases and introduces the concept of data cubes for efficient aggregate storage. The core of the presentation focuses on dimensional modeling, particularly the Star Schema, as a solution for analytical processing needs that cannot be met by transactional systems. It details the characteristics of fast-changing fact tables (long, lean, numeric) and slowly changing dimension tables (descriptive, wide, containing strings and numbers). …

Exploring The Math In Support Vector Machines, Vishnu Pendyala

Open Educational Resources

“SVMs are a rare example of a methodology where geometric intuition, elegant mathematics, theoretical guarantees, and practical algorithms meet” – Bennet and Campbell

Support Vector Machines (SVMs) are used for supervised machine learning and have been successful in many applications, including those like image classification that favor deep learning. SVM owes its power to the intriguing math involved in its fabrication. This talk will introduce SVM and cover some of that math. Topics covered will include constrained and unconstrained optimization, convexity, the general notion of a function space, minmax equilibrium, duality, the Cover theorem, Kernels, and the Mercer theorem.

More …

Machine Learning, The Mortar Of Modernization, Vishnu Pendyala

Open Educational Resources

Machine Learning is advancing civilization and is one of the key drivers of the economy today. Machine Learning literacy may one day become essential, the way computer literacy is today. This talk intends to explain Machine Learning concepts to wider audiences by using easy-to-relate real-world analogies and serves as a refresher to those already initiated. A fundamental concept in machine learning is similarity. The dot product that is ubiquitously present in machine learning is a measure of similarity. Similarity is key to human learning as well. We learn in delta increments by comparing and contrasting with what we already know. …

Meta-Algorithms In Machine Learning, Vishnu Pendyala

Open Educational Resources

This presentation explores how to make the best of models impacted by bias and variance. Meta-learning minimizes loss. Ensemble methods, including Bagging, Adaboost, Random Forest, Gradient Boosting, and Stacking, are discussed. These methods perturb data (X or Y) using techniques like bootstrap sampling, k-fold sampling, weighted sampling, and random subspaces. Models are generated in parallel or sequentially, with aggregation strategies such as mean, mode, weighted response, and metamodel. The presentation also touches upon deep learning and one-shot learning, and explains how distances become less meaningful in high dimensions.

More details: https://events.vtools.ieee.org/m/315184

Video Recording: https://ieeetv.ieee.org/video/meta-algorithms-in-machine-learning