Computer Sciences Commons^™

Modeling, Learning And Reasoning About Preference Trees Over Combinatorial Domains, Xudong Liu

Theses and Dissertations--Computer Science

In my Ph.D. dissertation, I have studied problems arising in various aspects of preferences: preference modeling, preference learning, and preference reasoning, when preferences concern outcomes ranging over combinatorial domains. Preferences is a major research component in artificial intelligence (AI) and decision theory, and is closely related to the social choice theory considered by economists and political scientists. In my dissertation, I have exploited emerging connections between preferences in AI and social choice theory. Most of my research is on qualitative preference representations that extend and combine existing formalisms such as conditional preference nets, lexicographic preference trees, answer-set optimization programs, possibilistic …

Automated Conjecturing Approach For Benzenoids, David Muncy

Theses and Dissertations

Benzenoids are graphs representing the carbon structure of molecules, defined by a closed path in the hexagonal lattice. These compounds are of interest to chemists studying existing and potential carbon structures. The goal of this study is to conjecture and prove relations between graph theoretic properties among benzenoids. First, we generate conjectures on upper bounds for the domination number in benzenoids using invariant-defined functions. This work is an extension of the ideas to be presented in a forthcoming paper. Next, we generate conjectures using property-defined functions. As the title indicates, the conjectures we prove are not thought of on our …

Enabling Carrier Collaboration Via Order Sharing Double Auction: A Singapore Urban Logistics Perspective, Handoko Stephanus Daniel, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

A recent exploratory study on the collaborative urban logistics in Singapore suggests that cost reduction and privacy preservation are two main drivers that would motivate the participation of carriers in consolidating their last mile deliveries. With Singapore's mild restrictions on the vehicle types or the time windows for the last-mile delivery, we believe that with proper technology in place, an Urban Consolidation Center like the Tenjin Joint Distribution System in Fukuoka Japan may be implemented to achieve cost reduction with some degree of privacy preservation. Participating carriers keep their respective private orders and have the option to get their remaining …

Using Genetic Algorithms To Evolve Artificial Neural Networks, William T. Kearney

Honors Theses

This paper demonstrates that neuroevolution is an effective method to determine an optimal neural network topology. I provide an overview of the NeuroEvolution of Augmenting Topologies (NEAT) algorithm, and describe how unique characteristics of this algorithm solve various problem inherent to neuroevolution (namely the competing conventions problem and the challenges associated with protecting topological innovation). Parallelization is shown to greatly speed up efficiency, further reinforcing neuroevolution as a potential alternative to traditional backpropagation. I also demonstrate that appropriate parameter selection is critical in order to efficiently converge to an optimal topology. Lastly, I produce an example solution to a medical …

Evaluation Of Supervised Machine Learning For Classifying Video Traffic, Farrell R. Taylor

CCAC Theses and Dissertations

Operational deployment of machine learning based classifiers in real-world networks has become an important area of research to support automated real-time quality of service decisions by Internet service providers (ISPs) and more generally, network administrators. As the Internet has evolved, multimedia applications, such as voice over Internet protocol (VoIP), gaming, and video streaming, have become commonplace. These traffic types are sensitive to network perturbations, e.g. jitter and delay. Automated quality of service (QoS) capabilities offer a degree of relief by prioritizing network traffic without human intervention; however, they rely on the integration of real-time traffic classification to identify applications. Accordingly, …

Automatically Defined Templates For Improved Prediction Of Non-Stationary, Nonlinear Time Series In Genetic Programming, David Moskowitz

CCAC Theses and Dissertations

Soft methods of artificial intelligence are often used in the prediction of non-deterministic time series that cannot be modeled using standard econometric methods. These series, such as occur in finance, often undergo changes to their underlying data generation process resulting in inaccurate approximations or requiring additional human judgment and input in the process, hindering the potential for automated solutions.

Genetic programming (GP) is a class of nature-inspired algorithms that aims to evolve a population of computer programs to solve a target problem. GP has been applied to time series prediction in finance and other domains. However, most GP-based approaches to …

Persuasion In Online Communication : Automation And Counteraction, Samira Shaikh Shaikh

Legacy Theses & Dissertations (2009 - 2024)

In this thesis, we studied persuasion in online communication and how to automate

Cp-Nets: From Theory To Practice, Thomas E. Allen

Theses and Dissertations--Computer Science

Conditional preference networks (CP-nets) exploit the power of ceteris paribus rules to represent preferences over combinatorial decision domains compactly. CP-nets have much appeal. However, their study has not yet advanced sufficiently for their widespread use in real-world applications. Known algorithms for deciding dominance---whether one outcome is better than another with respect to a CP-net---require exponential time. Data for CP-nets are difficult to obtain: human subjects data over combinatorial domains are not readily available, and earlier work on random generation is also problematic. Also, much of the research on CP-nets makes strong, often unrealistic assumptions, such as that decision variables must …

Preferences: Optimization, Importance Learning And Strategic Behaviors, Ying Zhu

Theses and Dissertations--Computer Science

Preferences are fundamental to decision making and play an important role in artificial intelligence. Our research focuses on three group of problems based on the preference formalism Answer Set Optimization (ASO): preference aggregation problems such as computing optimal (near optimal) solutions, strategic behaviors in preference representation, and learning ranks (weights) for preferences.

In the first group of problems, of interest are optimal outcomes, that is, outcomes that are optimal with respect to the preorder defined by the preference rules. In this work, we consider computational problems concerning optimal outcomes. We propose, implement and study methods to compute an optimal outcome; …

Implementation Of An Air Supply Unit Control Scheme For The Uc2av (Unmanned Circulation Control Aerial Vehicle), Cameron Rosen

Electronic Theses and Dissertations

The expanded prevalence of Unmanned Aerial Vehicles (UAVs) in recent years has created many opportunities to research novel applications for their use, enabled by the reduced cost, mission flexibility, and reduced risk that small-scale unmanned platforms provide in comparison to larger aircraft. Despite the versatility of unmanned aviation, limitations on payload size and weight, fuel and power capacity, and takeoff and landing infrastructure can restrict UAV applications, and have created a need for lift augmenting technologies that can reduce the impact of these limitations. Circulation Control (CC) is an active flow technique that has been proven as a method for …

Automated Design Of Boolean Satisfiability Solvers Employing Evolutionary Computation, Alex Raymond Bertels

Masters Theses

"Modern society gives rise to complex problems which sometimes lend themselves to being transformed into Boolean satisfiability (SAT) decision problems; this thesis presents an example from the program understanding domain. Current conflict-driven clause learning (CDCL) SAT solvers employ all-purpose heuristics for making decisions when finding truth assignments for arbitrary logical expressions called SAT instances. The instances derived from a particular problem class exhibit a unique underlying structure which impacts a solver's effectiveness. Thus, tailoring the solver heuristics to a particular problem class can significantly enhance the solver's performance; however, manual specialization is very labor intensive. Automated development may apply hyper-heuristics …

Representation And Analysis Of Multi-Modal, Nonuniform Time Series Data: An Application To Survival Prognosis Of Oncology Patients In An Outpatient Setting, Jennifer Winikus

Dissertations, Master's Theses and Master's Reports

The representation of nonuniform, multi-modal, time-limited time series data is complex and explored through the use of discrete representation, dimensionality reduction with segmentation based techniques, and with behavioral representation approaches. These explorations are done with a focus on an outpatient oncology setting with the classification and regression analysis being used for length of survival prognosis. Each decision of representation and analysis is not independent, with implications of each decision in method for how the data is represented and then which analysis technique is used. One unique aspect of the work is the use of outpatient clinical data for patients, which …

Mining Human Activity Using Dimensionality Reduction And Pattern Recognition, Ismail El Moudden, Mounir Ouzir, Badreddine Benyacoub, Souad El Bernoussi

Research and Infrastructure Service Enterprise (RISE) Faculty Publications

Human activity recognition (HAR) is an emerging research topic in pattern recognition, especially in computer vision. The main objective of human activity recognition is to automatically detect and analyze human activities from the information acquired from different sensors. Human activity prediction using big data remains a challengingly open problem. Several approaches have recently been developed in order to find practical ways to solve high dimensionality of data problems. The aim of this study is to attempt, using data mining techniques, to deal with HAR modeling involving a significant number of variables in order to identify relevant parameters from data and …

Integrating Cobots In Engineering Technology Education, Ana M. Djuric, Vukica Jovanovic, Tatiana V. Goris, Otilia Popescu

Engineering Technology Faculty Publications

Collaborative robots or CoBots, unlike traditional robots, are safe and flexible enough to work harmoniously with humans. Exploiting the efficiency of automated operations and the flexibility of manual operations in one process can improve productivity and worker job satisfaction. CoBots technology has been experiencing strong growth in different areas such as ground transportation, food-processing industry, car manufacturing, and naval or aeronautical engineering. Current CoBots education and training opportunities are rare or non-existent in university environments. In response to this need, we developed several CoBots modules which will be integrated in the current robotics and mechatronics courses. In this paper we …

Improving The Vector Auto Regression Technique For Time-Series Link Prediction By Using Support Vector Machine, Proceso L. Fernandez Jr, Jan Miles Co

Department of Information Systems & Computer Science Faculty Publications

Predicting links between the nodes of a graph has become an important Data Mining task because of its direct applications to biology, social networking, communication surveillance, and other domains. Recent literature in time-series link prediction has shown that the Vector Auto Regression (VAR) technique is one of the most accurate for this problem. In this study, we apply Support Vector Machine (SVM) to improve the VAR technique that uses an unweighted adjacency matrix along with 5 matrices: Common Neighbor (CN), Adamic-Adar (AA), Jaccard’s Coefficient (JC), Preferential Attachment (PA), and Research Allocation Index (RA). A DBLP dataset covering the years from …

Applications Of Computational Geometry And Computer Vision, Joseph Lemley

All Master's Theses

Recent advances in machine learning research promise to bring us closer to the original goals of artificial intelligence. Spurred by recent innovations in low-cost, specialized hardware and incremental refinements in machine learning algorithms, machine learning is revolutionizing entire industries. Perhaps the biggest beneficiary of this progress has been the field of computer vision. Within the domains of computational geometry and computer vision are two problems: Finding large, interesting holes in high dimensional data, and locating and automatically classifying facial features from images. State of the art methods for facial feature classification are compared and new methods for finding empty hyper-rectangles …

The Reconfigurable Machinery Efficient Workspace Analysis Based On The Twist Angles, Ana M. Djuric, Vukica Jovanovic, Mirjana Filipovic, Ljubinko Kevac

Engineering Technology Faculty Publications

A novel methodology for the calculation, visualisation and analysis of the Reconfigurable Machinery Efficient Workspace (RMEW), based on the twist angles, is presented in this paper. The machinery's kinematic parameters are used for calculating the workspace, while the efficient workspace is associated with the machinery's path and includes the end-effector position and orientation. To analyse and visualise many different machinery efficient workspaces at the same time, the calculation is based on the previously developed and validated complex reconfigurable machinery's kinematic structure named n-DOF Global Kinematic Model (n-GKM). An industrial robot is used as an example to demonstrate …

An Approach To Automatic Detection Of Suspicious Individuals In A Crowd, Satabdi Mukherjee

Dissertations and Theses

This paper describes an approach to identify individuals with suspicious objects in a crowd. It is based on a well-known image retrieval problem as applied to mobile visual search. In many cases, the process of building a hierarchical tree uses k-means clustering followed by geometric verification. However, the number of clusters is not known in advance, and sometimes it is randomly generated. This may lead to a congested clustering which can cause problems in grouping large real-time data. To overcome this problem we have applied the Indian Buffet stochastic process approach in this paper to the clustering problem. We present …

An Extended Study On Addressing Defender Teamwork While Accounting For Uncertainty In Attacker Defender Games Using Iterative Dec-Mdps, Eric Shieh, Albert Xin Jiang, Amulya Yadav, Pradeep Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

Multi-agent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multi-agent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork research in security games. The problem that this paper seeks to solve is the coordination of decentralized defender agents in the presence of uncertainty while securing targets against an observing adversary. To address this problem, we offer the following novel contributions in this paper: (i) New model of security games with defender teams that coordinate under uncertainty; (ii) New algorithm based on column …

Factororacle: An Extensible Max External For Investigating Applications Of The Factor Oracle Automaton In Real-Time Music Improvisation, Adam James Wilson

Publications and Research

There are several extant software systems designed to generate music in real-time using a factor oracle automaton constructed from the musical input of a human improvisor. The impetus for the design of the factorOracle external is neither a desire to supersede these systems nor introduce novel algorithms for traversing the oracle, but rather to provide a fast, canonical interface for the automaton in Cycling74’s Max and, in future iterations, the Pure Data programming environment. Technical features of the factorOracle software are introduced here.

An Improved Smote Algorithm Based On Genetic Algorithm For Imbalanced Data Collection, Qiong Gu, Xian-Ming Wang, Zhao Wu, Bing Ning, Chun-Sheng Xin

Electrical & Computer Engineering Faculty Publications

Classification of imbalanced data has been recognized as a crucial problem in machine learning and data mining. In an imbalanced dataset, minority class instances are likely to be misclassified. When the synthetic minority over-sampling technique (SMOTE) is applied in imbalanced dataset classification, the same sampling rate is set for all samples of the minority class in the process of synthesizing new samples, this scenario involves blindness. To overcome this problem, an improved SMOTE algorithm based on genetic algorithm (GA), namely, GASMOTE was proposed. First, GASMOTE set different sampling rates for different minority class samples. A combination of the sampling rates …

Eeg Interictal Spike Detection Using Artificial Neural Networks, Howard J. Carey Iii

Theses and Dissertations

Epilepsy is a neurological disease causing seizures in its victims and affects approximately 50 million people worldwide. Successful treatment is dependent upon correct identification of the origin of the seizures within the brain. To achieve this, electroencephalograms (EEGs) are used to measure a patient’s brainwaves. This EEG data must be manually analyzed to identify interictal spikes that emanate from the afflicted region of the brain. This process can take a neurologist more than a week and a half per patient. This thesis presents a method to extract and process the interictal spikes in a patient, and use them to reduce …

Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross

Conference papers

Activity discovery is the unsupervised process of discovering patterns in data produced from sensor networks that are monitoring the behaviour of human subjects. Improvements in activity discovery may simplify the training of activity recognition models by enabling the automated annotation of datasets and also the construction of systems that can detect and highlight deviations from normal behaviour. With this in mind, we propose an approach to activity discovery based on topic modelling techniques, and evaluate it on a dataset that mimics complex, interleaved sensor data in the real world. We also propose a means for discovering hierarchies of aggregated activities …

Harnessing The Power Of Text Mining For The Detection Of Abusive Content In Social Media, Hao Chen, Susan Mckeever, Sarah Jane Delany

Conference papers

Abstract The issues of cyberbullying and online harassment have gained considerable coverage in the last number of years. Social media providers need to be able to detect abusive content both accurately and efficiently in order to protect their users. Our aim is to investigate the application of core text mining techniques for the automatic detection of abusive content across a range of social media sources include blogs, forums, media-sharing, Q&A and chat - using datasets from Twitter, YouTube, MySpace, Kongregate, Formspring and Slashdot. Using supervised machine learning, we compare alternative text representations and dimension reduction approaches, including feature selection and …

Pattern Discovery In Dna Using Stochastic Automata, Shweta Shweta

Master's Projects

We consider the problem of identifying similarities between different species of DNA. To do this we infer a stochastic finite automata from a given training data and compare it with a test data. The training and test data consist of DNA sequence of different species. Our method first identifies sentences in DNA. To identify sentences we read DNA sequence one character at a time, 3 characters form a codon and codons form proteins (also known as amino acid chains).Each amino acid in proteins belongs to a group. In total we have 5 groups’ polar, non-polar, acidic, basic and stop codons. …

Applying Bayesian Machine Learning Methods To Theoretical Surface Science, Shane Carr

McKelvey School of Engineering Graduate Student Theses & Dissertations

Machine learning is a rapidly evolving field in computer science with increasingly many applications to other domains. In this thesis, I present a Bayesian machine learning approach to solving a problem in theoretical surface science: calculating the preferred active site on a catalyst surface for a given adsorbate molecule. I formulate the problem as a low-dimensional objective function. I show how the objective function can be approximated into a certain confidence interval using just one iteration of the self-consistent field (SCF) loop in density functional theory (DFT). I then use Bayesian optimization to perform a global search for the solution. …

Predicting Energy Demand Peak Using M5 Model Trees, Sara S. Abdelkader, Katarina Grolinger, Miriam Am Capretz

Electrical and Computer Engineering Publications

Predicting energy demand peak is a key factor for reducing energy demand and electricity bills for commercial customers. Features influencing energy demand are many and complex, such as occupant behaviours and temperature. Feature selection can decrease prediction model complexity without sacrificing performance. In this paper, features were selected based on their multiple linear regression correlation coefficients. This paper discusses the capabilities of M5 model trees in energy demand prediction for commercial buildings. M5 model trees are similar to regression trees; however they are more suitable for continuous prediction problems. The M5 model tree prediction was developed based on a selected …

Battle Bot Ai – Patriot Bot, James Johnston

Computer Engineering

An entry in the the 'Battle Block AI' competition hosted by 'The AI Games'.

Energy Forecasting For Event Venues: Big Data And Prediction Accuracy, Katarina Grolinger, Alexandra L'Heureux, Miriam Am Capretz, Luke Seewald

Electrical and Computer Engineering Publications

Advances in sensor technologies and the proliferation of smart meters have resulted in an explosion of energy-related data sets. These Big Data have created opportunities for development of new energy services and a promise of better energy management and conservation. Sensor-based energy forecasting has been researched in the context of office buildings, schools, and residential buildings. This paper investigates sensor-based forecasting in the context of event-organizing venues, which present an especially difficult scenario due to large variations in consumption caused by the hosted events. Moreover, the significance of the data set size, specifically the impact of temporal granularity, on energy …

A Layered Hidden Markov Model For Predicting Human Trajectories In A Multi-Floor Building, Qian Li, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Tracking and modeling huge amount of users’ movement in a multi-floor building by using wireless devices is a challenging task, due to crowd movement complexity and signal sensing accuracy. In this paper, we use Layered Hidden Markov Model (LHMM) to fit the spatial-temporal trajectories (with large number of missing values). We decompose the problem into distinct layers that Hidden Markov Models (HMMs) are operated at different spatial granularities separately. Baum-Welch algorithm and Viterbi algorithm are used for finding the probable location sequences at each layer. By measuring the predicted result of trajectories, we compared the predicted results of both single …