Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Analytical models (2)
- Empirical performance (2)
- Stochastic processes (2)
- Accuracy (1)
- Ad hoc networks (1)
-
- Aggregates (1)
- Approximate algorithms (1)
- Arbitrary node lifetime distributions (1)
- Black Friar (1)
- Botnet proliferation (1)
- Bro (1)
- C-W algorithm (1)
- Cardinalities (1)
- Chen-Stein theorem (1)
- Classical Poisson convergence analysis (1)
- Computationally efficient (1)
- Computer network security (1)
- Computer viruses (1)
- Convoluted dependency (1)
- Data sets (1)
- Degree-irregular graph (1)
- Degree-regular graph (1)
- Delay (1)
- Digital Forensics (1)
- Discere (1)
- Distributed systems (1)
- Dynamic random graphs (1)
- Edge-arrival process superposition (1)
- Edge-creation process (1)
- Electronic Discovery (1)
- Publication
- Publication Type
- File Type
Articles 1 - 14 of 14
Full-Text Articles in Databases and Information Systems
Application Of Digital Forensic Science To Electronic Discovery In Civil Litigation, Brian Roux
Application Of Digital Forensic Science To Electronic Discovery In Civil Litigation, Brian Roux
University of New Orleans Theses and Dissertations
Following changes to the Federal Rules of Civil Procedure in 2006 dealing with the role of Electronically Stored Information, digital forensics is becoming necessary to the discovery process in civil litigation. The development of case law interpreting the rule changes since their enactment defines how digital forensics can be applied to the discovery process, the scope of discovery, and the duties imposed on parties. Herein, pertinent cases are examined to determine what trends exist and how they effect the field. These observations buttress case studies involving discovery failures in large corporate contexts along with insights on the technical reasons those …
Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Kyriakos MOURATIDIS
Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM, may produce widely varying subset sums. In this paper, we introduce the LRM algorithm that lowers the expected spread in subset sums to one third that of BLDM for uniformly distributed numbers and odd subset cardinalities. We also propose Meld, a novel strategy for …
On-Line Portfolio Selection With Moving Average Reversion, Bin Li, Steven C. H. Hoi
On-Line Portfolio Selection With Moving Average Reversion, Bin Li, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
On-line portfolio selection has attracted increasing interests in machine learning and AI communities recently. Empirical evidences show that stock's high and low prices are temporary and stock price relatives are likely to follow the mean reversion phenomenon. While the existing mean reversion strategies are shown to achieve good empirical performance on many real datasets, they often make the single-period mean reversion assumption, which is not always satisfied in some real datasets, leading to poor performance when the assumption does not hold. To overcome the limitation, this article proposes a multiple-period mean reversion, or so-called Moving Average Reversion (MAR), and a …
Online Kernel Selection: Algorithms And Evaluations, Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Yi, Steven C. H. Hoi
Online Kernel Selection: Algorithms And Evaluations, Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Yi, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being used, identifying good kernels among a set of given kernels is important to the success of kernel methods. A straightforward approach to address this problem is cross-validation by training a separate classifier for each kernel and choosing the best kernel classifier out of them. Another approach is Multiple Kernel Learning (MKL), which aims to learn a single kernel classifier from an optimal combination of multiple kernels. However, both approaches suffer from a high computational …
Exact Soft Confidence-Weighted Learning, Jialei Wang, Steven C. H. Hoi
Exact Soft Confidence-Weighted Learning, Jialei Wang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
In this paper, we propose a new Soft Confidence-Weighted (SCW) online learning scheme, which enables the conventional confidence-weighted learning method to handle non-separable cases. Unlike the previous confidence-weighted learning algorithms, the proposed soft confidence-weighted learning method enjoys all the four salient properties: (i) large margin training, (ii) confidence weighting, (iii) capability to handle non-separable data, and (iv) adaptive margin. Our experimental results show that the proposed SCW algorithms significantly outperform the original CW algorithm. When comparing with a variety of state-of-the art algorithms (including AROW, NAROW and NHERD), we found that SCW generally achieves better or at least comparable predictive …
Fast Bounded Online Gradient Descent Algorithms For Scalable Kernel-Based Online Learning, Peilin Zhao, Jialei Wang, Pengcheng Wu, Rong Jin, Steven C. H. Hoi
Fast Bounded Online Gradient Descent Algorithms For Scalable Kernel-Based Online Learning, Peilin Zhao, Jialei Wang, Pengcheng Wu, Rong Jin, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it non-scalable and unsuitable for applications with large-scale datasets. In this work, we study the problem of bounded kernel-based online learning that aims to constrain the number of support vectors by a predefined budget. Although several algorithms have been proposed in literature, they are neither computationally efficient due to their intensive budget maintenance strategy nor effective due to the use of simple Perceptron algorithm. To overcome these limitations, we propose a …
An Evolutionary Search Paradigm That Learns With Past Experiences, Liang Feng, Yew-Soon Ong, Ivor Tsang, Ah-Hwee Tan
An Evolutionary Search Paradigm That Learns With Past Experiences, Liang Feng, Yew-Soon Ong, Ivor Tsang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
A major drawback of evolutionary optimization approaches in the literature is the apparent lack of automated knowledge transfers and reuse across problems. Particularly, evolutionary optimization methods generally start a search from scratch or ground zero state, independent of how similar the given new problem of interest is to those optimized previously. In this paper, we present a study on the transfer of knowledge in the form of useful structured knowledge or latent patterns that are captured from previous experiences of problem-solving to enhance future evolutionary search. The essential contributions of our present study include the meme learning and meme selection …
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Jason A Bengtson
Current metadata schemas are largely analog technology grafted onto the digital format. They have three inherent limitations that need to be transcended: they generate a static product which must be changed manually, they revolve around the needs of human, rather than mechanistic agents, and they are limited by the imagination and organizational capabilities of human agency. The author argues that to meet future challenges metadata will have to take a more flexible, adaptive form that centers on the needs of the machine in searching, interpretation and organization until the information it proxies enters into the human sphere. The author further …
The Art Of Redirection: Putting Mobile Devices Where You Want Them, Jason A. Bengtson
The Art Of Redirection: Putting Mobile Devices Where You Want Them, Jason A. Bengtson
Jason A Bengtson
Mobile technology has exploded, with many libraries experiencing a surge in access to their resources through mobile devices. In response, many institutions have created or are creating mobile sites designed to accommodate themselves to the unique strictures of these devices. One hurdle faced by these organizations, however, is getting mobile users to those sites. One solution is mobile redirect scripts, which automatically redirect mobile users from a regular page to a mobile page. These scripts come in various forms and present unique challenges to libraries. How are these scripts created? What triggers can or should be used to activate them? …
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Jason A Bengtson
Current metadata schemas are largely analog technology grafted onto the digital format. They have three inherent limitations that need to be transcended: they generate a static product which must be changed manually, they revolve around the needs of human, rather than mechanistic agents, and they are limited by the imagination and organizational capabilities of human agency. The author argues that to meet future challenges metadata will have to take a more flexible, adaptive form that centers on the needs of the machine in searching, interpretation and organization until the information it proxies enters into the human sphere. The author further …
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Intrusion Detection Systems (IDS) have become ubiquitous in the defense against virus outbreaks, malicious exploits of OS vulnerabilities, and botnet proliferation. As attackers frequently rely on host scanning for reconnaissance leading to penetration, IDS is often tasked with detecting scans and preventing them. However, it is currently unknown how likely an IDS is to detect a given Internet-wide scan pattern and whether there exist sufficiently fast scan techniques that can remain virtually undetectable at large-scale. To address these questions, we propose a simple analytical model for the window-expiration rules of popular IDS tools (i.e., Snort and Bro) and utilize a …
On Superposition Of Heterogeneous Edge Processes In Dynamic Random Graphs, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
On Superposition Of Heterogeneous Edge Processes In Dynamic Random Graphs, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
Computer Science Faculty Publications
This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive states, which represent churn behavior of modern distributed systems. We prove that despite heterogeneity of node lifetimes, different initial out-degree, non-Poisson arrival/failure dynamics, and complex spatial and temporal dependency among creation of both initial and replacement edges, a superposition of edge-arrival processes to a live node under uniform selection converges to a Poisson process when system size becomes sufficiently large. Due to the convoluted dependency and non-renewal nature of various point processes, this result significantly …
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Research Collection School Of Computing and Information Systems
Unmanned aerial vehicles (UAVs) rely on global positioning system (GPS) information to ascertain its position for navigation during mission execution. In the absence of GPS information, the capability of a UAV to carry out its intended mission is hindered. In this paper, we learn alternative means for UAVs to derive real-time positional reference information so as to ensure the continuity of the mission. We present extreme learning machine as a mechanism for learning the stored digital elevation information so as to aid UAVs to navigate through terrain without the need for GPS. The proposed algorithm accommodates the need of the …
An Improved K-Nearest-Neighbor Algorithm For Text Categorization, Shengyi Jiang, Guansong Pang, Meiling Wu, Limin Kuang
An Improved K-Nearest-Neighbor Algorithm For Text Categorization, Shengyi Jiang, Guansong Pang, Meiling Wu, Limin Kuang
Research Collection School Of Computing and Information Systems
Text categorization is a significant tool to manage and organize the surging text data. Many text categorization algorithms have been explored in previous literatures, such as KNN, Naive Bayes and Support Vector Machine. KNN text categorization is an effective but less efficient classification method. In this paper, we propose an improved KNN algorithm for text categorization, which builds the classification model by combining constrained one pass clustering algorithm and KNN text categorization. Empirical results on three benchmark corpora show that our algorithm can reduce the text similarity computation substantially and outperform the-state-of-the-art KNN, Naive Bayes and Support Vector Machine classifiers. …