Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (2)
- Applied Mathematics (1)
- Biological Engineering (1)
- Biomedical Engineering and Bioengineering (1)
- Computer Sciences (1)
-
- Computer and Systems Architecture (1)
- Electrical and Computer Engineering (1)
- Environmental Monitoring (1)
- Environmental Sciences (1)
- Geography (1)
- Numerical Analysis and Scientific Computing (1)
- Other Computer Sciences (1)
- Other Electrical and Computer Engineering (1)
- Remote Sensing (1)
- Social and Behavioral Sciences (1)
- Institution
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Other Computer Engineering
Toward Strategy Identification And Subtask Decomposition In Task Exploration, Tom Odem
Toward Strategy Identification And Subtask Decomposition In Task Exploration, Tom Odem
Master's Projects
This research builds on work in anticipatory human-machine interaction, a subfield of human-machine interaction where machines can facilitate advantageous interactions by anticipating a user’s future state. The aim of this research is to further a machine’s understanding of user knowledge, skill, and behavior in pursuit of implicit coordination. A task explorer pipeline was developed that uses clustering techniques, paired with factor analysis and string edit distance, to automatically identify key global and local strategies that are used to complete tasks. Global strategies identify generalized sets of actions used to complete tasks, while local strategies identify sequences that used those sets …
Comparative Analysis Of Embedding Techniques With Clustering Algorithms For Malware Opcodes, Ayush Koul
Comparative Analysis Of Embedding Techniques With Clustering Algorithms For Malware Opcodes, Ayush Koul
Master's Projects
Malware detection and classification remain critical challenges in cybersecurity, especially as malicious software becomes increasingly sophisticated and prevalent. While much of the work involving embeddings has traditionally relied on supervised learning approaches, there is significant potential in leveraging unsupervised learning techniques to discern hidden structures in malware data. By employing embedding techniques to convert malware samples into high-dimensional vector representations, we can capture the subtle and complex patterns inherent in malicious code without relying on pre-labeled data. This unsupervised approach helps categorize malware into predefined malware families, greatly aiding in developing cybersecurity solutions. In contrast to traditional supervised models that …
Multi Base Station Energy Efficient Cluster-Aware Routing For Wireless Sensor Networks With Realtime Data Backup, Martinaa M
Theses and Dissertations
Wireless Sensor Networks (WSNs) is created, stemming from their applications in distinct areas. This research focuses on implementing an efficient clustering and routing protocols to maximize the lifespan of the WSN by proposing a novel method known as the Energy Efficient Cluster-aware Routing Protocol (EECR). The proposed method comprises of three steps: cluster formation, cluster head (CH) selection, and multi-hop data transmission. The factors needed are residual energy, the minimum distance to the base station (BS), and the minimum Load Count as given in the Energy and Distance CH selection algorithm. The shortest pathway is estimated by the Energy Route …
Exploring Human Aging Proteins Based On Deep Autoencoders And K-Means Clustering, Sondos M. Hammad, Mohamed Talaat Saidahmed, Elsayed A. Sallam, Reda Elbasiony
Exploring Human Aging Proteins Based On Deep Autoencoders And K-Means Clustering, Sondos M. Hammad, Mohamed Talaat Saidahmed, Elsayed A. Sallam, Reda Elbasiony
Journal of Engineering Research
Aging significantly affects human health and the overall economy, yet understanding of the underlying molecular mechanisms remains limited. Among all human genes, almost three hundred and five have been linked to human aging. While certain subsets of these genes or specific aging-related genes have been extensively studied. There has been a lack of comprehensive examination encompassing the entire set of aging-related genes. Here, the main objective is to overcome understanding based on an innovative approach that combines the capabilities of deep learning. Particularly using One-Dimensional Deep AutoEncoder (1D-DAE). Followed by the K-means clustering technique as a means of unsupervised learning. …
Opinion Graphs Construction For Reviews Using Transfer Learning And Large Language Models, Yichen Lin
Opinion Graphs Construction For Reviews Using Transfer Learning And Large Language Models, Yichen Lin
Master's Projects
With the rapid development of the Internet, reading online reviews before making a purchase, booking a hotel, or making a restaurant reservation has become a part of daily life. Customers often consider reviews as crucial supplementary information before making decisions on how to spend their money. However, reading many reviews to gain helpful information takes time and effort. This project proposes a new method OpinionGraphGenerator that aims to create opinion graphs from hotel reviews to reduce the high volume of text in reviews while preserving essential insights. In an opinion graph, vertices are semantically similar opinions, where each opinion consists …
Cluster Analysis For Concept Drift Detection In Malware, Aniket Mishra
Cluster Analysis For Concept Drift Detection In Malware, Aniket Mishra
Master's Projects
The rapid evolution of malware presents significant challenges for detection systems. This is due to malware families adapting through feature manipulation and obfuscation, which causes concept drift. A clustering based approach is used to detect and adapt to these shifts. The KronoDroid dataset is segmented into batch sizes of 50 and analyzed with MiniBatch K-Means clustering. The silhouette coefficient is used to evaluate clustering quality, and help identify drift by detecting significant changes in cluster patterns. Concept drift will cause retraining of supervised classifiers, including Linear SVM, RF, MLP, and XGBoost. Three scenarios are used: static models, periodic retraining, and …
A Quantitative Validation Of Multi-Modal Image Fusion And Segmentation For Object Detection And Tracking, Nicholas Lahaye, Michael J. Garay, Brian D. Bue, Hesham El-Askary, Erik Linstead
A Quantitative Validation Of Multi-Modal Image Fusion And Segmentation For Object Detection And Tracking, Nicholas Lahaye, Michael J. Garay, Brian D. Bue, Hesham El-Askary, Erik Linstead
Mathematics, Physics, and Computer Science Faculty Articles and Research
In previous works, we have shown the efficacy of using Deep Belief Networks, paired with clustering, to identify distinct classes of objects within remotely sensed data via cluster analysis and qualitative analysis of the output data in comparison with reference data. In this paper, we quantitatively validate the methodology against datasets currently being generated and used within the remote sensing community, as well as show the capabilities and benefits of the data fusion methodologies used. The experiments run take the output of our unsupervised fusion and segmentation methodology and map them to various labeled datasets at different levels of global …
Performance Analysis Of Whale Optimization Based Data Clustering, Ahamed Shafeeq B M, Zahid Ahmed Ansari, Shyam Karanth
Performance Analysis Of Whale Optimization Based Data Clustering, Ahamed Shafeeq B M, Zahid Ahmed Ansari, Shyam Karanth
Future Computing and Informatics Journal
Data clustering is the method of gathering of data points so that the more similar points will be in the same group. It is a key role in exploratory data mining and a popular technique used in many fields to analyze statistical data. Quality clusters are the key requirement of the cluster analysis result. There will be tradeoffs between the speed of the clustering algorithm and the quality of clusters it produces. Both the quality and speed criteria must be considered for the state-of-the-art clustering algorithm for applications. The Bio-inspired technique has ensured that the process is not trapped in …
Building A Classification Model Using Affinity Propagation, Christopher R. Klecker
Building A Classification Model Using Affinity Propagation, Christopher R. Klecker
College of Graduate Studies: Theses & Dissertations
Regular classification of data includes a training set and test set. For example for Naïve Bayes, Artificial Neural Networks, and Support Vector Machines, each classifier employs the whole training set to train itself. This thesis will explore the possibility of using a condensed form of the training set in order to get a comparable classification accuracy. The technique explored in this thesis will use a clustering algorithm to explore with data records can be labeled as exemplar, or a quality of multiple records. For example, is it possible to compress say 50 records into one single record? Can a single …
Development Of Some Scalable Pattern Recognition Algorithms For Real Life Data Analysis, Partha Garai
Development Of Some Scalable Pattern Recognition Algorithms For Real Life Data Analysis, Partha Garai
Doctoral Theses
A huge amount of data is being generated continuously as a result of recent advancement and wide use of high-throughput technologies. With the rapid increase in size of data distributed worldwide, understanding the data has become critical. In this regard, dimensionality reduction and clustering have become the necessary preprocessing steps of multiple research areas and applications. One of the important problems of real life large data sets is uncertainty. Some of the sources of this uncertainty include imprecision in computation and vagueness in class denitions. The uncertainty may also be present in the denition of class membership function. In this …
Empirical Comparative Analysis Of 1-Of-K Coding And K-Prototypes In Categorical Clustering, Fei Wang, Hector Franco, John Pugh, Robert J. Ross
Empirical Comparative Analysis Of 1-Of-K Coding And K-Prototypes In Categorical Clustering, Fei Wang, Hector Franco, John Pugh, Robert J. Ross
Conference papers
Clustering is a fundamental machine learning application, which partitions data into homogeneous groups. K-means and its variants are the most widely used class of clustering algorithms today. However, the original k-means algorithm can only be applied to numeric data. For categorical data, the data has to be converted into numeric data through 1-of-K coding which itself causes many problems. K-prototypes, another clustering algorithm that originates from the k-means algorithm, can handle categorical data by adopting a different notion of distance. In this paper, we systematically compare these two methods through an experimental analysis. Our analysis shows that K-prototypes is more …