期刊論文
| 學年 | 103 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 2014-09-01 |
| 作品名稱 | Resolution dependence of the maximal information coefficient for noiseless relationship |
| 作品名稱（其他語言） | |
| 著者 | Lee, S.-C.; Pang, N.-N.; Tzeng, W.-J. |
| 單位 | 淡江大學物理學系 |
| 出版者 | New York: Springer New York LLC |
| 著錄名稱、卷期、頁數 | Statistics and Computing 24(5), pp.845-852 |
| 摘要 | Reshef et al. (Science 334:1518–1523, 2011) introduce the maximal information coefficient, or MIC, which captures a wide range of relationships between pairs of variables. We derive a useful property which can be employed either to substantially reduce the computer time to determine MIC, or to obtain a series of MIC values for different resolutions. Through studying the dependence of the MIC scores on the maximal resolution, employed to partition the data, we show that relationships of different natures can be discerned more clearly. We also provide an iterative greedy algorithm, as an alternative to the ApproxMaxMI proposed by Reshef et al., to determine the value of MIC through iterative optimization, which can be conducted parallelly. |
| 關鍵字 | Maximal information coefficient;Pearson’s correlation coefficient;Greedy algorithm |
| 語言 | en |
| ISSN | 1573-1375 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | 電子版 紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/100064 ) |