Results 211 to 220 of about 4,384,782 (245)
Some of the next articles are maybe not open access.
Energy Association Filter for Online Data Association with Missing Data
2008Data association problem is of crucial importance to improve online object tracking performance in many difficult visual environments. Usually, association effectiveness is based on prior information and observation category. However, some problems can arise when objects are quite similar.
El Abed, Abir +2 more
openaire +1 more source
Data association with ambiguous measurements
2008 American Control Conference, 2008We address the problem of tracking a single object in the neighborhood of several other closely spaced, similar objects where the sensor used to do the tracking may randomly measure the wrong object. Unlike many tracking scenarios, there is no other environmental clutter producing additional erroneous measurements.
Matthew J. Travers +2 more
openaire +2 more sources
Associative Classifier for Uncertain Data
2010Associative classifiers are relatively easy for people to understand and often outperform decision tree learners on many classification problems. Existing associative classifiers only work with certain data. However, data uncertainty is prevalent in many real-world applications such as sensor network, market analysis and medical diagnosis.
Xiangju Qin +3 more
openaire +3 more sources
A measure of association for complex data
Computational Statistics & Data Analysis, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seung-Chun Lee, Moon Yul Huh
openaire +2 more sources
Discovering associations in XML data
Proceedings of the Third International Conference on Web Information Systems Engineering (Workshops), 2002., 2005Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items.In fact, the working assumption of the present study is that frequent sub-trees of XML data represent sets of tags (objects) that aremeaningfully associated. A method for extracting frequent sub-trees from XML data is presented.
Amnon Meisels, Michael Orlov, Tal Maor
openaire +2 more sources
Associative Classifier for Evidential Data
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), 2020Associative classifiers are a family of classification techniques that use association rules to classify a new instance. Many works were proposed in this context, with a focus on how to select and combine the relevant association rules for classification. However, most of them do not consider the imperfection of data.
Nassim Bahri +2 more
openaire +2 more sources
Impulse optimization for data association
49th IEEE Conference on Decision and Control (CDC), 2010This paper presents a new method that addresses measurement origin uncertainty. Measurement origin uncertainty occurs when the object a measurement originated from is not clear. The systems considered contain multiple bodies which are dynamically indistinguishable other than initial conditions.
Matthew J. Travers +2 more
openaire +2 more sources
Integrated probabilistic data association
IEEE Transactions on Automatic Control, 1994Summary: The authors present an integrated probabilistic data association algorithm which provides recursive formulas for both data association and track quality (probability of track existence), allowing track initiation and track termination to be fully integrated into the association and smoothing algorithm. Integrated probabilistic data association
Darko Musicki +2 more
openaire +1 more source
Combinatorial Data Analysis: Association and Partial Association
Psychometrika, 1985A combinatorial data analysis strategy is reviewed that is designed to compare two arbitrary measures of proximity defined between the objects from some set. Based on a particular cross-product definition of correspondence between these two numerically specified notions of proximity (typically represented in the form of matrices), extensions are then ...
openaire +2 more sources
On data structures in associative memories
ACM SIGPLAN Notices, 1971This report discusses the capability of an associative memory to search some useful data bases. The report utilizes a simplified cell and a collection of "assembler language" instructions to show how sets and trees can be searched in the memory. An OR rail and an EXCLUSIVE OR rail are discussed in relation to their use to search ordered and unordered ...
openaire +2 more sources