메뉴 건너뛰기




Volumn , Issue , 2005, Pages 322-329

Leveraging relational autocorrelation with latent group models

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA STRUCTURES; LEARNING SYSTEMS; MATHEMATICAL MODELS; STATISTICAL METHODS; UBIQUITOUS COMPUTING;

EID: 34249042076     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.89     Document Type: Conference Paper
Times cited : (42)

References (25)
  • 1
    • 0141607824 scopus 로고    scopus 로고
    • A, Ng, and M
    • Jordan. Latent Dirichlet allocation
    • D. Blei, A, Ng, and M, Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993-1022, 2003.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 993-1022
    • Blei, D.1
  • 2
    • 0032090684 scopus 로고    scopus 로고
    • Enhanced hypertext categorization using hyperlinks
    • S. Chakrabarti, B. Dom, and P. Indyk. Enhanced hypertext categorization using hyperlinks. In ACM SIGMOD 1998, pages 307-318, 1998.
    • (1998) ACM SIGMOD 1998 , pp. 307-318
    • Chakrabarti, S.1    Dom, B.2    Indyk, P.3
  • 6
    • 1942450651 scopus 로고    scopus 로고
    • Linkage and autocorrelation cause feature selection bias in relational learning
    • D. Jensen and J. Neville. Linkage and autocorrelation cause feature selection bias in relational learning. In ICML-2002, pages 259-266, 2002.
    • (2002) ICML-2002 , pp. 259-266
    • Jensen, D.1    Neville, J.2
  • 7
    • 12244297396 scopus 로고    scopus 로고
    • Why collective inference improves relational classification
    • D. Jensen, J. Neville, and B. Gallagher. Why collective inference improves relational classification. In ACM SIGKDD 2004, pages 593-598, 2004.
    • (2004) ACM SIGKDD 2004 , pp. 593-598
    • Jensen, D.1    Neville, J.2    Gallagher, B.3
  • 8
    • 34548582878 scopus 로고    scopus 로고
    • Discovering latent classes in relational data
    • Memo 2004-019, Massachusetts Institute of Technology
    • C. Kemp, T. Griffiths, and J. Tenenbaum. Discovering latent classes in relational data. Technical Report AI Memo 2004-019, Massachusetts Institute of Technology, 2004.
    • (2004) Technical Report AI
    • Kemp, C.1    Griffiths, T.2    Tenenbaum, J.3
  • 11
    • 1942484863 scopus 로고    scopus 로고
    • Link-based classification
    • Q. Lu and L. Getoor. Link-based classification. In ICML-2003. pages 496-503, 2003.
    • (2003) ICML-2003 , pp. 496-503
    • Lu, Q.1    Getoor, L.2
  • 12
    • 32044472086 scopus 로고    scopus 로고
    • Classification in networked data: A toolkit and a univariate case study
    • Technical Report CeDER-04-08, Stern School of Business, NYU
    • S. Macskassy and F. Provost. Classification in networked data: A toolkit and a univariate case study. Technical Report CeDER-04-08, Stern School of Business, NYU, 2004.
    • (2004)
    • Macskassy, S.1    Provost, F.2
  • 13
    • 84880652043 scopus 로고    scopus 로고
    • A machine learning approach to building domain-specific search engines
    • A. McCallum, K. Nigam, J. Rennie, and K. Seymore. A machine learning approach to building domain-specific search engines. In UCAI-1999, pages 662-667, 1999.
    • (1999) UCAI-1999 , pp. 662-667
    • McCallum, A.1    Nigam, K.2    Rennie, J.3    Seymore, K.4
  • 15
    • 19544382510 scopus 로고    scopus 로고
    • Dependency networks for relational data
    • J. Neville and D. Jensen. Dependency networks for relational data. In ICDM-2004, pages 170-177, 2004.
    • (2004) ICDM-2004 , pp. 170-177
    • Neville, J.1    Jensen, D.2
  • 17
    • 29344464364 scopus 로고    scopus 로고
    • Simple estimators for relational bayesian classifers
    • J. Neville, D. Jensen, and B. Gallagher. Simple estimators for relational bayesian classifers. In ICDM-2003, pages 609-612, 2003.
    • (2003) ICDM-2003 , pp. 609-612
    • Neville, J.1    Jensen, D.2    Gallagher, B.3
  • 19
    • 12244283359 scopus 로고    scopus 로고
    • Cluster-based concept invention for statistical relational learning
    • A. Popescul and L. Ungar. Cluster-based concept invention for statistical relational learning. In ACM SIGKDD 2004, pages 665-670, 2004.
    • (2004) ACM SIGKDD 2004 , pp. 665-670
    • Popescul, A.1    Ungar, L.2
  • 21
    • 0003228830 scopus 로고    scopus 로고
    • Discovering test set regularities in relational domains
    • S. Slattery and T. Mitchell. Discovering test set regularities in relational domains. In ICML-2000, pages 895-902, 2000.
    • (2000) ICML-2000 , pp. 895-902
    • Slattery, S.1    Mitchell, T.2
  • 22
    • 0005500020 scopus 로고    scopus 로고
    • Predicate invention in inductive logic programming
    • I. Stahl. Predicate invention in inductive logic programming. In Advances in Inductive Logic Programming, pages 34-47. 1996.
    • (1996) Advances in Inductive Logic Programming , pp. 34-47
    • Stahl, I.1
  • 23
    • 1942418618 scopus 로고    scopus 로고
    • Discriminative probabilistic models for relational data
    • B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In UAI-2002, pages 485-492, 2002.
    • (2002) UAI-2002 , pp. 485-492
    • Taskar, B.1    Abbeel, P.2    Koller, D.3
  • 24
    • 84880884400 scopus 로고    scopus 로고
    • Probabilistic classification and clustering in relational data
    • B. Taskar, E. Segal, and D. Koller. Probabilistic classification and clustering in relational data. In IJCAI-2001, pages 870-878, 2001.
    • (2001) IJCAI-2001 , pp. 870-878
    • Taskar, B.1    Segal, E.2    Koller, D.3


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