Research and Markets, the largest resource for market research information in world providing essential market research reports, industry research, industry analysis, forecasts, market studies, company profiles and country reports.
Welcome - Register - Login - Help/FAQ - 0 items View Basket
Worlds Largest Market Research Resource - 1516374 Live Reports
Search Research and Markets
  Search
Enter keywords, a title or
a report id number below.





Advanced   
Company search
Register for free email updates of market research
Currency
  Select a currency for use throughout the site



Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure
Hard CopyAdd to Basket
Live Chat Live Help Software for Website

THE HOTELLING'S TWO-SAMPLE T2 ALGORITHM. Edition No. 1

VDM Publishing House, Sep 2010, Pages: 80


  Description  
   Authors   
    
    
    
     
  Enquire before Buying   
  Send to a Friend   

Matching algorithms or classifiers determine if a previously enrolled instance matches an observed instance based on some rules. They return a decision, which consists of three possible answers: match, non-match, and unclassified. A classifier assigns a class label to a sample and then checks the new instance with a sample one. Or, the classifier is trained with example instances so that it learns what class label should be applied to future unknown instances. Classifiers are based on statistical, probabilistic, and decision rules. In applying classifiers, the most important issue is finding the matching rates. Two important rates are the false acceptance rate (FAR) and the false rejection rate (FRR). In this work, we determine the FAR and FRR for the Hotelling's two-sample T2 algorithm applied to the application of matching electronic fingerprints of radio frequency identification (RFID) tags in the presence of simulated noise. The algorithm is found to be a robust classifier for this application.



For enquiries please call us on:
  +353-1-415-1241 (GMT Office Hours)
  1-917-300-0470 (EST Office Hours)

   All rights reserved. © Copyright 2012 Research and Markets
   Terms and conditions Privacy Policy Publishers Employment Opportunities Site Map Link to us Webmaster Affiliate Network


Research and Markets RSS Feeds