Results 1  10
of
1,142
A GENERALIZATION OF THE DEMPSTERSHAFER THEORY
"... The DempsterShafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets of a set which represents a hypothesis space. This power set along with the set operations is a Boolean algebra. Can we ..."
Abstract
 Add to MetaCart
be enhanced. In a previous paper we generalized the DempsterShafer orthogonal sum operation to support practical evidence pooling. In the present paper we provide the theoretical underpinning of that procedure, by systematically considering familiar evidential functions in turn. For each we present a &
Database Mining in Spatial Databases
"... The past few years has seen an explosion in the amount of data stored in databases. Apart from textual data, there has been an increase in the amount of pictorial information being stored on computers. Within this data is a lot of implicit, potentially useful information that cannot be extracted man ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
mining in relational databases based on evidential theory [ANAN93] is extended to incorporate spatial discovery. We discuss the role of the DempsterShafer orthogonal sum combination rule in such a framework. Keywords : Database Mining, Spatial Reasoning, Evidential Theory, DempsterShafer Orthogonal Sum
Aspects of Uncertainty Handling for Knowledge Discovery in Databases
 University of Ulster
, 1994
"... In this paper we discuss the role of uncertainty in Knowledge Discovery in Databases (KDD) and discuss the applicability of Evidence Theory towards achieving the goal of handling the uncertainty successfully, incorporating it into the discovery process. We claim that Evidence Theory is more su ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
the DempsterShafer Orthogonal Sum. 1. Introduction Uncertainty Handling has been an impo...
Sensor Fusion Using DempsterShafer Theory
 in Proceedings of IEEE Instrumentation and Measurement Technology Conference
, 2002
"... Contextsensing for contextaware HCI challenges the traditional sensor fusion methods with dynamic sensor configuration and measurement requirements commensurate with human perception. The DempsterShafer theory of evidence has uncertainty management and inference mechanisms analogous to our human ..."
Abstract

Cited by 74 (2 self)
 Add to MetaCart
between DempsterShafer theory and the classical Bayesian method, describes our sensor fusion research work using DempsterShafer theory in comparison with the weighted sum of probability method. The experimental approach is to track a user's focus of attention from multiple cues. Our experiments
DempsterShafer clustering using Potts spin mean field theory
 Soft Computing
, 2001
"... In this article we investigate a problem within DempsterShafer theory where 2^q  1 pieces of evidence are clustered into q clusters by minimizing a metaconflict function, or equivalently, by minimizing the sum of weight of conflict over all dusters. Previously one of us developed a method based on ..."
Abstract

Cited by 18 (14 self)
 Add to MetaCart
In this article we investigate a problem within DempsterShafer theory where 2^q  1 pieces of evidence are clustered into q clusters by minimizing a metaconflict function, or equivalently, by minimizing the sum of weight of conflict over all dusters. Previously one of us developed a method based
Multiclassifiers Neural Network Fusion versus DempsterShafer's orthogonal rule
, 1995
"... This paper describes a system managing data fusion in the Pattern Recognition (PR) field. The problem is seen from the multi decisional points of view. Several modules classification specialized on specific features subspaces allow the cooperation of different classification techniques. The use of ..."
Abstract
 Add to MetaCart
of neural network for heteregenous, incomplete and noised data fusion permits to specify the fusion module for a given application. Experiments are compared with fusion performed by the DempsterShafer's orthogonal rule, proving the performances of such a system. 1. Introduction Real world problems
Orthogonal
"... polynomials with respect to the sum of an arbitrary measure and a Bernstein–Szegö measure ..."
Abstract
 Add to MetaCart
polynomials with respect to the sum of an arbitrary measure and a Bernstein–Szegö measure
The Convex Geometry of Linear Inverse Problems
, 2010
"... In applications throughout science and engineering one is often faced with the challenge of solving an illposed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However in many practical situations of interest, models are constr ..."
Abstract

Cited by 189 (20 self)
 Add to MetaCart
including sums of a few permutations matrices (e.g., ranked elections, multiobject tracking), lowrank tensors (e.g., computer vision, neuroscience), orthogonal matrices (e.g., machine learning), and atomic measures (e.g., system identification). The convex programming formulation is based on minimizing
On The Spectra Of Sums Of Orthogonal Projections With Applications To Parallel Computing
, 1991
"... Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while the c ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while
SUMS OF SQUARES AND ORTHOGONAL INTEGRAL VECTORS
"... Abstract. Two vectors in Z 3 are called twins if they are orthogonal and have the same length. The paper describes twin pairs using cubic lattices, and counts the number of twin pairs with a given length. Integers M with the property that each integral vector with length √ M has a twin are character ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Two vectors in Z 3 are called twins if they are orthogonal and have the same length. The paper describes twin pairs using cubic lattices, and counts the number of twin pairs with a given length. Integers M with the property that each integral vector with length √ M has a twin
Results 1  10
of
1,142