text stringlengths 0 4.09k |
|---|
Title: Using survival curves for comparison of ordinal qualitative data in clinical studies |
Abstract: Background and Objective: The survival-agreement plot was proposed and improved to assess the reliability of a quantitative measure. We propose the use of survival analysis as an alternative non-parametric approach for comparison of ordinal qualitative data. Study Design and Setting: Two case studies were pre... |
Title: Better Global Polynomial Approximation for Image Rectification |
Abstract: When using images to locate objects, there is the problem of correcting for distortion and misalignment in the images. An elegant way of solving this problem is to generate an error correcting function that maps points in an image to their corrected locations. We generate such a function by fitting a polynomi... |
Title: Guarded resolution for answer set programming |
Abstract: We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result. |
Title: Influence diagnostics in Birnbaum-Saunders nonlinear regression models |
Abstract: We consider the issue of assessing influence of observations in the class of Birnbaum-Saunders nonlinear regression models, which is useful in lifetime data analysis. Our results generalize those in Galea et al. [2004, Influence diagnostics in log-Birnbaum-Saunders regression models. Journal of Applied Statis... |
Title: On the Peaking Phenomenon of the Lasso in Model Selection |
Abstract: I briefly report on some unexpected results that I obtained when optimizing the model parameters of the Lasso. In simulations with varying observations-to-variables ratio n=p, I typically observe a strong peak in the test error curve at the transition point n/p = 1. This peaking phenomenon is well-documented ... |
Title: Limits of Learning about a Categorical Latent Variable under Prior Near-Ignorance |
Abstract: In this paper, we consider the coherent theory of (epistemic) uncertainty of Walley, in which beliefs are represented through sets of probability distributions, and we focus on the problem of modeling prior ignorance about a categorical random variable. In this setting, it is a known result that a state of pr... |
Title: Adaptive Learning with Binary Neurons |
Abstract: A efficient incremental learning algorithm for classification tasks, called NetLines, well adapted for both binary and real-valued input patterns is presented. It generates small compact feedforward neural networks with one hidden layer of binary units and binary output units. A convergence theorem ensures th... |
Title: Temporal data mining for root-cause analysis of machine faults in automotive assembly lines |
Abstract: Engine assembly is a complex and heavily automated distributed-control process, with large amounts of faults data logged everyday. We describe an application of temporal data mining for analyzing fault logs in an engine assembly plant. Frequent episode discovery framework is a model-free method that can be us... |
Title: Quality Classifiers for Open Source Software Repositories |
Abstract: Open Source Software (OSS) often relies on large repositories, like SourceForge, for initial incubation. The OSS repositories offer a large variety of meta-data providing interesting information about projects and their success. In this paper we propose a data mining approach for training classifiers on the O... |
Title: Continuous Strategy Replicator Dynamics for Multi--Agent Learning |
Abstract: The problem of multi-agent learning and adaptation has attracted a great deal of attention in recent years. It has been suggested that the dynamics of multi agent learning can be studied using replicator equations from population biology. Most existing studies so far have been limited to discrete strategy spa... |
Title: Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms |
Abstract: This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract representation of these constraint atoms in which a constraint atom is represented compactly. We show two applications. First, under this representation of co... |
Title: Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation |
Abstract: This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via $\ell_1$-minimisation. The problem can also be seen as factorising a $\ddim \times \nsig$ matrix $Y=(y_1 >... y_\nsig), y_n\in \R^\ddim$ of training signals into a $\ddim \times \natoms$ dic... |
Title: FaceBots: Steps Towards Enhanced Long-Term Human-Robot Interaction by Utilizing and Publishing Online Social Information |
Abstract: Our project aims at supporting the creation of sustainable and meaningful longer-term human-robot relationships through the creation of embodied robots with face recognition and natural language dialogue capabilities, which exploit and publish social information available on the web (Facebook). Our main under... |
Title: Classification and categorical inputs with treed Gaussian process models |
Abstract: Recognizing the successes of treed Gaussian process (TGP) models as an interpretable and thrifty model for nonparametric regression, we seek to extend the model to classification. Both treed models and Gaussian processes (GPs) have, separately, enjoyed great success in application to classification problems. ... |
Title: Correspondence: The use of cost information when defining critical values for prediction of rare events using logistic regression and similar methods |
Abstract: Balancing a rare and serious possibility against a more common and less serious one is a familiar problem in many situations, such as the prediction of rare diseases. The relative costs of forecasting errors can be used for any prediction method that gives an estimated probability of a future event. The proba... |
Title: Fuzzy Mnesors |
Abstract: A fuzzy mnesor space is a semimodule over the positive real numbers. It can be used as theoretical framework for fuzzy sets. Hence we can prove a great number of properties for fuzzy sets without refering to the membership functions. |
Title: An Application of Proof-Theory in Answer Set Programming |
Abstract: We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of logic programs (without referring to loop formulas. |
Title: Gaussian Belief with dynamic data and in dynamic network |
Abstract: In this paper we analyse Belief Propagation over a Gaussian model in a dynamic environment. Recently, this has been proposed as a method to average local measurement values by a distributed protocol ("Consensus Propagation", Moallemi & Van Roy, 2006), where the average is available for read-out at every singl... |
Title: Nonparametric Covariate Adjustment for Receiver Operating Characteristic Curves |
Abstract: The accuracy of a diagnostic test is typically characterised using the receiver operating characteristic (ROC) curve. Summarising indexes such as the area under the ROC curve (AUC) are used to compare different tests as well as to measure the difference between two populations. Often additional information is... |
Title: Regularized estimation of large-scale gene association networks using graphical Gaussian models |
Abstract: Graphical Gaussian models are popular tools for the estimation of (undirected) gene association networks from microarray data. A key issue when the number of variables greatly exceeds the number of samples is the estimation of the matrix of partial correlations. Since the (Moore-Penrose) inverse of the sample... |
Title: Small-sample corrections for score tests in Birnbaum-Saunders regressions |
Abstract: In this paper we deal with the issue of performing accurate small-sample inference in the Birnbaum-Saunders regression model, which can be useful for modeling lifetime or reliability data. We derive a Bartlett-type correction for the score test and numerically compare the corrected test with the usual score t... |
Title: Feasibility of random basis function approximators for modeling and control |
Abstract: We discuss the role of random basis function approximators in modeling and control. We analyze the published work on random basis function approximators and demonstrate that their favorable error rate of convergence O(1/n) is guaranteed only with very substantial computational resources. We also discuss impli... |
Title: A FORTRAN coded regular expression Compiler for IBM 1130 Computing System |
Abstract: REC (Regular Expression Compiler) is a concise programming language which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes an interpreter of REC written... |
Title: Soft Motion Trajectory Planner for Service Manipulator Robot |
Abstract: Human interaction introduces two main constraints: Safety and Comfort. Therefore service robot manipulator can't be controlled like industrial robotic manipulator where personnel is isolated from the robot's work envelope. In this paper, we present a soft motion trajectory planner to try to ensure that these ... |
Title: A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures |
Abstract: The problem of maximum-likelihood (ML) estimation of discrete tree-structured distributions is considered. Chow and Liu established that ML-estimation reduces to the construction of a maximum-weight spanning tree using the empirical mutual information quantities as the edge weights. Using the theory of large-... |
Title: Statistical Automatic Summarization in Organic Chemistry |
Abstract: We present an oriented numerical summarizer algorithm, applied to producing automatic summaries of scientific documents in Organic Chemistry. We present its implementation named Yachs (Yet Another Chemistry Summarizer) that combines a specific document pre-processing with a sentence scoring method relying on ... |
Title: The Modular Audio Recognition Framework (MARF) and its Applications: Scientific and Software Engineering Notes |
Abstract: MARF is an open-source research platform and a collection of voice/sound/speech/text and natural language processing (NLP) algorithms written in Java and arranged into a modular and extensible framework facilitating addition of new algorithms. MARF can run distributively over the network and may act as a libr... |
Title: Auditing a collection of races simultaneously |
Abstract: A collection of races in a single election can be audited as a group by auditing a random sample of batches of ballots and combining observed discrepancies in the races represented in those batches in a particular way: the maximum across-race relative overstatement of pairwise margins (MARROP). A risk-limitin... |
Title: Concept Stability for Constructing Taxonomies of Web-site Users |
Abstract: Owners of a web-site are often interested in analysis of groups of users of their site. Information on these groups can help optimizing the structure and contents of the site. In this paper we use an approach based on formal concepts for constructing taxonomies of user groups. For decreasing the huge amount o... |
Title: Locally most powerful sequential tests of a simple hypothesis vs one-sided alternatives |
Abstract: Let $X_1,X_2,...$ be a discrete-time stochastic process with a distribution $P_\theta$, $\theta\in\Theta$, where $\Theta$ is an open subset of the real line. We consider the problem of testing a simple hypothesis $H_0:$ $\theta=\theta_0$ versus a composite alternative $H_1:$ $\theta>\theta_0$, where $\theta_0... |
Title: Supplementary material for Markov equivalence for ancestral graphs |
Abstract: We prove that the criterion for Markov equivalence provided by Zhao et al. (2005) may involve a set of features of a graph that is exponential in the number of vertices. |
Title: Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit |
Abstract: Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic variant of the well-studied matrix completion problem, and the main ob... |
Title: Acquisition of morphological families and derivational series from a machine readable dictionary |
Abstract: The paper presents a linguistic and computational model aiming at making the morphological structure of the lexicon emerge from the formal and semantic regularities of the words it contains. The model is word-based. The proposed morphological structure consists of (1) binary relations that connect each headwo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.