Data association

Xem 1-20 trên 387 kết quả Data association
  • Data fusion is a research area that is growing rapidly due to the fact that it provides means for combining pieces of information coming from different sources/sensors, resulting in ameliorated overall system performance (improved decision making, increased detection capabilities, diminished number of false alarms, improved reliability in various situations at hand) with respect to separate sensors/sources.

    pdf246p crius75 02-01-2013 33 8   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Efficient Data Association in Visual Sensor Networks with Missing Detection

    pdf25p sting05 09-02-2012 24 4   Download

  • Tham khảo sách 'sensor and data fusion_1', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

    pdf0p crius75 02-01-2013 21 4   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article TOA Estimation and Data Association for Through-Wall Tracking of Moving Targets

    pdf11p dauphong14 13-02-2012 18 3   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Impact of the Gaussian Approximation on the Performance of the Probabilistic Data Association MIMO Decoder

    pdf5p sting11 10-03-2012 14 3   Download

  • 4.2.3 MTMF MTMF combines the best parts of the Linear Spectral Mixing model and the statistical Matched Filter model while avoiding the drawbacks of each parent method (Boardman, 1998). It is a useful Matched Filter method without knowing all the possible endmembers in a landscape especially in case of subtle, sub-pixel occurrences. Firstly, pixel spectra and endmember spectra require a minimum noise fraction (MNF) (Green et al., 1988, Boardman, 1993) transformation. MNF reduces and separates an image into its most dimensional and non-noisy components.

    pdf464p lulanphuong 22-03-2012 115 39   Download

  • Java and XML Data Binding Brett McLaughlin Publisher: O'Reilly First Edition May 2002 ISBN: 0-596-00278-5, 214 pages Table of Contents Index Full Description Reviews Reader reviews Errata This new title provides an in-depth technical look at XML Data Binding. The book offers complete documentation of all features in both the Sun Microsystems JAXB API and popular open source alternative implementations (Enhydra Zeus, Exolabs Castor and Quick).

    pdf200p nuoiheocuoivo 04-05-2010 90 19   Download

  • Association rules represent a promising technique to find hidden patterns in a medical data set. The main issue about mining association rules in a medical data set is the large number of rules that are discovered, most of which are irrelevant. Such number of rules makes search slow and interpretation by the domain expert difficult. In this work, search constraints are introduced to find only medically significant association rules and make search more efficient.

    pdf8p lebronjamesuit 23-08-2012 40 6   Download

  • Data warehouses usually have some missing values due to unavailable data that affect the number and the quality of the generated rules. The missing values could affect the coverage percentage and number of reduces generated from a specific data set. Missing values lead to the difficulty of extracting useful information from data set. Association rule algorithms typically only identify patterns that occur in the original form throughout the database.

    pdf6p giacattan 05-01-2013 20 5   Download

  • An estimated 41,000 central line-associated bloodstream infections (CLABSI) occur in U.S. hospitals each year.1 These infections are usually serious infections typically causing a prolongation of hospital stay and increased cost and risk of mortality. CLABSI can be prevented through proper insertion techniques and management of the central line. These techniques are addressed in the CDC’s Healthcare Infection Control Practices Advisory Committee (CDC/HIPAC) Guidelines for the Prevention of Intravascular Catheter-Related Infections, 2011.

    pdf17p giamdocamnhac 06-04-2013 20 5   Download

  • Table 123-1 Relative Sensitivity and Specificity of Diagnostic Tests for Clostridium difficile–Associated Disease (CDAD) Type of Test Relative Sensitivitya Relative Specificitya Comment Stool for C. difficile culture ++++ +++ Most sensitive test; specificity is ++++ if the C.

    pdf5p chubebandiem 14-12-2010 65 4   Download

  • The paper seeks to assess how a major policy regime change – such as the introduction of the currency board in Bulgaria – affects the flow of bank credit to the corporate sector. An attempt is made to identify the determinants of corporate credit separately from the viewpoint of lenders and borrowers. The estimated credit supply and credit demand equations provide empirical evidence of important changes in microeconomic behavioral patterns which can be associated with the policy regime change.

    pdf49p enterroi 01-02-2013 25 4   Download

  • Methods for analysing trauma injury data with missing values, collected at a UK hospital, are reported. One measure of injury severity, the Glasgow coma score, which is known to be associated with patient death, is missing for 12% of patients in the dataset. In order to include these 12% of patients in the analysis, three different data imputation techniques are used to estimate the missing values.

    pdf6p giacattan 05-01-2013 28 3   Download

  • Given a set of transactions, find rules that will predict the occurrence of an item based on the occurrences of other items in the transaction. Given a set of transactions T, the goal of association rule mining is to find all rules having support ≥ minsup threshold confidence ≥ minconf threshold Brute-force approach: List all possible association rules Compute the support and confidence for each rule Prune rules that fail the minsup and minconf thresholds  Computationally prohibitive!...

    ppt82p trinh02 18-01-2013 32 3   Download

  • We are given a list of records. Each recordis associated with a key. We are given one key (target), and are asked to search the list to find the record(s) whose key is the same as the target. May be more than one recordwith the same key. May be no record with a given key.

    pdf28p trinh02 28-01-2013 14 3   Download

  • In shared-nothing database systems, data often needs to be moved whenever there is a join or an aggregation process for which the data requires repartitioning across the segments. As a result, the interconnect serves as one of the most critical components within Greenplum Database. Greenplum’s gNet interconnect (Figure 8m) optimizes the flow of data to allow continuous pipelining of processing without blocking on all nodes of the system.

    pdf6p yasuyidol 02-04-2013 10 3   Download

  • We present a method to discover robust and interpretable sociolinguistic associations from raw geotagged text data. Using aggregate demographic statistics about the authors’ geographic communities, we solve a multi-output regression problem between demographics and lexical frequencies.

    pdf10p hongdo_1 12-04-2013 17 3   Download

  • Large expenses associated with rice production and dependence on energy related inputs like fuel and fertilizer in particular compel rice producers to use management practices that are input efficient and result in least cost. This study uses data envelopment analysis (DEA) to calculate technical efficiency (TE), allocative efficiency (AE), and economic efficiency (EE) for rice production in Arkansas at the field level using data from 137 fields enrolled in the University of Arkansas, Rice Research Verification Program (RRVP) from 2005 to 2011.

    pdf31p tunghai08 28-06-2015 16 3   Download

  • Chapter 2: Data Mining includes about Overview of data mining, Association rules, Classification, Regression, Clustering, Other Data Mining problems, Applications of data mining.

    ppt154p cocacola_10 08-12-2015 5 3   Download

  • We propose methods for estimating the probability that an entity from an entity database is associated with a web search query. Association is modeled using a query entity click graph, blending general query click logs with vertical query click logs. Smoothing techniques are proposed to address the inherent data sparsity in such graphs, including interpolation using a query synonymy model. A large-scale empirical analysis of the smoothing techniques, over a 2-year click graph collected from a commercial search engine, shows significant reductions in modeling error. ...

    pdf10p hongdo_1 12-04-2013 15 2   Download

CHỦ ĐỀ BẠN MUỐN TÌM

Đồng bộ tài khoản