Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||The modified MEXICO for ICA over finite fields|
|Abstract:||In 2007, a theory of ICA over finite fields emerged and an algorithm based on pairwise comparison of mixtures, called MEXICO, was developed to deal with this new problem. In this letter, we propose improvements in the method that, according to simulations in GF(2) and GF(3) scenarios, lead to a faster convergence and better separation results, increasing the application possibilities of the new theory in the context of large databases. (c) 2013 Elsevier B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.