Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/63620Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Santi Tasena | en_US |
| dc.date.accessioned | 2019-03-18T02:22:03Z | - |
| dc.date.available | 2019-03-18T02:22:03Z | - |
| dc.date.issued | 2019-04-01 | en_US |
| dc.identifier.issn | 0888613X | en_US |
| dc.identifier.other | 2-s2.0-85061453356 | en_US |
| dc.identifier.other | 10.1016/j.ijar.2019.01.010 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85061453356&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/63620 | - |
| dc.description.abstract | © 2019 Elsevier Inc. In this study, we demonstrate that the problem of characterizing polynomial copula transformations can be reduced to solving a system of (in)equalities. In this case, no knowledge of copulas is necessary to find an instance of such polynomials, or even the whole set of such polynomials. As a demonstration, we employ this result to characterize all quadratic polynomials that define copula transformations. | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Polynomial copula transformations | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | International Journal of Approximate Reasoning | en_US |
| article.volume | 107 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.