TY - GEN
T1 - Automatic Group Sparse Coding
AU - Wang, Fei
AU - Lee, Noah
AU - Sun, Jimeng
AU - Hu, Jianying
AU - Ebadollahi, Shahram
N1 - Publisher Copyright:
Copyright © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2011/8/11
Y1 - 2011/8/11
N2 - Sparse Coding (SC), which models the data vectors as sparse linear combinations over basis vectors (i.e., dictionary), has been widely applied in machine learning, signal processing and neuroscience. Recently, one specific SC technique, Group Sparse Coding (GSC), has been proposed to learn a common dictionary over multiple different groups of data, where the data groups are assumed to be pre-defined. In practice, this may not always be the case. In this paper, we propose Automatic Group Sparse Coding (AutoGSC), which can (1) discover the hidden data groups; (2) learn a common dictionary over different data groups; and (3) learn an individual dictionary for each data group. Finally, we conduct experiments on both synthetic and real world data sets to demonstrate the effectiveness of AutoGSC, and compare it with traditional sparse coding and Nonnegative Matrix Factorization (NMF) methods.
AB - Sparse Coding (SC), which models the data vectors as sparse linear combinations over basis vectors (i.e., dictionary), has been widely applied in machine learning, signal processing and neuroscience. Recently, one specific SC technique, Group Sparse Coding (GSC), has been proposed to learn a common dictionary over multiple different groups of data, where the data groups are assumed to be pre-defined. In practice, this may not always be the case. In this paper, we propose Automatic Group Sparse Coding (AutoGSC), which can (1) discover the hidden data groups; (2) learn a common dictionary over different data groups; and (3) learn an individual dictionary for each data group. Finally, we conduct experiments on both synthetic and real world data sets to demonstrate the effectiveness of AutoGSC, and compare it with traditional sparse coding and Nonnegative Matrix Factorization (NMF) methods.
UR - http://www.scopus.com/inward/record.url?scp=84867868812&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867868812&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84867868812
T3 - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
SP - 495
EP - 500
BT - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
PB - American Association for Artificial Intelligence (AAAI) Press
T2 - 25th AAAI Conference on Artificial Intelligence, AAAI 2011
Y2 - 7 August 2011 through 11 August 2011
ER -