Search results for "Inference"

Computation Cluster Validation in the Big Data Era

2017

Data-driven class discovery, i.e., the inference of cluster structure in a dataset, is a fundamental task in Data Analysis, in particular for the Life Sciences. We provide a tutorial on the most common approaches used for that task, focusing on methodologies for the prediction of the number of clusters in a dataset. Although the methods that we present are general in terms of the data for which they can be used, we offer a case study relevant for Microarray Data Analysis.

Channel selection in Cognitive Radio Networks: A Switchable Bayesian Learning Automata approach

2013

We consider the problem of a user operating within a Cognitive Radio Network (CRN) which involves N channels each associated with a Primary User (PU). The problem consists of allocating a channel which, at any given time instant is not being used by a PU, to a Secondary User (SU). Within our study, we assume that a SU is allowed to perform “channel switching”, i.e., to choose an alternate channel S times (where S +1 ≤ N) if the previous choice does not lead to a channel which is vacant. The paper first presents a formal probabilistic model for the problem itself, referred to as the Formal Secondary Channel Selection (FSCS) problem, and the characteristics of the FSCS are then analyzed. Ther…

Learning with belief levels

2008

AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.

On the inductive inference of recursive real-valued functions

1999

AbstractWe combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions.

Using an Adaptive Network-based Fuzzy Inference System to Estimate the Vertical Force in Single Point Incremental Forming

2019

Manufacturing processes are usually complex ones, involving a significant number of parameters. Unconventional manufacturing processes, such as incremental forming is even more complex, and the establishment of some analytical relationships between parameters is difficult, largely due to the nonlinearities in the process. To overcome this drawback, artificial intelligence techniques were used to build empirical models from experimental data sets acquired from the manufacturing processes. The approach proposed in this work used an adaptive network-based fuzzy inference system to extract the value of technological force on Z-axis, which appears during incremental forming, considering a set of…

Unreliable predictions about COVID‐19 infections and hospitalizations make people worry: The case of Italy

2021

Topology Inference and Signal Representation Using Dictionary Learning

2019

This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…

Introducing implicit learning: from the laboratory to the real life

2010

The dissociation between implicit and explicit cognition has a long history in psychology. As early as 1920, Clark Hull (25) investigated the learning of Chinese ideographs and identified the process of concept formation by abstraction of common elements, a process that occurs without explicit knowledge from the subjects of these regularities. Perceptual learning is another example of those processes that take place largely in the absence of awareness of the rules that govern the stimulations of the environment. Helmholtz (24) was one of the first to refer to implicit inference made by the perceptual system and to perceptual learning. Some years later, the distinction between implicit and e…

Bayesian inference in Markovian queues

1994

This paper is concerned with the Bayesian analysis of general queues with Poisson input and exponential service times. Joint posterior distribution of the arrival rate and the individual service rate is obtained from a sample consisting inn observations of the interarrival process andm complete service times. Posterior distribution of traffic intensity inM/M/c is also obtained and the statistical analysis of the ergodic condition from a decision point of view is discussed.

Efficient linear fusion of partial estimators

2018

Abstract Many signal processing applications require performing statistical inference on large datasets, where computational and/or memory restrictions become an issue. In this big data setting, computing an exact global centralized estimator is often either unfeasible or impractical. Hence, several authors have considered distributed inference approaches, where the data are divided among multiple workers (cores, machines or a combination of both). The computations are then performed in parallel and the resulting partial estimators are finally combined to approximate the intractable global estimator. In this paper, we focus on the scenario where no communication exists among the workers, de…