메뉴 건너뛰기




Volumn 9, Issue 1, 2014, Pages

Detecting the community structure and activity patterns of temporal networks: A non-negative tensor factorization approach

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; ARTICLE; CHILD; COMMUNITY STRUCTURE; DAILY LIFE ACTIVITY; HUMAN; NON NEGATIVE TENSOR FACTORIZATION; SCHOOL; SOCIAL BEHAVIOR; SOCIAL INTERACTION; SOCIAL NETWORK; SPATIOTEMPORAL ANALYSIS; STATISTICAL PARAMETERS; STUDENT; TEMPORAL NETWORK; TIME SERIES ANALYSIS;

EID: 84900316533     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0086028     Document Type: Article
Times cited : (218)

References (36)
  • 1
    • 74049087026 scopus 로고    scopus 로고
    • Community detection in graphs
    • Fortunato S (2010) Community detection in graphs. Physics Reports 486: 75-174.
    • (2010) Physics Reports , vol.486 , pp. 75-174
    • Fortunato, S.1
  • 7
    • 77952328459 scopus 로고    scopus 로고
    • Community structure in timedependent, multiscale, and multiplex networks
    • Mucha PJ, Richardson T, Macon K, Porter MA, Onnela JP (2010) Community structure in timedependent, multiscale, and multiplex networks. Science 328: 876-878.
    • (2010) Science , vol.328 , pp. 876-878
    • Mucha, P.J.1    Richardson, T.2    Macon, K.3    Porter, M.A.4    Onnela, J.P.5
  • 8
    • 84859736664 scopus 로고    scopus 로고
    • Detection of hidden structures for arbitrary scales in complex physical systems
    • Ronhovde P, Chakrabarty S, Hu D, Sahu M, Sahu KK, et al. (2012) Detection of hidden structures for arbitrary scales in complex physical systems. Sci Rep 2: 329.
    • (2012) Sci Rep , vol.2 , pp. 329
    • Ronhovde, P.1    Chakrabarty, S.2    Hu, D.3    Sahu, M.4    Sahu, K.K.5
  • 11
    • 79960865296 scopus 로고    scopus 로고
    • Applications of tensor (multiway array) factorizations and decompositions in data mining
    • Mørup M (2011) Applications of tensor (multiway array) factorizations and decompositions in data mining. Wiley Interdisc Rew: Data Mining and Knowledge Discovery 1: 24-40.
    • (2011) Wiley Interdisc Rew: Data Mining and Knowledge Discovery , vol.1 , pp. 24-40
    • Mørup, M.1
  • 12
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51: 455-500.
    • (2009) SIAM Rev , vol.51 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 14
    • 77952676418 scopus 로고    scopus 로고
    • A non-negative tensor factorization model for selectional preference induction
    • Stroudsburg, PA, USA: Association for Computational Linguistics, GEMS '09
    • Van de Cruys T (2009) A non-negative tensor factorization model for selectional preference induction. In: Proceedings of the Workshop on Geometrical Models of Natural Language Semantics. Stroudsburg, PA, USA: Association for Computational Linguistics, GEMS '09, 83-90.
    • (2009) Proceedings of the Workshop on Geometrical Models of Natural Language Semantics , pp. 83-90
    • Van De Cruys, T.1
  • 17
    • 34250499792 scopus 로고
    • Analysis of individual differences in multidimensional scaling via an n-way generalization of "eckart-young" decomposition
    • Carroll J, Chang JJ (1970) Analysis of individual differences in multidimensional scaling via an n-way generalization of "eckart-young" decomposition. Psychometrika 35: 283-319.
    • (1970) Psychometrika , vol.35 , pp. 283-319
    • Carroll, J.1    Chang, J.J.2
  • 18
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC procedure: Models and conditions for an"explanatory" multi-modal factor analysis
    • Harshman RA (1970) Foundations of the PARAFAC procedure: Models and conditions for an"explanatory" multi-modal factor analysis. UCLA Working Papers in Phonetics 16: 84.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 84
    • Harshman, R.A.1
  • 19
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401: 788-791.
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 20
  • 22
    • 79960845914 scopus 로고    scopus 로고
    • Community discovery using nonnegative matrix factorization
    • Wang F, Li T, Wang X, Zhu S, Ding C (2011) Community discovery using nonnegative matrix factorization. Data Min Knowl Discov 22: 493-521.
    • (2011) Data Min Knowl Discov , vol.22 , pp. 493-521
    • Wang, F.1    Li, T.2    Wang, X.3    Zhu, S.4    Ding, C.5
  • 24
    • 80051704709 scopus 로고    scopus 로고
    • High-resolution measurements of face-to-face contact patterns in a primary school
    • Stehlé J, Voirin N, Barrat A, Cattuto C, Isella L, et al. (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLOS ONE 6: e23176.
    • (2011) PLOS ONE , vol.6
    • Stehlé, J.1    Voirin, N.2    Barrat, A.3    Cattuto, C.4    Isella, L.5
  • 25
    • 77955352798 scopus 로고    scopus 로고
    • Dynamics of personto- person interactions from distributed rfid sensor networks
    • Cattuto C, Van den Broeck W, Barrat A, Colizza V, Pinton JF, et al. (2010) Dynamics of personto- person interactions from distributed rfid sensor networks. PLoS ONE 5: e11596.
    • (2010) PLoS ONE , vol.5
    • Cattuto, C.1    Van Den Broeck, W.2    Barrat, A.3    Colizza, V.4    Pinton, J.F.5
  • 26
    • 0001093042 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • MIT Press
    • Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. In: In NIPS. MIT Press, 556-562.
    • (2000) NIPS , pp. 556-562
    • Lee, D.D.1    Seung, H.S.2
  • 27
    • 84861194912 scopus 로고    scopus 로고
    • Seeking an appropriate alternative least squares algorithm for nonnegative tensor factorizations
    • Phan AH, Cichocki A (2012) Seeking an appropriate alternative least squares algorithm for nonnegative tensor factorizations. Neural Computing and Applications 21: 623-637.
    • (2012) Neural Computing and Applications , vol.21 , pp. 623-637
    • Phan, A.H.1    Cichocki, A.2
  • 28
    • 0028561099 scopus 로고
    • Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values
    • Paatero P, Tapper U (1994) Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5: 111-126.
    • (1994) Environmetrics , vol.5 , pp. 111-126
    • Paatero, P.1    Tapper, U.2
  • 30
    • 84949178333 scopus 로고    scopus 로고
    • Fast nonnegative tensor factorization with an active-set-like method
    • Berry MW, Gallivan KA, Gallopoulos E, Grama A, Philippe B, et al., editors, Springer London
    • Kim J, Park H (2012) Fast nonnegative tensor factorization with an active-set-like method. In: Berry MW, Gallivan KA, Gallopoulos E, Grama A, Philippe B, et al., editors, High-Performance Scientific Computing, Springer London. 311-326.
    • (2012) High-Performance Scientific Computing , pp. 311-326
    • Kim, J.1    Park, H.2
  • 31
    • 49749096526 scopus 로고    scopus 로고
    • Efficient matlab computations with sparse and factored tensors
    • Bader BW, Kolda TG (2007) Efficient matlab computations with sparse and factored tensors. SIAM J Sci Comput 30: 205-231.
    • (2007) SIAM J Sci Comput , vol.30 , pp. 205-231
    • Bader, B.W.1    Kolda, T.G.2
  • 32
    • 0038685059 scopus 로고    scopus 로고
    • A new efficient method for determining the number of components in parafac models
    • Bro R, Kiers HAL (2003) A new efficient method for determining the number of components in parafac models. Journal of Chemometrics 17: 274-286.
    • (2003) Journal of Chemometrics , vol.17 , pp. 274-286
    • Bro, R.1    Kiers, H.A.L.2
  • 34
    • 33646530046 scopus 로고    scopus 로고
    • Computing communities in large networks using random walks
    • Yolum p, Güngör T, Gürgen F, Özturan C, editors, Computer and Information Sciences - ISCIS 2005, Springer Berlin Heidelberg
    • Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Yolum p, Güngör T, Gürgen F, Özturan C, editors, Computer and Information Sciences - ISCIS 2005, Springer Berlin Heidelberg, volume 3733 of Lecture Notes in Computer Science. 284-293.
    • (2005) Lecture Notes in Computer Science , vol.3733 , pp. 284-293
    • Pons, P.1    Latapy, M.2


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