Using the EM Algorithm with Complete, but Scrambled, data
In this paper the EM algorithm, which has been used successfully with censored and incomplete data sets, is adapted to the problem of scrambled data. The performance of the method is assayed using an artificially constructed data set. The relevance of the results for a real world labour market problem is explored.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1996|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.buseco.monash.edu.au/depts/ebs/Email:
More information through EDIRC
|Order Information:|| Web: http://www.buseco.monash.edu.au/depts/ebs/pubs/wpapers/ Email: |
When requesting a correction, please mention this item's handle: RePEc:msh:ebswps:1996-5. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Simone Grose)
If references are entirely missing, you can add them using this form.