메뉴 건너뛰기




Volumn 4, Issue , 2009, Pages 106-113

Online user activities discovery based on time dependent data

Author keywords

Social networks; Time dependent; User activities

Indexed keywords

ACCESS HISTORY; ACTIVITY PATTERNS; DAILY ACTIVITY; DYNAMIC NATURE; HOT RESEARCH TOPICS; NETWORK EVOLUTION; ON TIME; ONLINE USERS; SINGLE USERS; SOCIAL NETWORKING; SOCIAL NETWORKS; TIME DEPENDENT; TIME SERIES MODELS; USER ACTIVITY; USER BEHAVIORS; WEB APPLICATION; WEB USERS;

EID: 70849103107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.313     Document Type: Conference Paper
Times cited : (5)

References (18)
  • 1
    • 84930064585 scopus 로고    scopus 로고
    • Hierarchical organization in complex networks
    • E. Ravasz and A. Barabasi, "Hierarchical organization in complex networks, " Physical Reviews, vol. 67, p. 026112, 2003.
    • (2003) Physical Reviews , vol.67 , pp. 026112
    • Ravasz, E.1    Barabasi, A.2
  • 3
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • October
    • A.-L. Barabási and R. Albert, "Emergence of scaling in random networks, " Science, vol. 286, no. 5439, pp. 509-512, October 1999.
    • (1999) Science , vol.286 , Issue.5439 , pp. 509-512
    • Barabási, A.-L.1    Albert, R.2
  • 6
    • 34247223815 scopus 로고    scopus 로고
    • Quantifying social group evolution
    • Apr 5
    • G. Palla, A. L. Barabasi, and T. Vicsek, "Quantifying social group evolution, " Nature, vol. 446, no. 7136, pp. 664-667, Apr 5 2007.
    • (2007) Nature , vol.446 , Issue.7136 , pp. 664-667
    • Palla, G.1    Barabasi, A.L.2    Vicsek, T.3
  • 9
    • 33646099605 scopus 로고    scopus 로고
    • Explaining clustering in social networks: Towards an evolutionary theory of cascading benefits
    • Online. Available
    • S. S. Levine and R. Kurzban, "Explaining clustering in social networks: towards an evolutionary theory of cascading benefits, " Managerial and Decision Economics, vol. 27, no. 2-3, pp. 173-187, 2006. [Online]. Available: http://ideas.repec.org/a/wly/mgtdec/v27y2006i2-3p173-187. html.
    • (2006) Managerial and Decision Economics , vol.27 , Issue.2-3 , pp. 173-187
    • Levine, S.S.1    Kurzban, R.2
  • 10
    • 77953802502 scopus 로고    scopus 로고
    • Dynamic privacy management: A plug-in service for the middleware in pervasive computing
    • Salzburg, Austria: ACM, September
    • D. Hong, M. Yuan, and V. Y. Shen, "Dynamic privacy management: a plug-in service for the middleware in pervasive computing, " in MobileHCI 2005. Salzburg, Austria: ACM, September 2005, pp. 1-8.
    • (2005) MobileHCI 2005 , pp. 1-8
    • Hong, D.1    Yuan, M.2    Shen, V.Y.3
  • 11
    • 70849115485 scopus 로고    scopus 로고
    • Setting access permission through transitive relationship in web-based social networks
    • I. King and R. Baeza-Yates, Eds. Springer Berlin Heidelberg
    • D. Hong and V. Y. Shen, "Setting access permission through transitive relationship in web-based social networks, " in Weaving Services and People on the World Wide Web, I. King and R. Baeza-Yates, Eds. Springer Berlin Heidelberg, 2009, pp. 229-253.
    • (2009) Weaving Services and People on the World Wide Web , pp. 229-253
    • Hong, D.1    Shen, V.Y.2
  • 12
    • 0001138328 scopus 로고
    • A K-means clustering algorithm
    • J. A. Hartigan and M. A. Wong, "A K-means clustering algorithm, " Applied Statistics, vol. 28, pp. 100-108, 1979.
    • (1979) Applied Statistics , vol.28 , pp. 100-108
    • Hartigan, J.A.1    Wong, M.A.2
  • 13
    • 0024072828 scopus 로고
    • New results in fuzzy clustering based on the concept of indistinguishability relation
    • R. L. de Mantaras and L. Valverde, "New results in fuzzy clustering based on the concept of indistinguishability relation, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 754-757, 1988.
    • (1988) IEEE Trans. Pattern Anal. Mach. Intell , vol.10 , Issue.5 , pp. 754-757
    • Mantaras, R.L.D.1    Valverde, L.2
  • 14
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, " Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
    • (2008) Commun. ACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2


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