메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2944-2950

Blind identification of sparse dynamic networks and applications

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; DYNAMICAL SYSTEMS; TIME SERIES;

EID: 84860666016     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6161088     Document Type: Conference Paper
Times cited : (17)

References (17)
  • 1
    • 0000351727 scopus 로고
    • Investigating causal relations by econometric models and cross-spectral methods
    • C. W. J. Granger, "Investigating causal relations by econometric models and cross-spectral methods," Econometrica, pp. 424-438l, 1969.
    • (1969) Econometrica
    • Granger, C.W.J.1
  • 2
    • 33645155841 scopus 로고    scopus 로고
    • Granger-causality and path diagrams for multivariate time series
    • M. Eichler, "Granger-causality and path diagrams for multivariate time series," Journal of Econometrics, 2002.
    • (2002) Journal of Econometrics
    • Eichler, M.1
  • 4
    • 77955407850 scopus 로고    scopus 로고
    • Topological identification in networks of dynamical systems
    • D. Materassi and G. Innocenti, "Topological identification in networks of dynamical systems," IEEE Trans. Aut. Contr., pp. 1860-1871, 2010.
    • (2010) IEEE Trans. Aut. Contr. , pp. 1860-1871
    • Materassi, D.1    Innocenti, G.2
  • 7
    • 33144483155 scopus 로고    scopus 로고
    • Stable recovery of sparse overcomplete representations in the presence of noise
    • D. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Th., 52, (1), pp. 6-18, 2006.
    • (2006) IEEE Trans. Inf. Th. , vol.52 , Issue.1 , pp. 6-18
    • Donoho, D.1    Elad, M.2    Temlyakov, V.3
  • 8
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • J. Tropp, "Just relax: convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Th., 52, (3), pp. 1030-1051, 2006.
    • (2006) IEEE Trans. Inf. Th. , vol.52 , Issue.3 , pp. 1030-1051
    • Tropp, J.1
  • 9
    • 46449093079 scopus 로고    scopus 로고
    • Determining interconnections in chemical reaction networks
    • A. Papachristodoulou and B. Recht, "Determining interconnections in chemical reaction networks," in Proc. 2007 ACC, pp. 4872-4877.
    • Proc. 2007 ACC , pp. 4872-4877
    • Papachristodoulou, A.1    Recht, B.2
  • 10
    • 52449097533 scopus 로고    scopus 로고
    • Identification of stable genetic networks using convex programming
    • M. M. Zavlanos, A. A. Julius, and S. P. Boyd, "Identification of stable genetic networks using convex programming," in Proc. 2008 ACC.
    • Proc. 2008 ACC
    • Zavlanos, M.M.1    Julius, A.A.2    Boyd, S.P.3
  • 11
    • 33645035051 scopus 로고    scopus 로고
    • Model selection and estimation in regression with grouped variables
    • M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables." Journal of the Royal Statistical Society Series B, vol. 68, no. 1, pp. 49-67, 2006.
    • (2006) Journal of the Royal Statistical Society Series B , vol.68 , Issue.1 , pp. 49-67
    • Yuan, M.1    Lin, Y.2
  • 12
    • 84860685225 scopus 로고    scopus 로고
    • Sparse causal discovery in multivariate time series
    • S. Haufe, G. Nolte, K. R. Muller, and N. Kramer, "Sparse causal discovery in multivariate time series," in NIPS, 2009.
    • (2009) NIPS
    • Haufe, S.1    Nolte, G.2    Muller, K.R.3    Kramer, N.4
  • 13
    • 77950795074 scopus 로고    scopus 로고
    • Reduced complexity models in identification of dynamical networks: Links with sparsification problems
    • D. Materassi, G. Innocenti, and L. Giarre, "Reduced complexity models in identification of dynamical networks: Links with sparsification problems," in 48th IEEE CDC, 2009, pp. 4796-4801.
    • (2009) 48th IEEE CDC , pp. 4796-4801
    • Materassi, D.1    Innocenti, G.2    Giarre, L.3
  • 15
    • 34547537238 scopus 로고    scopus 로고
    • Interior-point algorithms for sum-of-squares optimization of multidimensional trigonometric polynomials
    • T. Roh, B. Dumitrescu, and L. Vandenberghe, "Interior-point algorithms for sum-of-squares optimization of multidimensional trigonometric polynomials," in Proc ICASSP 2007, pp. III-905-III-908.
    • (2007) Proc ICASSP
    • Roh, T.1    Dumitrescu, B.2    Vandenberghe, L.3
  • 16
    • 63049128934 scopus 로고    scopus 로고
    • A yeast synthetic network for in vivo assessment of reverse-engineering and modeling approaches
    • I. Cantone, L. Marucci, F. Iorio, M. A. Ricci, V. Belcastro, M. Bansal, S. Santini, M. Di Bernardo, D. Di Bernardo, and M. P. Cosma, "A yeast synthetic network for in vivo assessment of reverse-engineering and modeling approaches." Cell, vol. 137, no. 1, pp. 172-181, 2009. [Online]. Available: http://www.ncbi.nlm.nih.gov/pubmed/19327819
    • (2009) Cell , vol.137 , Issue.1 , pp. 172-181
    • Cantone, I.1    Marucci, L.2    Iorio, F.3    Ricci, M.A.4    Belcastro, V.5    Bansal, M.6    Santini, S.7    Di Bernardo, M.8    Di Bernardo, D.9    Cosma, M.P.10


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.