메뉴 건너뛰기




Volumn 60, Issue 4, 2012, Pages 1571-1584

Robust nonparametric regression via sparsity control with application to load curve data cleansing

Author keywords

Lasso; load curve cleansing; nonparametric regression; outlier rejection; sparsity; splines

Indexed keywords

LASSO; LOAD CURVES; NONPARAMETRIC REGRESSION; OUTLIER REJECTION; SPARSITY;

EID: 84858326764     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2181837     Document Type: Article
Times cited : (44)

References (50)
  • 1
    • 84858308273 scopus 로고    scopus 로고
    • Act of the Publ. L. No. 110-140, H.R. 6, Energy Independence and Security Act of 2007 Dec. 2007 [Online]. Available
    • U.S. Congress, Act of the Publ. L. No. 110-140, H.R. 6, Energy Independence and Security Act of 2007 Dec. 2007 [Online]. Available: http://www.gpo.gov/fdsys/pkg/PLAW-110publ140/content- detail.html
    • U.S. Congress1
  • 2
    • 84858309841 scopus 로고    scopus 로고
    • The Smart Grid: An Introduction United States Department of Energy, Office of Electricity Delivery and Energy Reliability, Jan. 2010 [Online]. Available
    • The Smart Grid: An Introduction United States Department of Energy, Office of Electricity Delivery and Energy Reliability, Jan. 2010 [Online]. Available: http://www.oe.energy.gov/1165.htm
  • 3
    • 77949720368 scopus 로고    scopus 로고
    • Dynamic updating for l1 minimization
    • M. S. Asif and J. Romberg, "Dynamic updating for l1 minimization," IEEE Sel. Topics Signal Process., vol. 4, no. 2, pp. 421-434, 2010.
    • (2010) IEEE Sel. Topics Signal Process. , vol.4 , Issue.2 , pp. 421-434
    • Asif, M.S.1    Romberg, J.2
  • 5
    • 46749134483 scopus 로고    scopus 로고
    • Highly robust error correction by convex programming
    • E. J. Candes and P. A. Randall, "Highly robust error correction by convex programming," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2829-2840, 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.7 , pp. 2829-2840
    • Candes, E.J.1    Randall, P.A.2
  • 6
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 7
    • 57349174008 scopus 로고    scopus 로고
    • Enhancing sparsity by reweighted minimzation
    • Dec
    • E. J. Candes, M. B. Wakin, and S. Boyd, "Enhancing sparsity by reweighted minimzation," J. Fourier Anal. Appl., vol. 14, pp. 877-905, Dec. 2008.
    • (2008) J. Fourier Anal. Appl. , vol.14 , pp. 877-905
    • Candes, E.J.1    Wakin, M.B.2    Boyd, S.3
  • 8
    • 77956062338 scopus 로고    scopus 로고
    • Automated load curve data cleansing in power systems
    • Sep
    • J. Chen, W. Li, A. Lau, J. Cao, and K. Eang, "Automated load curve data cleansing in power systems," IEEE Trans. Smart Grid, vol. 1, pp. 213-221, Sep. 2010.
    • (2010) IEEE Trans. Smart Grid , vol.1 , pp. 213-221
    • Chen, J.1    Li, W.2    Lau, A.3    Cao, J.4    Eang, K.5
  • 10
    • 0036856978 scopus 로고    scopus 로고
    • Robust support vector regression networks for function approximation with outliers
    • Jun
    • C. C. Chuang, S. F. Fu, J. T. Jeng, and C. C. Hsiao, "Robust support vector regression networks for function approximation with outliers," IEEE Trans. Neural Netw., vol. 13, pp. 1322-1330, Jun. 2002.
    • (2002) IEEE Trans. Neural Netw. , vol.13 , pp. 1322-1330
    • Chuang, C.C.1    Fu, S.F.2    Jeng, J.T.3    Hsiao, C.C.4
  • 11
    • 0000128671 scopus 로고
    • Asymptotics for M-type smoothing splines
    • D. D. Cox, "Asymptotics for M-type smoothing splines," Ann. Stat., vol. 11, pp. 530-551, 1983.
    • (1983) Ann. Stat. , vol.11 , pp. 530-551
    • Cox, D.D.1
  • 14
    • 0034419669 scopus 로고    scopus 로고
    • Regularization networks and support vectormachines
    • T. Evgeniou, M. Pontil, and T. Poggio, "Regularization networks and support vectormachines," Adv. Comput.Math., vol. 13, pp. 1-50, 2000.
    • (2000) Adv. Comput.Math. , vol.13 , pp. 1-50
    • Evgeniou, T.1    Pontil, M.2    Poggio, T.3
  • 15
    • 1542784498 scopus 로고    scopus 로고
    • Variable selection via nonconcave penalized likelihood and its oracle properties
    • J. Fan and R. Li, "Variable selection via nonconcave penalized likelihood and its oracle properties," J. Amer. Stat. Assoc., vol. 96, pp. 1348-1360, 2001.
    • (2001) J. Amer. Stat. Assoc. , vol.96 , pp. 1348-1360
    • Fan, J.1    Li, R.2
  • 16
    • 0142257025 scopus 로고    scopus 로고
    • Ph.D. dissertation, Electr. Eng. Dept., Stanford Univ., Stanford, CA
    • M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Electr. Eng. Dept., Stanford Univ., Stanford, CA, 2002.
    • (2002) Matrix Rank Minimization with Applications
    • Fazel, M.1
  • 18
    • 77950537175 scopus 로고    scopus 로고
    • Regularized paths for generalized linear models via coordinate descent
    • [Online]. Available
    • J. Friedman, T. Hastie, and R. Tibshirani, "Regularized paths for generalized linear models via coordinate descent," J. Stat. Softw., vol. 33, 2010 [Online]. Available: http://www.jstatsoft.org/v33/i01
    • (2010) J. Stat. Softw. , vol.33
    • Friedman, J.1    Hastie, T.2    Tibshirani, R.3
  • 19
    • 42549115301 scopus 로고    scopus 로고
    • An inverse problem approach to robust regression
    • Phoenix, AZ, Mar
    • J. J. Fuchs, "An inverse problem approach to robust regression," in Proc. Int. Conf. Acoust., Speech, Signal Process., Phoenix, AZ, Mar. 1999, pp. 180-188.
    • (1999) Proc. Int. Conf. Acoust., Speech, Signal Process. , pp. 180-188
    • Fuchs, J.J.1
  • 20
    • 85089951782 scopus 로고    scopus 로고
    • Recursive Lasso: A homotopy algorithm for Lasso with online observations
    • presented at the, Vancouver, Canada, Dec
    • P. Garrigues and L. El Ghaoui, "Recursive Lasso: A homotopy algorithm for Lasso with online observations," presented at the Conf. Neural Inf. Process. Syst., Vancouver, Canada, Dec. 2008.
    • (2008) Conf. Neural Inf. Process. Syst.
    • Garrigues, P.1    El Ghaoui, L.2
  • 22
    • 44449098059 scopus 로고    scopus 로고
    • A semismooth Newton method for Tikhonov functionals with sparsity constraints
    • R. Griesse and D. A. Lorenz, "A semismooth Newton method for Tikhonov functionals with sparsity constraints," Inverse Problems, vol. 24, pp. 1-19, 2008.
    • (2008) Inverse Problems , vol.24 , pp. 1-19
    • Griesse, R.1    Lorenz, D.A.2
  • 23
    • 0003417806 scopus 로고    scopus 로고
    • [Online]. Available
    • S. R. Gunn, Matlab SVM Toolbox, 1997 [Online]. Available: http:// www.isis.ecs.soton.ac.uk/resources/svminfo
    • (1997) Matlab SVM Toolbox
    • Gunn, S.R.1
  • 25
    • 84858331201 scopus 로고    scopus 로고
    • Vision for the smart grid," presented at the U.S. Department of Energy
    • Washington DC, Dec. 9
    • S. G. Hauser, "Vision for the smart grid," presented at the U.S. Department of Energy Smart Grid R&D Roundtable Meeting, Washington DC, Dec. 9, 2009.
    • (2009) Smart Grid R&D Roundtable Meeting
    • Hauser, S.G.1
  • 27
    • 78049360641 scopus 로고    scopus 로고
    • Algorithms for robust linear regression by exploiting the connection to sparse signal recovery
    • Dallas, TX, Mar
    • Y. Jin and B. D. Rao, "Algorithms for robust linear regression by exploiting the connection to sparse signal recovery," in Proc. Int. Conf. Acoust., Speech, Signal Process., Dallas, TX, Mar. 2010, pp. 3830-3833.
    • (2010) Proc. Int. Conf. Acoust., Speech, Signal Process. , pp. 3830-3833
    • Jin, Y.1    Rao, B.D.2
  • 28
    • 79959197541 scopus 로고    scopus 로고
    • From sparse signals to sparse residuals for robust sensing
    • Jul
    • V. Kekatos and G. B. Giannakis, "From sparse signals to sparse residuals for robust sensing," IEEE Trans. Signal Process., vol. 59, pp. 3355-3368, Jul. 2010.
    • (2010) IEEE Trans. Signal Process. , vol.59 , pp. 3355-3368
    • Kekatos, V.1    Giannakis, G.B.2
  • 29
    • 0000406385 scopus 로고
    • A correspondence between bayesian estimation on stochastic processes and smoothing by splines
    • G. Kimbeldorf and G. Wahba, "A correspondence between bayesian estimation on stochastic processes and smoothing by splines," Ann. Math. Stat., vol. 41, pp. 495-502, 1970.
    • (1970) Ann. Math. Stat. , vol.41 , pp. 495-502
    • Kimbeldorf, G.1    Wahba, G.2
  • 30
    • 77950023906 scopus 로고    scopus 로고
    • Optimization transfer using surrogate objective functions (with discussion)
    • K. Lange, D. Hunter, and I. Yang, "Optimization transfer using surrogate objective functions (with discussion)," J. Comput. Graph. Stat., vol. 9, pp. 1-59, 2000.
    • (2000) J. Comput. Graph. Stat. , vol.9 , pp. 1-59
    • Lange, K.1    Hunter, D.2    Yang, I.3
  • 31
    • 19944407892 scopus 로고    scopus 로고
    • E-SSVR: A smooth support vector machine for -insensitive regression
    • Y. J. Lee,W. F. Heisch, and C. M. Huang, "e-SSVR: A smooth support vector machine for -insensitive regression," IEEE Trans. Knowl. Data Eng., vol. 17, pp. 678-685, 2005.
    • (2005) IEEE Trans. Knowl. Data Eng. , vol.17 , pp. 678-685
    • Lee, Y.J.1    Heisch, W.F.2    Huang, C.M.3
  • 33
    • 0000742095 scopus 로고    scopus 로고
    • Nonlinear prediction of chaotic time series using a support vector machine
    • Amelia Island, FL
    • S. Mukherjee, E. Osuna, and F. Girosi, "Nonlinear prediction of chaotic time series using a support vector machine," in Proc. Workshop Neural Netw. Signal Process., Amelia Island, FL, 1997, pp. 24-26.
    • (1997) Proc. Workshop Neural Netw. Signal Process. , pp. 24-26
    • Mukherjee, S.1    Osuna, E.2    Girosi, F.3
  • 34
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
    • (1995) SIAM J. Comput. , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 35
    • 0004030839 scopus 로고
    • Artificial Intelligence Lab.,Massachusetts Inst. of Technology, Cambridge, A. I.Memo No. 1140, "A theory of networks for approximation and learning
    • T. Poggio and F. Girosi, "A theory of networks for approximation and learning," Artificial Intelligence Lab.,Massachusetts Inst. of Technology, Cambridge, A. I.Memo No. 1140, 1989, "A theory of networks for approximation and learning,".
    • (1989) A Theory of Networks for Approximation and Learning
    • Poggio, T.1    Girosi, F.2
  • 39
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Royal Stat. Soc B, vol. 58, pp. 267-288, 1996.
    • (1996) J. Royal Stat. Soc B , vol.58 , pp. 267-288
    • Tibshirani, R.1
  • 41
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals
    • Mar
    • J. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, pp. 1030-1051, Mar. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.51 , pp. 1030-1051
    • Tropp, J.1
  • 42
    • 0002999362 scopus 로고    scopus 로고
    • Splines: A perfect fit for signal and image processing
    • Nov
    • M. Unser, "Splines: A perfect fit for signal and image processing," IEEE Signal Process. Mag., vol. 16, pp. 22-38, Nov. 1999.
    • (1999) IEEE Signal Process. Mag. , vol.16 , pp. 22-38
    • Unser, M.1
  • 45
    • 0000681041 scopus 로고
    • Some new mathematical methods for variational objective analysis using splines and cross validation
    • G. Wahba and J. Wendelberger, "Some new mathematical methods for variational objective analysis using splines and cross validation," Month. Weather Rev., vol. 108, pp. 1122-1145, 1980.
    • (1980) Month. Weather Rev. , vol.108 , pp. 1122-1145
    • Wahba, G.1    Wendelberger, J.2
  • 46
    • 77953803524 scopus 로고    scopus 로고
    • Dense error correction via -minimization
    • J. Wright and Y. Ma, "Dense error correction via -minimization," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3540-3560, 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.7 , pp. 3540-3560
    • Wright, J.1    Ma, Y.2
  • 48
    • 84863879353 scopus 로고    scopus 로고
    • Coordinate descent algorithms for lasso penalized regression
    • T. Wu and K. Lange, "Coordinate descent algorithms for lasso penalized regression," Ann. Appl. Stat., vol. 2, pp. 224-244, 2008.
    • (2008) Ann. Appl. Stat. , vol.2 , pp. 224-244
    • Wu, T.1    Lange, K.2
  • 50
    • 33846114377 scopus 로고    scopus 로고
    • The adaptive Lasso and its oracle properties
    • H. Zou, "The adaptive Lasso and its oracle properties," J. Amer. Stat. Assoc., vol. 101, no. 476, pp. 1418-1429, 2006.
    • (2006) J. Amer. Stat. Assoc. , vol.101 , Issue.476 , pp. 1418-1429
    • Zou, H.1


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