메뉴 건너뛰기




Volumn 36, Issue 4, 2012, Pages 870-886

Group topic modeling for academic knowledge discovery

Author keywords

Conference mining; Denser topics; Digital libraries; Group topic modeling; Unsupervised expert finding

Indexed keywords

DENSER TOPICS; ELEMENT LEVEL; EMPIRICAL EVALUATIONS; EXPERT FINDING; GROUP LEVEL; INTRINSIC STRUCTURES; LATENT DIRICHLET ALLOCATIONS; NETWORK CONNECTIVITY;

EID: 84862132258     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-011-0302-3     Document Type: Article
Times cited : (14)

References (30)
  • 1
    • 0037262814 scopus 로고    scopus 로고
    • An introduction to MCMC for machine learning
    • 1033.68081 10.1023/A:1020281327116
    • C Andrieu ND Freitas A Doucet M Jordan 2003 An introduction to MCMC for machine learning J Mach Learn 50 5 43 1033.68081 10.1023/A:1020281327116
    • (2003) J Mach Learn , vol.50 , pp. 5-43
    • Andrieu, C.1    Freitas, N.D.2    Doucet, A.3    Jordan, M.4
  • 3
    • 0031103679 scopus 로고    scopus 로고
    • Content-based collaborative recommendation
    • Balabanovic M, Shoham Y (1997) Content-based collaborative recommendation. Commun ACM
    • (1997) Commun ACM
    • Balabanovic, M.1    Shoham, Y.2
  • 7
    • 77953358690 scopus 로고    scopus 로고
    • Knowledge discovery through directed probabilistic topic models a survey
    • 10.1007/s11704-009-0062-y
    • A Daud J Li L Zhu F Muhammad 2010 Knowledge discovery through directed probabilistic topic models a survey J Front Comput Sci China 4 2 280 301 10.1007/s11704-009-0062-y
    • (2010) J Front Comput Sci China , vol.4 , Issue.2 , pp. 280-301
    • Daud, A.1    Li, J.2    Zhu, L.3    Muhammad, F.4
  • 9
    • 3042821101 scopus 로고    scopus 로고
    • Item-based top-n recommendation algorithms
    • 10.1145/963770.963776
    • M Deshpande G Karypis 2004 Item-based top-n recommendation algorithms ACM Trans Inf Sys 22 1 143 177 10.1145/963770.963776
    • (2004) ACM Trans Inf Sys , vol.22 , Issue.1 , pp. 143-177
    • Deshpande, M.1    Karypis, G.2
  • 14
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • 0333.05001
    • BW Kernighan S Lin 1970 An efficient heuristic procedure for partitioning graphs Bell Syst Tech J 49 291 307 0333.05001
    • (1970) Bell Syst Tech J , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 18
    • 0033725422 scopus 로고    scopus 로고
    • Clustering and identifying temporal trends in document databases
    • Popescul A, Flake GW, Lawrence S et al. (2000) Clustering and identifying temporal trends in document databases. IEEE Adv Digit Libr 173-182
    • (2000) IEEE Adv Digit Libr , pp. 173-182
    • Popescul, A.1    Flake, G.W.2
  • 19
    • 0000812783 scopus 로고
    • Partitioning sparse matrices with eigenvectors of graphs
    • 1054210 0711.65034 10.1137/0611030
    • A Pothen H Simon KP Liou 1990 Partitioning sparse matrices with eigenvectors of graphs SIAM J Matrix Anal Appl 11 430 452 1054210 0711.65034 10.1137/0611030
    • (1990) SIAM J Matrix Anal Appl , vol.11 , pp. 430-452
    • Pothen, A.1    Simon, H.2    Liou, K.P.3
  • 25
    • 84862140079 scopus 로고    scopus 로고
    • Understanding research field evolving and trend with dynamic Bayesian networks
    • Wang J, Xu C, Li G, Dai Z, Luo G (2007) Understanding research field evolving and trend with dynamic Bayesian networks. In: Proc of the PAKDD
    • (2007) Proc of the PAKDD
    • Wang, J.1    Xu, C.2    Li, G.3    Dai, Z.4    Luo, G.5
  • 29
    • 38149095803 scopus 로고    scopus 로고
    • Learning implicit user interest hierarchy for context in personalization
    • 10.1007/s10489-007-0056-0
    • HR Kim PK Chan 2008 Learning implicit user interest hierarchy for context in personalization J Appl Intell 28 153 166 10.1007/s10489-007-0056-0
    • (2008) J Appl Intell , vol.28 , pp. 153-166
    • Kim, H.R.1    Chan, P.K.2
  • 30
    • 0038604019 scopus 로고    scopus 로고
    • Authorship attribution with support vector machines
    • 1040.68120 10.1023/A:1023824908771
    • J Diederich 2003 Authorship attribution with support vector machines J Appl Intell 19 109 123 1040.68120 10.1023/A:1023824908771
    • (2003) J Appl Intell , vol.19 , pp. 109-123
    • Diederich, J.1


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