Results 11 to 20 of about 30,482 (307)
Identifiability implies robust identifiability
In identification from a deterministic point of view an algorithm is said to be robustly convergent if the true system is regained when the noise level tends to zero. In this paper we introduce a concept close to this performance measure: robust global identifiability. A model structure, i.e.
L. Ljung, T. Glad, T. Andersson
openaire +3 more sources
Identifying the components [PDF]
Most, if not all, databases are mixtures of samples from different distributions. Transactional data is no exception. For the prototypical example, supermarket basket analysis, one also expects a mixture of different buying patterns. Households of retired people buy different collections of items than households with young children.
Matthijs van Leeuwen +2 more
openaire +4 more sources
Reply to determining structural identifiability of parameter learning machines [PDF]
The paper Ran and Hu (2014, Neurocomputing) examines identifiability and parameter redundancy in classes of models used in machine learning. This note discusses the results on global identifiability and also clarifies that the paper's results on ...
Cole, Diana J.
core +1 more source
Identifiability of a Binomial Synapse [PDF]
Synapses are highly stochastic transmission units. A classical model describing this stochastic transmission is called the binomial model, and its underlying parameters can be estimated from postsynaptic responses to evoked stimuli.
Pfister, Jean-Pascal, Gontier, Camille
core +2 more sources
Real identifiability vs. complex identifiability [PDF]
Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$. This behavior is quite peculiar when the rank $r$ is submaximal.
Angelini, Elena +2 more
openaire +3 more sources
Internet Identifiability and Beyond: A Model of the Effects of Identifiability on Communicative Behavior [PDF]
K.M. Douglas and C. McGarty (in press) demonstrated that being identifiable to an ingroup audience in a computer-mediated communication (CMC) setting leads people to describe anonymous outgroup targets in more abstract, or stereotypical ways.
McGarty, Craig +5 more
core +1 more source
Identifiability and self-presentation: Computer-mediated communication and intergroup interaction [PDF]
This research investigated the intergroup properties of hostile 'flaming' behaviour in computer-mediated communication and how flaming language is affected by Internet identifiability, or identifiability by name and e-mail address/geographical location ...
McGarty, Craig +3 more
core +1 more source
Parameter Identifiability and Redundancy in a General Class of Stochastic Carcinogenesis Models [PDF]
Background Heidenreich et al. (Risk Anal 1997 17 391–399) considered parameter identifiability in the context of the two-mutation cancer model and demonstrated that combinations of all but two of the model parameters are identifiable.
Wolfgang F Heidenreich +11 more
core +2 more sources
Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a neighborhood of a solution. We study this issue in the more general setting of composite nonsmooth minimization, in
Adrian S. Lewis, Stephen J. Wright 0001
openaire +4 more sources
Identifying Sorting - In Theory [PDF]
Assortative Matching between workers and rms provides evidence of the complementarities or substitutes in production. The presence of complementarities is important for policies that aim to achieve the optimal allocation of resources, for example unemployment insurance. We argue that using wage data alone, it is virtually impossible to identify whether
Jan Eeckhout, Philipp Kircher
openaire +7 more sources

