Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Selected Works (27)
- Singapore Management University (26)
- Air Force Institute of Technology (13)
- City University of New York (CUNY) (6)
- Old Dominion University (6)
-
- Southern Methodist University (6)
- University of Kentucky (5)
- California Polytechnic State University, San Luis Obispo (4)
- Eastern Washington University (4)
- Florida International University (4)
- Western University (4)
- Michigan Technological University (3)
- University of New Mexico (3)
- Virginia Commonwealth University (3)
- Georgia Southern University (2)
- Portland State University (2)
- Purdue University (2)
- University of Arkansas, Fayetteville (2)
- University of Connecticut (2)
- University of Louisville (2)
- University of Massachusetts Amherst (2)
- University of New Orleans (2)
- Western Kentucky University (2)
- William & Mary Law School (2)
- Ateneo de Manila University (1)
- Bard College (1)
- Bucknell University (1)
- California State University, San Bernardino (1)
- Chapman University (1)
- Colby College (1)
- Keyword
-
- Computer science (7)
- Algorithms (5)
- Algorithm (4)
- Area-universal networks (4)
- Channel routing (4)
-
- Cryptography (4)
- Machine Learning (4)
- Randomized routing (4)
- Artificial intelligence (3)
- Clustering (3)
- Iterated local search (3)
- Machine learning (3)
- Online learning (3)
- Parallel algorithms (3)
- Parallel computation (3)
- Wormhole routing (3)
- Accuracy (2)
- Apportionment (2)
- Approximation algorithm (2)
- Automated Aerial Refueling (2)
- Big data (2)
- Computational complexity (2)
- Computer Science (2)
- Computer Vision (2)
- Data mining (2)
- Data stream (2)
- Data summarization (2)
- Election Districts (2)
- Election Law (2)
- Encryption (2)
- Publication
-
- Research Collection School Of Computing and Information Systems (25)
- Ronald Greenberg (22)
- Theses and Dissertations (13)
- Dissertations, Theses, and Capstone Projects (4)
- EWU Masters Thesis Collection (4)
-
- Electronic Thesis and Dissertation Repository (4)
- FIU Electronic Theses and Dissertations (4)
- Honors Theses (4)
- SMU Data Science Review (4)
- Computer Science Faculty Publications (3)
- Dissertations, Master's Theses and Master's Reports (3)
- Electronic Theses and Dissertations (3)
- Faculty Publications (3)
- Yuliya Lierler (3)
- Computer Science and Computer Engineering Undergraduate Honors Theses (2)
- Doctoral Dissertations (2)
- Electrical & Computer Engineering Faculty Publications (2)
- Honors College Theses (2)
- Honors Scholar Theses (2)
- Master's Theses (2)
- Masters Theses & Specialist Projects (2)
- Publications and Research (2)
- Shared Knowledge Conference (2)
- The Summer Undergraduate Research Fellowship (SURF) Symposium (2)
- Theses and Dissertations--Computer Science (2)
- University of New Orleans Theses and Dissertations (2)
- Arshad M. Khan, Ph.D. (1)
- Business Systems and Analytics Faculty Work (1)
- Computer Engineering (1)
- Computer Science ETDs (1)
- Publication Type
Articles 1 - 30 of 157
Full-Text Articles in Entire DC Network
Complexity Results For Fourier-Motzkin Elimination, Delaram Talaashrafi
Complexity Results For Fourier-Motzkin Elimination, Delaram Talaashrafi
Electronic Thesis and Dissertation Repository
In this thesis, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on Kohler’s work and an improved version of Balas’ work. Moreover, this method only uses arithmetic operations on matrices. Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches based on linear programming.
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
With the rapid development of cloud computing, artificial intelligence technologies and big data applications, data centers have become widely deployed. High density IT equipment in data centers consumes a lot of electrical power, and makes data center a hungry monster of energy consumption. To solve this problem, renewable energy is increasingly integrated into data center power provisioning systems. Compared to the traditional power supply methods, renewable energy has its unique characteristics, such as intermittency and randomness. When renewable energy supplies power to the data center industrial park, this kind of power supply not only has negative effects on the normal …
Reinforcement Learning For Collective Multi-Agent Decision Making, Duc Thien Nguyen
Reinforcement Learning For Collective Multi-Agent Decision Making, Duc Thien Nguyen
Dissertations and Theses Collection (Open Access)
In this thesis, we study reinforcement learning algorithms to collectively optimize decentralized policy in a large population of autonomous agents. We notice one of the main bottlenecks in large multi-agent system is the size of the joint trajectory of agents which quickly increases with the number of participating agents. Furthermore, the noiseof actions concurrently executed by different agents in a large system makes it difficult for each agent to estimate the value of its own actions, which is well-known as the multi-agent credit assignment problem. We propose a compact representation for multi-agent systems using the aggregate counts to address …
Sequence Pattern Mining With Variables, James S. Okolica, Gilbert L. Peterson, Robert F. Mills, Michael R. Grimaila
Sequence Pattern Mining With Variables, James S. Okolica, Gilbert L. Peterson, Robert F. Mills, Michael R. Grimaila
Faculty Publications
Sequence pattern mining (SPM) seeks to find multiple items that commonly occur together in a specific order. One common assumption is that all of the relevant differences between items are captured through creating distinct items, e.g., if color matters then the same item in two different colors would have two items created, one for each color. In some domains, that is unrealistic. This paper makes two contributions. The first extends SPM algorithms to allow item differentiation through attribute variables for domains with large numbers of items, e.g, by having one item with a variable with a color attribute rather than …
Constrained K-Means Clustering Validation Study, Nicholas Mcdaniel, Stephen Burgess, Jeremy Evert
Constrained K-Means Clustering Validation Study, Nicholas Mcdaniel, Stephen Burgess, Jeremy Evert
Student Research
Machine Learning (ML) is a growing topic within Computer Science with applications in many fields. One open problem in ML is data separation, or data clustering. Our project is a validation study of, “Constrained K-means Clustering with Background Knowledge" by Wagstaff et. al. Our data validates the finding by Wagstaff et. al., which shows that a modified k-means clustering approach can outperform more general unsupervised learning algorithms when some domain information about the problem is available. Our data suggests that k-means clustering augmented with domain information can be a time efficient means for segmenting data sets. Our validation study focused …
Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones
Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones
Computer Science ETDs
Though computational models typically assume all program steps execute flawlessly, that does not imply all steps are equally important if a failure should occur. In the "Constrained Reliability Allocation" problem, sufficient resources are guaranteed for operations that prompt eventual program termination on failure, but those operations that only cause output errors are given a limited budget of some vital resource, insufficient to ensure correct operation for each of them.
In this dissertation, I present a novel representation of failures based on a combination of their timing and location combined with criticality assessments---a method used to predict the behavior of systems …
A Multi-Task Approach To Incremental Dialogue State Tracking, Anh Duong Trinh, Robert J. Ross, John D. Kelleher
A Multi-Task Approach To Incremental Dialogue State Tracking, Anh Duong Trinh, Robert J. Ross, John D. Kelleher
Conference papers
Incrementality is a fundamental feature of language in real world use. To this point, however, the vast majority of work in automated dialogue processing has focused on language as turn based. In this paper we explore the challenge of incremental dialogue state tracking through the development and analysis of a multi-task approach to incremental dialogue state tracking. We present the design of our incremental dialogue state tracker in detail and provide evaluation against the well known Dialogue State Tracking Challenge 2 (DSTC2) dataset. In addition to a standard evaluation of the tracker, we also provide an analysis of the Incrementality …
Genetic Algorithm Design Of Photonic Crystals For Energy-Efficient Ultrafast Laser Transmitters, Troy A. Hutchins-Delgado
Genetic Algorithm Design Of Photonic Crystals For Energy-Efficient Ultrafast Laser Transmitters, Troy A. Hutchins-Delgado
Shared Knowledge Conference
Photonic crystals allow light to be controlled and manipulated such that novel photonic devices can be created. We are interested in using photonic crystals to increase the energy efficiency of our semiconductor whistle-geometry ring lasers. A photonic crystal will enable us to reduce the ring size, while maintaining confinement, thereby reducing its operating power. Photonic crystals can also exhibit slow light that will increase the interaction with the material. This will increase the gain, and therefore, lower the threshold for lasing to occur. Designing a photonic crystal for a particular application can be a challenge due to its number of …
Sampling Complexity Of Bosonic Random Walkers On A One-Dimensional Lattice, Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch
Sampling Complexity Of Bosonic Random Walkers On A One-Dimensional Lattice, Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch
Shared Knowledge Conference
Computers based quantum logic are believed to solve problems faster and more efficiently than computers based on classical boolean logic. However, a large-scale universal quantum computer with error correction may not be realized in near future. But we can ask the question: can we devise a specific problem that a quantum device can solve faster than current state of the art super computers? One such problem is the so called "Boson Sampling" problem introduced by Aaronson and Arkhipov. The problem is to generate random numbers according to same distribution as the output number configurations of photons in linear optics. It …
Using Finite-State Models For Log Differencing, Hen Amar, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz
Using Finite-State Models For Log Differencing, Hen Amar, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz
Research Collection School Of Computing and Information Systems
Much work has been published on extracting various kinds of models from logs that document the execution of running systems. In many cases, however, for example in the context of evolution, testing, or malware analysis, engineers are interested not only in a single log but in a set of several logs, each of which originated from a different set of runs of the system at hand. Then, the difference between the logs is the main target of interest. In this work we investigate the use of finite-state models for log differencing. Rather than comparing the logs directly, we generate concise …
Unsupervised User Identity Linkage Via Factoid Embedding, Wei Xie, Xin Mu, Roy Ka Wei Lee, Feida Zhu, Ee-Peng Lim
Unsupervised User Identity Linkage Via Factoid Embedding, Wei Xie, Xin Mu, Roy Ka Wei Lee, Feida Zhu, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
User identity linkage (UIL), the problem of matching user account across multiple online social networks (OSNs), is widely studied and important to many real-world applications. Most existing UIL solutions adopt a supervised or semisupervised approach which generally suffer from scarcity of labeled data. In this paper, we propose Factoid Embedding, a novel framework that adopts an unsupervised approach. It is designed to cope with different profile attributes, content types and network links of different OSNs. The key idea is that each piece of information about a user identity describes the real identity owner, and thus distinguishes the owner from other …
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
FIU Electronic Theses and Dissertations
The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex optimization algorithms and improve them into nonconvex objective? For application, …
On The Sequential Massart Algorithm For Statistical Model Checking, Cyrille Jegourel, Jun Sun, Jin Song Dong
On The Sequential Massart Algorithm For Statistical Model Checking, Cyrille Jegourel, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Several schemes have been provided in Statistical Model Checking (SMC) for the estimation of property occurrence based on predefined confidence and absolute or relative error. Simulations might be however costly if many samples are required and the usual algorithms implemented in statistical model checkers tend to be conservative. Bayesian and rare event techniques can be used to reduce the sample size but they can not be applied without prerequisite or knowledge about the system under scrutiny. Recently, sequential algorithms based on Monte Carlo estimations and Massart bounds have been proposed to reduce the sample size while providing guarantees on error …
Game-Theoretic And Machine-Learning Techniques For Cyber-Physical Security And Resilience In Smart Grid, Longfei Wei
Game-Theoretic And Machine-Learning Techniques For Cyber-Physical Security And Resilience In Smart Grid, Longfei Wei
FIU Electronic Theses and Dissertations
The smart grid is the next-generation electrical infrastructure utilizing Information and Communication Technologies (ICTs), whose architecture is evolving from a utility-centric structure to a distributed Cyber-Physical System (CPS) integrated with a large-scale of renewable energy resources. However, meeting reliability objectives in the smart grid becomes increasingly challenging owing to the high penetration of renewable resources and changing weather conditions. Moreover, the cyber-physical attack targeted at the smart grid has become a major threat because millions of electronic devices interconnected via communication networks expose unprecedented vulnerabilities, thereby increasing the potential attack surface. This dissertation is aimed at developing novel game-theoretic and …
Data Stream Algorithms For Large Graphs And High Dimensional Data, Hoa Vu
Data Stream Algorithms For Large Graphs And High Dimensional Data, Hoa Vu
Doctoral Dissertations
In contrast to the traditional random access memory computational model where the entire input is available in the working memory, the data stream model only provides sequential access to the input. The data stream model is a natural framework to handle large and dynamic data. In this model, we focus on designing algorithms that use sublinear memory and a small number of passes over the stream. Other desirable properties include fast update time, query time, and post processing time. In this dissertation, we consider different problems in graph theory, combinatorial optimization, and high dimensional data processing. The first part of …
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Sirani Mututhanthrige Perera
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
Influence Maximization On Social Graphs: A Survey, Yuchen Li, Ju Fan, Yanhao Wang, Kian-Lee Tan
Influence Maximization On Social Graphs: A Survey, Yuchen Li, Ju Fan, Yanhao Wang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Influence Maximization (IM), which selects a set of k users (called seed set) from a social network to maximize the expected number of influenced users (called influence spread), is a key algorithmic problem in social influence analysis. Due to its immense application potential and enormous technical challenges, IM has been extensively studied in the past decade. In this paper, we survey and synthesize a wide spectrum of existing studies on IM from an algorithmic perspective, with a special focus on the following key aspects (1) a review of well-accepted diffusion models that capture information diffusion process and build the foundation …
Exploring The Effect Of Different Numbers Of Convolutional Filters And Training Loops On The Performance Of Alphazero, Jared Prince
Exploring The Effect Of Different Numbers Of Convolutional Filters And Training Loops On The Performance Of Alphazero, Jared Prince
Masters Theses & Specialist Projects
In this work, the algorithm used by AlphaZero is adapted for dots and boxes, a two-player game. This algorithm is explored using different numbers of convolutional filters and training loops, in order to better understand the effect these parameters have on the learning of the player. Different board sizes are also tested to compare these parameters in relation to game complexity. AlphaZero originated as a Go player using an algorithm which combines Monte Carlo tree search and convolutional neural networks. This novel approach, integrating a reinforcement learning method previously applied to Go (MCTS) with a supervised learning method (neural networks) …
Smt-Based Constraint Answer Set Solver Ezsmt+ For Non-Tight Programs, Da Shen, Yuliya Lierler
Smt-Based Constraint Answer Set Solver Ezsmt+ For Non-Tight Programs, Da Shen, Yuliya Lierler
Yuliya Lierler
The Chapman Bone Algorithm: A Diagnostic Alternative For The Evaluation Of Osteoporosis, Elise Levesque, Anton Ketterer, Wajiha Memon, Cameron James, Noah Barrett, Cyril Rakovski, Frank Frisch
The Chapman Bone Algorithm: A Diagnostic Alternative For The Evaluation Of Osteoporosis, Elise Levesque, Anton Ketterer, Wajiha Memon, Cameron James, Noah Barrett, Cyril Rakovski, Frank Frisch
Mathematics, Physics, and Computer Science Faculty Articles and Research
Osteoporosis is the most common metabolic bone disease and goes largely undiagnosed throughout the world, due to the inaccessibility of DXA machines. Multivariate analyses of serum bone turnover markers were evaluated in 226 Orange County, California, residents with the intent to determine if serum osteocalcin and serum pyridinoline cross-links could be used to detect the onset of osteoporosis as effectively as a DXA scan. Descriptive analyses of the demographic and lab characteristics of the participants were performed through frequency, means and standard deviation estimations. We implemented logistic regression modeling to find the best classification algorithm for osteoporosis. All calculations and …
An Outlier Detection Algorithm Based On Cross-Correlation Analysis For Time Series Dataset, Hui Lu, Yaxian Liu, Zongming Fei, Chongchong Guan
An Outlier Detection Algorithm Based On Cross-Correlation Analysis For Time Series Dataset, Hui Lu, Yaxian Liu, Zongming Fei, Chongchong Guan
Computer Science Faculty Publications
Outlier detection is a very essential problem in a variety of application areas. Many detection methods are deficient for high-dimensional time series data sets containing both isolated and assembled outliers. In this paper, we propose an Outlier Detection method based on Cross-correlation Analysis (ODCA). ODCA consists of three key parts. They are data preprocessing, outlier analysis, and outlier rank. First, we investigate a linear interpolation method to convert assembled outliers into isolated ones. Second, a detection mechanism based on the cross-correlation analysis is proposed for translating the high-dimensional data sets into 1-D cross-correlation function, according to which the isolated outlier …
The Effectiveness Of Using Diversity To Select Multiple Classifier Systems With Varying Classification Thresholds, Harris K. Butler Iv, Mark A. Friend, Kenneth W. Bauer, Trevor J. Bihl
The Effectiveness Of Using Diversity To Select Multiple Classifier Systems With Varying Classification Thresholds, Harris K. Butler Iv, Mark A. Friend, Kenneth W. Bauer, Trevor J. Bihl
Faculty Publications
In classification applications, the goal of fusion techniques is to exploit complementary approaches and merge the information provided by these methods to provide a solution superior than any single method. Associated with choosing a methodology to fuse pattern recognition algorithms is the choice of algorithm or algorithms to fuse. Historically, classifier ensemble accuracy has been used to select which pattern recognition algorithms are included in a multiple classifier system. More recently, research has focused on creating and evaluating diversity metrics to more effectively select ensemble members. Using a wide range of classification data sets, methodologies, and fusion techniques, current diversity …
Rationality And Efficient Verifiable Computation, Matteo Campanelli
Rationality And Efficient Verifiable Computation, Matteo Campanelli
Dissertations, Theses, and Capstone Projects
In this thesis, we study protocols for delegating computation in a model where one of the parties is rational. In our model, a delegator outsources the computation of a function f on input x to a worker, who receives a (possibly monetary) reward. Our goal is to design very efficient delegation schemes where a worker is economically incentivized to provide the correct result f(x). In this work we strive for not relying on cryptographic assumptions, in particular our results do not require the existence of one-way functions.
We provide several results within the framework of rational proofs introduced by Azar …
List, Sample, And Count, Ali Assarpour
List, Sample, And Count, Ali Assarpour
Dissertations, Theses, and Capstone Projects
Counting plays a fundamental role in many scientific fields including chemistry, physics, mathematics, and computer science. There are two approaches for counting, the first relies on analytical tools to drive closed form expression, while the second takes advantage of the combinatorial nature of the problem to construct an algorithm whose output is the number of structures. There are many algorithmic techniques for counting, they cover the explicit approach of counting by listing to the approximate approach of counting by sampling.
This thesis looks at counting three sets of objects. First, we consider a subclass of boolean functions that are monotone. …
Question-Guided Hybrid Convolution For Visual Question Answering, Peng Gao, Pan Lu, Hongsheng Li, Shuang Li, Yikang Li, Steven C. H. Hoi, Xiaogang Wang
Question-Guided Hybrid Convolution For Visual Question Answering, Peng Gao, Pan Lu, Hongsheng Li, Shuang Li, Yikang Li, Steven C. H. Hoi, Xiaogang Wang
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel Question-Guided Hybrid Convolution (QGHC) network for Visual Question Answering (VQA). Most state-of-the-art VQA methods fuse the high-level textual and visual features from the neural network and abandon the visual spatial information when learning multi-modal features.To address these problems, question-guided kernels generated from the input question are designed to convolute with visual features for capturing the textual and visual relationship in the early stage. The question-guided convolution can tightly couple the textual and visual information but also introduce more parameters when learning kernels. We apply the group convolution, which consists of question-independent kernels and …
Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai
Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai
Research Collection School Of Computing and Information Systems
This paper considers a sequential discrete choice problem in a time domain, formulated and solved as a route choice problem in a space domain. Starting from a dynamic specification of time-series discrete choices, we show how it is transferrable to link-based route choices that can be formulated by a finite path choice multinomial logit model. This study establishes that modeling sequential choices over time and in space are equivalent as long as the utility of the choice sequence is additive over the decision steps, the link-specific attributes are deterministic, and the decision process is Markovian. We employ the recursive logit …
Strong Equivalence And Conservative Extensions Hand In Hand For Arguing Correctness Of New Action Language C Formalization, Yuliya Lierler
Strong Equivalence And Conservative Extensions Hand In Hand For Arguing Correctness Of New Action Language C Formalization, Yuliya Lierler
Yuliya Lierler
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
Electronic Thesis and Dissertation Repository
Polynomials may be represented sparsely in an effort to conserve memory usage and provide a succinct and natural representation. Moreover, polynomials which are themselves sparse – have very few non-zero terms – will have wasted memory and computation time if represented, and operated on, densely. This waste is exacerbated as the number of variables increases. We provide practical implementations of sparse multivariate data structures focused on data locality and cache complexity. We look to develop high-performance algorithms and implementations of fundamental polynomial operations, using these sparse data structures, such as arithmetic (addition, subtraction, multiplication, and division) and interpolation. We revisit …
Manana: A Generalized Heuristic Scoring Approach For Concept Map Analysis As Applied To Cybersecurity Education, Sharon Elizabeth Blake Gatto
Manana: A Generalized Heuristic Scoring Approach For Concept Map Analysis As Applied To Cybersecurity Education, Sharon Elizabeth Blake Gatto
University of New Orleans Theses and Dissertations
Concept Maps (CMs) are considered a well-known pedagogy technique in creating curriculum, educating, teaching, and learning. Determining comprehension of concepts result from comparisons of candidate CMs against a master CM, and evaluate "goodness". Past techniques for comparing CMs have revolved around the creation of a subjective rubric. We propose a novel CM scoring scheme called MAnanA based on a Fuzzy Similarity Scaling (FSS) score to vastly remove the subjectivity of the rubrics in the process of grading a CM. We evaluate our framework against a predefined rubric and test it with CM data collected from the Introduction to …
Cyber Anomaly Detection: Using Tabulated Vectors And Embedded Analytics For Efficient Data Mining, Robert J. Gutierrez, Kenneth W. Bauer, Bradley C. Boehmke, Cade M. Saie, Trevor J. Bihl
Cyber Anomaly Detection: Using Tabulated Vectors And Embedded Analytics For Efficient Data Mining, Robert J. Gutierrez, Kenneth W. Bauer, Bradley C. Boehmke, Cade M. Saie, Trevor J. Bihl
Faculty Publications
Firewalls, especially at large organizations, process high velocity internet traffic and flag suspicious events and activities. Flagged events can be benign, such as misconfigured routers, or malignant, such as a hacker trying to gain access to a specific computer. Confounding this is that flagged events are not always obvious in their danger and the high velocity nature of the problem. Current work in firewall log analysis is manual intensive and involves manpower hours to find events to investigate. This is predominantly achieved by manually sorting firewall and intrusion detection/prevention system log data. This work aims to improve the ability of …