{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:44Z","timestamp":1763468024773,"version":"3.41.0"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2011,8]]},"abstract":"<jats:p>This work aims at discovering community structure in rich media social networks through analysis of time-varying, multirelational data. Community structure represents the latent social context of user actions. It has important applications such as search and recommendation. The problem is particularly useful in the enterprise domain, where extracting emergent community structure on enterprise social media can help in forming new collaborative teams, in expertise discovery, and in the long term reorganization of enterprises based on collaboration patterns. There are several unique challenges: (a) In social media, the context of user actions is constantly changing and coevolving; hence the social context contains time-evolving multidimensional relations. (b) The social context is determined by the available system features and is unique in each social media platform; hence the analysis of such data needs to flexibly incorporate various system features. In this article we propose MetaFac (MetaGraph Factorization), a framework that extracts community structures from dynamic, multidimensional social contexts and interactions. Our work has three key contributions: (1) metagraph, a novel relational hypergraph representation for modeling multirelational and multidimensional social data; (2) an efficient multirelational factorization method for community extraction on a given metagraph; (3) an online method to handle time-varying relations through incremental metagraph factorization. Extensive experiments on real-world social data collected from an enterprise and the public Digg social media Web site suggest that our technique is scalable and is able to extract meaningful communities from social media contexts. We illustrate the usefulness of our framework through two prediction tasks: (1) in the enterprise dataset, the task is to predict users\u2019 future interests on tag usage, and (2) in the Digg dataset, the task is to predict users\u2019 future interests in voting and commenting on Digg stories. Our prediction significantly outperforms baseline methods (including aspect model and tensor analysis), indicating the promising direction of using metagraphs for handling time-varying social relational contexts.<\/jats:p>","DOI":"10.1145\/1993077.1993081","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T16:16:22Z","timestamp":1312992982000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Community Discovery via Metagraph Factorization"],"prefix":"10.1145","volume":"5","author":[{"given":"Yu-Ru","family":"Lin","sequence":"first","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimeng","family":"Sun","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hari","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aisling","family":"Kelliher","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Castro","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Konuru","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"volume-title":"Proceedings of SIAM Conference on Data Mining (SDM).","author":"Aggarwal C.","key":"e_1_2_1_2_1","unstructured":"Aggarwal , C. and Yu , P . 2005. Online analysis of community evolution in data streams . In Proceedings of SIAM Conference on Data Mining (SDM). Aggarwal, C. and Yu, P. 2005. Online analysis of community evolution in data streams. In Proceedings of SIAM Conference on Data Mining (SDM)."},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM).","author":"Ahmed A.","key":"e_1_2_1_3_1","unstructured":"Ahmed , A. and Xing , E . 2008. Dynamic non-parametric mixture models and the recurrent chinese restaurant process: With applications to evolutionary clustering . In Proceedings of the IEEE International Conference on Data Mining (ICDM). Ahmed, A. and Xing, E. 2008. Dynamic non-parametric mixture models and the recurrent chinese restaurant process: With applications to evolutionary clustering. In Proceedings of the IEEE International Conference on Data Mining (ICDM)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281290"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186785.1186794"},{"volume-title":"SAND2006-2161","author":"Bader B.","key":"e_1_2_1_7_1","unstructured":"Bader , B. , Harshman , R. , and Kolda , T . 2006. Temporal analysis of social networks using three-way dedicom. Tech. rep . SAND2006-2161 , Sandia National Labs, Albuquerque, NM and Livermore, CA. Bader, B., Harshman, R., and Kolda, T. 2006. Temporal analysis of social networks using three-way dedicom. Tech. rep. SAND2006-2161, Sandia National Labs, Albuquerque, NM and Livermore, CA."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"volume-title":"Proceedings of SIAM Conference on Data Mining (SDM).","author":"Banerjee A.","key":"e_1_2_1_9_1","unstructured":"Banerjee , A. , Basu , S. , and Merugu , S . 2007. Multi-way clustering on relation graphs . In Proceedings of SIAM Conference on Data Mining (SDM). Banerjee, A., Basu, S., and Merugu, S. 2007. Multi-way clustering on relation graphs. In Proceedings of SIAM Conference on Data Mining (SDM)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Barber M. Faria M. Streit L. and Strogan O. 2008. Searching for communities in bipartite networks. American Institute of Physics arXiv:803.2854 171--182. Barber M. Faria M. Streit L. and Strogan O. 2008. Searching for communities in bipartite networks. American Institute of Physics arXiv:803.2854 171--182.","DOI":"10.1063\/1.2956795"},{"key":"e_1_2_1_11_1","unstructured":"Basu A. and Blanning R. 2007. Metagraphs and Their Applications. Springer-Verlag Berlin. Basu A. and Blanning R. 2007. Metagraphs and Their Applications . Springer-Verlag Berlin."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102357"},{"key":"e_1_2_1_13_1","unstructured":"Berge C. 1976. Graphs and Hypergraphs. North-Holland. Berge C. 1976. Graphs and Hypergraphs . North-Holland."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150462"},{"key":"e_1_2_1_15_1","unstructured":"Borg I. and Groenen P. 2005. Modern Multidimensional Scaling: Theory and Applications. Springer. Borg I. and Groenen P. 2005. Modern Multidimensional Scaling: Theory and Applications . Springer."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.4.432.14428"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.11.024"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150467"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/320434.320440"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281212"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458206"},{"volume-title":"Spectral Graph Theory","author":"Chung F.","key":"e_1_2_1_23_1","unstructured":"Chung , F. 1997. Spectral Graph Theory . American Mathematical Society . Chung, F. 1997. Spectral Graph Theory. American Mathematical Society."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"volume-title":"Proceedings of the SIAM Conference on Data Mining (SDM).","author":"Ding C.","key":"e_1_2_1_25_1","unstructured":"Ding , C. , He , X. , and Simon , H . 2005. On the equivalence of nonnegative matrix factorization and spectral clustering . In Proceedings of the SIAM Conference on Data Mining (SDM). Ding, C., He, X., and Simon, H. 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the SIAM Conference on Data Mining (SDM)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.118"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 1300--1309","author":"Friedman N.","key":"e_1_2_1_28_1","unstructured":"Friedman , N. , Getoor , L. , Koller , D. , and Pfeffer , A . 1999. Learning probabilistic relational models . In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 1300--1309 . Friedman, N., Getoor, L., Koller, D., and Pfeffer, A. 1999. Learning probabilistic relational models. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 1300--1309."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1086\/228311"},{"volume-title":"Proceedings of the International Conference on Digital Signal Processing. 1--8.","author":"Grujic J.","key":"e_1_2_1_31_1","unstructured":"Grujic , J. , Mitrovic , M. , and Tadic , B . 2009. Mixing patterns and communities on bipartite graphs on web-based social interactions . In Proceedings of the International Conference on Digital Signal Processing. 1--8. Grujic, J., Mitrovic, M., and Tadic, B. 2009. Mixing patterns and communities on bipartite graphs on web-based social interactions. In Proceedings of the International Conference on Digital Signal Processing. 1--8."},{"volume-title":"Proceedings of the IEEE International Conference on Computer and Information Technology. 915--920","author":"Harada K.","key":"e_1_2_1_32_1","unstructured":"Harada , K. , Ishioka , T. , Suzuki , I. , and Furukawa , M . 2007. A method for solving a bipartite-graph clustering problem with sequence optimization . In Proceedings of the IEEE International Conference on Computer and Information Technology. 915--920 . Harada, K., Ishioka, T., Suzuki, I., and Furukawa, M. 2007. A method for solving a bipartite-graph clustering problem with sequence optimization. In Proceedings of the IEEE International Conference on Computer and Information Technology. 915--920."},{"key":"e_1_2_1_33_1","first-page":"1","article-title":"Foundations of the parafac procedure: Models and conditions for an \u201cExplanatory","volume":"16","author":"Harshman R.","year":"1970","unstructured":"Harshman , R. 1970 . Foundations of the parafac procedure: Models and conditions for an \u201cExplanatory \u201d Multi-modal factor analysis. UCLA Work. Papers Phonetics 16 , 1 , 1. Harshman, R. 1970. Foundations of the parafac procedure: Models and conditions for an \u201cExplanatory\u201d Multi-modal factor analysis. UCLA Work. Papers Phonetics 16, 1, 1.","journal-title":"UCLA Work. Papers Phonetics"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.258701"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_2_1_37_1","article-title":"An exponential family of probability distributions for directed graphs","volume":"76","author":"Holland P.","year":"1981","unstructured":"Holland , P. and Leinhardt , S. 1981 . An exponential family of probability distributions for directed graphs . J. Amer. Statistical Assoc. 76 , 373, 33--50. Holland, P. and Leinhardt, S. 1981. An exponential family of probability distributions for directed graphs. J. Amer. Statistical Assoc. 76, 373, 33--50.","journal-title":"J. Amer. Statistical Assoc."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_2_1_39_1","unstructured":"Kemp C. Griffiths T. and Tenenbaum J. 2004. Discovering latent classes in relational data. M.I.T. AI memo 2004-19. Kemp C. Griffiths T. and Tenenbaum J. 2004. Discovering latent classes in relational data. M.I.T. AI memo 2004-19."},{"volume-title":"Proc. Natl. Conf. AI. AAAI, 381","author":"Kemp C.","key":"e_1_2_1_40_1","unstructured":"Kemp , C. , Tenenbaum , J. , Griffiths , T. , Yamada , T. , and Ueda , N . 2006. Learning systems of concepts with an infinite relational model . Proc. Natl. Conf. AI. AAAI, 381 . Kemp, C., Tenenbaum, J., Griffiths, T., Yamada, T., and Ueda, N. 2006. Learning systems of concepts with an infinite relational model. Proc. Natl. Conf. AI. AAAI, 381."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.104"},{"volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS). 556--562","author":"Lee D.","key":"e_1_2_1_43_1","unstructured":"Lee , D. and Seung , H . 2001. Algorithms for non-negative matrix factorization . In Proceedings of the Conference on Neural Information Processing Systems (NIPS). 556--562 . Lee, D. and Seung, H. 2001. Algorithms for non-negative matrix factorization. In Proceedings of the Conference on Neural Information Processing Systems (NIPS). 556--562."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401948"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367590"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514888.1514891"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557080"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281244"},{"key":"e_1_2_1_49_1","unstructured":"Lovasz L. and Plummer M. 1986. Matching Theory. North Holland. Lovasz L. and Plummer M. 1986. Matching Theory . North Holland."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124792"},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Monge P. and Contractor N. 2001. Emergence of communication networks. The New Handbook of Organizational Communication: Advances in Theory Research and Methods. F. M. Jablin and L. Putnam Eds. 440--502. Monge P. and Contractor N. 2001. Emergence of communication networks. The New Handbook of Organizational Communication: Advances in Theory Research and Methods . F. M. Jablin and L. Putnam Eds. 440--502.","DOI":"10.4135\/9781412986243.n12"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610537104"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Palla G. Barabasi A. and Vicsek T. 2007. Quantifying social group evolution. Nature 446 7136 664--667. Palla G. Barabasi A. and Vicsek T. 2007. Quantifying social group evolution. Nature 446 7136 664--667.","DOI":"10.1038\/nature05670"},{"volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 437--444","author":"Popescul A.","key":"e_1_2_1_55_1","unstructured":"Popescul , A. , Ungar , L. H. , Pennock , D. M. , and Lawrence , S . 2001. Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments . In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 437--444 . Popescul, A., Ungar, L. H., Pennock, D. M., and Lawrence, S. 2001. Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 437--444."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.2307\/2393988"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.3138\/98M0-1Q05-6201-G572"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117459"},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.2307\/1556348","article-title":"Research methodology in management: Current practices, trends, and implications for future research","volume":"43","author":"Scandura T. A.","year":"2000","unstructured":"Scandura , T. A. and Williams , E. A. 2000 . Research methodology in management: Current practices, trends, and implications for future research . Academy Manag. J. 43 , 6, 1248 -- 1264 . Scandura, T. A. and Williams, E. A. 2000. Research methodology in management: Current practices, trends, and implications for future research. Academy Manag. J. 43, 6, 1248--1264.","journal-title":"Academy Manag. J."},{"volume-title":"Proceedings of the SIGIR Workshop on Recommender Systems.","author":"Schein A.","key":"e_1_2_1_60_1","unstructured":"Schein , A. , Popescul , A. , Ungar , L. , and Pennock , D . 2001. Generative models for cold-start recommendations . In Proceedings of the SIGIR Workshop on Recommender Systems. Schein, A., Popescul, A., Ungar, L., and Pennock, D. 2001. Generative models for cold-start recommendations. In Proceedings of the SIGIR Workshop on Recommender Systems."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(81)90016-0"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1177\/109442810031004"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150491"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1177\/109442810143002"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281266"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401972"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281269"},{"volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 895--902","author":"Taskar B.","key":"e_1_2_1_70_1","unstructured":"Taskar , B. , Abbeel , P. , and Koller , D . 2002. Discriminative probabilistic models for relational data . In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 895--902 . Taskar, B., Abbeel, P., and Koller, D. 2002. Discriminative probabilistic models for relational data. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). 895--902."},{"key":"e_1_2_1_71_1","unstructured":"Vavasis S. 2007. On the complexity of nonnegative matrix factorization. arXiv-0708.4149v2{CS.NA}. Vavasis S. 2007. On the complexity of nonnegative matrix factorization. arXiv-0708.4149v2{CS.NA}."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148214"},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","unstructured":"Wasserman S. and Faust K. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press. Wasserman S. and Faust K. 1994. Social Network Analysis: Methods and Applications . Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"volume-title":"Proceedings of SIAM International Conference on Data Mining (SDM).","author":"Yang T.","key":"e_1_2_1_74_1","unstructured":"Yang , T. , Chi , Y. , Zhu , S. , Gong , Y. , and Jin , R . 2009. A Bayesian approach toward finding communities and their evolutions in dynamic social networks . In Proceedings of SIAM International Conference on Data Mining (SDM). Yang, T., Chi, Y., Zhu, S., Gong, Y., and Jin, R. 2009. A Bayesian approach toward finding communities and their evolutions in dynamic social networks. In Proceedings of SIAM International Conference on Data Mining (SDM)."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557125"},{"volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS).","author":"Yu K.","key":"e_1_2_1_76_1","unstructured":"Yu , K. , Yu , S. , and Tresp , V . 2005. Soft clustering on graphs . In Proceedings of the Conference on Neural Information Processing Systems (NIPS). Yu, K., Yu, S., and Tresp, V. 2005. Soft clustering on graphs. In Proceedings of the Conference on Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277825"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993077.1993081","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993077.1993081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:45Z","timestamp":1750244745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993077.1993081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":77,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["10.1145\/1993077.1993081"],"URL":"https:\/\/doi.org\/10.1145\/1993077.1993081","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2011,8]]},"assertion":[{"value":"2009-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}