text stringlengths 0 4.09k |
|---|
Abstract: It is difficult to find the optimal sparse solution of a manifold learning based dimensionality reduction algorithm. The lasso or the elastic net penalized manifold learning based dimensionality reduction is not directly a lasso penalized least square problem and thus the least angle regression (LARS) (Efron ... |
Title: A generalized risk approach to path inference based on hidden Markov models |
Abstract: Motivated by the unceasing interest in hidden Markov models (HMMs), this paper re-examines hidden path inference in these models, using primarily a risk-based framework. While the most common maximum a posteriori (MAP), or Viterbi, path estimator and the minimum error, or Posterior Decoder (PD), have long bee... |
Title: A decidable subclass of finitary programs |
Abstract: Answer set programming - the most popular problem solving paradigm based on logic programs - has been recently extended to support uninterpreted function symbols. All of these approaches have some limitation. In this paper we propose a class of programs called FP2 that enjoys a different trade-off between exp... |
Title: Logic Programming for Finding Models in the Logics of Knowledge and its Applications: A Case Study |
Abstract: The logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations in logics of knowledge (e.g., to support multi-agent pla... |
Title: Fast L1-Minimization Algorithms For Robust Face Recognition |
Abstract: L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax. Under certain conditions as described in compressive sensing theory, the minimum L1-norm solution is also the sparsest solution. In this paper, our study addresses the speed and scalability of its algorith... |
Title: Video Event Recognition for Surveillance Applications (VERSA) |
Abstract: VERSA provides a general-purpose framework for defining and recognizing events in live or recorded surveillance video streams. The approach for event recognition in VERSA is using a declarative logic language to define the spatial and temporal relationships that characterize a given event or activity. Doing s... |
Title: Adapting to the Shifting Intent of Search Queries |
Abstract: Search engines today present results that are often oblivious to abrupt shifts in intent. For example, the query `independence day' usually refers to a US holiday, but the intent of this query abruptly changed during the release of a major film by that name. While no studies exactly quantify the magnitude of ... |
Title: Bayesian nonparametric estimation of the spectral density of a long or intermediate memory Gaussian process |
Abstract: A stationary Gaussian process is said to be long-range dependent (resp., anti-persistent) if its spectral density $f(\lambda)$ can be written as $f(\lambda)=|\lambda|^-2dg(|\lambda|)$, where $0<d<1/2$ (resp., $-1/2<d<0$), and $g$ is continuous and positive. We propose a novel Bayesian nonparametric approach f... |
Title: CHR(PRISM)-based Probabilistic Logic Learning |
Abstract: PRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules. In this paper, we introduce a new probabilistic logic formalism, called C... |
Title: Orthogonal multifilters image processing of astronomical images from scanned photographic plates |
Abstract: In this paper orthogonal multifilters for astronomical image processing are presented. We obtained new orthogonal multifilters based on the orthogonal wavelet of Haar and Daubechies. Recently, multiwavelets have been introduced as a more powerful multiscale analysis tool. It adds several degrees of freedom in... |
Title: New Results for the MAP Problem in Bayesian Networks |
Abstract: This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is demonstrated that the problem remains hard even in networks with very ... |
Title: Ear Identification by Fusion of Segmented Slice Regions using Invariant Features: An Experimental Manifold with Dual Fusion Approach |
Abstract: This paper proposes a robust ear identification system which is developed by fusing SIFT features of color segmented slice regions of an ear. The proposed ear identification method makes use of Gaussian mixture model (GMM) to build ear model with mixture of Gaussian using vector quantization algorithm and K-L... |
Title: Quasi-concave density estimation |
Abstract: Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum Renyi entropy estimators that impose weaker concavity restrictions on the... |
Title: Uniform Approximation and Bracketing Properties of VC classes |
Abstract: We show that the sets in a family with finite VC dimension can be uniformly approximated within a given error by a finite partition. Immediate corollaries include the fact that VC classes have finite bracketing numbers, satisfy uniform laws of averages under strong dependence, and exhibit uniform mixing. Our ... |
Title: Loop Formulas for Description Logic Programs |
Abstract: Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description ... |
Title: Support Vector Machines for Additive Models: Consistency and Robustness |
Abstract: Support vector machines (SVMs) are special kernel based methods and belong to the most successful learning methods since more than a decade. SVMs can informally be described as a kind of regularized M-estimators for functions and have demonstrated their usefulness in many complicated real-life problems. Durin... |
Title: Human Daily Activities Indexing in Videos from Wearable Cameras for Monitoring of Patients with Dementia Diseases |
Abstract: Our research focuses on analysing human activities according to a known behaviorist scenario, in case of noisy and high dimensional collected data. The data come from the monitoring of patients with dementia diseases by wearable cameras. We define a structural model of video recordings based on a Hidden Marko... |
Title: Reconstruction of a Low-rank Matrix in the Presence of Gaussian Noise |
Abstract: In this paper we study the problem of reconstruction of a low-rank matrix observed with additive Gaussian noise. First we show that under mild assumptions (about the prior distribution of the signal matrix) we can restrict our attention to reconstruction methods that are based on the singular value decomposit... |
Title: Assessing Characteristic Scales Using Wavelets |
Abstract: Characteristic scale is a notion that pervades the geophysical sciences, but it has no widely accepted precise definition. The wavelet transform decomposes a time series into coefficients that are associated with different scales. The variance of these coefficients can be used to decompose the variance of the... |
Title: A consistent test of independence based on a sign covariance related to Kendall's tau |
Abstract: The most popular ways to test for independence of two ordinal random variables are by means of Kendall's tau and Spearman's rho. However, such tests are not consistent, only having power for alternatives with ``monotonic'' association. In this paper, we introduce a natural extension of Kendall's tau, called $... |
Title: Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems |
Abstract: Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation... |
Title: A decision-theoretic approach for segmental classification |
Abstract: This paper is concerned with statistical methods for the segmental classification of linear sequence data where the task is to segment and classify the data according to an underlying hidden discrete state sequence. Such analysis is commonplace in the empirical sciences including genomics, finance and speech ... |
Title: Cases for the nugget in modeling computer experiments |
Abstract: Most surrogate models for computer experiments are interpolators, and the most common interpolator is a Gaussian process (GP) that deliberately omits a small-scale (measurement) error term called the nugget. The explanation is that computer experiments are, by definition, "deterministic", and so there is no m... |
Title: Elicitation of Weibull priors |
Abstract: Based on expert opinions, informative prior elicitation for the common Weibull lifetime distribution usually presents some difficulties since it requires to elicit a two-dimensional joint prior. We consider here a reliability framework where the available expert information states directly in terms of prior p... |
Title: Detecting influenza outbreaks by analyzing Twitter messages |
Abstract: We analyze over 500 million Twitter messages from an eight month period and find that tracking a small number of flu-related keywords allows us to forecast future influenza rates with high accuracy, obtaining a 95% correlation with national health statistics. We then analyze the robustness of this approach to... |
Title: Formalization of Psychological Knowledge in Answer Set Programming and its Application |
Abstract: In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of knowledge is still expressed using only natural language. This lack of a formalization complicates accurate studies, comparisons, and v... |
Title: Predicting Suicide Attacks: A Fuzzy Soft Set Approach |
Abstract: This paper models a decision support system to predict the occurance of suicide attack in a given collection of cities. The system comprises two parts. First part analyzes and identifies the factors which affect the prediction. Admitting incomplete information and use of linguistic terms by experts, as two ch... |
Title: A Program-Level Approach to Revising Logic Programs under the Answer Set Semantics |
Abstract: An approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is... |
Title: Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks |
Abstract: We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in DeanDup09 that a subsolution to the Isaacs equation guarantees that a subexponential number of fun... |
Title: An Empirical Study of Borda Manipulation |
Abstract: We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions from the bin-packing and multiprocessor scheduling domains. Although w... |
Title: Where are the hard manipulation problems? |
Abstract: One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is increasing concern that such results may not re ect the difficulty of manipulation in practice. In this tutorial, I survey recent ... |
Title: Stable marriage problems with quantitative preferences |
Abstract: The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or... |
Title: An Efficient Automatic Mass Classification Method In Digitized Mammograms Using Artificial Neural Network |
Abstract: In this paper we present an efficient computer aided mass classification method in digitized mammograms using Artificial Neural Network (ANN), which performs benign-malignant classification on region of interest (ROI) that contains mass. One of the major mammographic characteristics for mass classification is... |
Title: Resource-Optimal Planning For An Autonomous Planetary Vehicle |
Abstract: Autonomous planetary vehicles, also known as rovers, are small autonomous vehicles equipped with a variety of sensors used to perform exploration and experiments on a planet's surface. Rovers work in a partially unknown environment, with narrow energy/time/movement constraints and, typically, small computatio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.