메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Complexity of inference in Latent Dirichlet Allocation

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STATISTICS;

EID: 85162351232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (86)

References (18)
  • 1
    • 0037441926 scopus 로고    scopus 로고
    • Degeneracy in the maximum likelihood estimation of univariate Gaussian mixtures with em
    • ISSN 0167-7152
    • C. Biernacki and S. Chrétien. Degeneracy in the maximum likelihood estimation of univariate Gaussian mixtures with EM. Statist. Probab. Lett., 61(4):373-382, 2003. ISSN 0167-7152.
    • (2003) Statist. Probab. Lett. , vol.61 , Issue.4 , pp. 373-382
    • Biernacki, C.1    Chrétien, S.2
  • 2
    • 85161981998 scopus 로고    scopus 로고
    • Supervised topic models
    • J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, MIT Press, Cambridge, MA
    • D. Blei and J. McAuliffe. Supervised topic models. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Adv. in Neural Inform. Processing Syst. 20, pages 121-128. MIT Press, Cambridge, MA, 2008.
    • (2008) Adv. in Neural Inform. Processing Syst. , vol.20 , pp. 121-128
    • Blei, D.1    McAuliffe, J.2
  • 3
    • 0141607824 scopus 로고    scopus 로고
    • Latent Dirichlet allocation
    • ISSN 1532-4435
    • D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. J. Mach. Learn. Res., 3: 993-1022, 2003. ISSN 1532-4435.
    • (2003) J. Mach. Learn. Res. , vol.3 , pp. 993-1022
    • Blei, D.M.1    Ng, A.Y.2    Jordan, M.I.3
  • 4
    • 1842788824 scopus 로고    scopus 로고
    • Finding scientific topics
    • doi: 10.1073/pnas.0307752101
    • T. L. Griffiths and M. Steyvers. Finding scientific topics. Proc. Natl. Acad. Sci. USA, 101(Suppl 1):5228-5235, 2004. doi: 10.1073/pnas.0307752101.
    • (2004) Proc. Natl. Acad. Sci. USA , vol.101 , Issue.SUPPL. 1 , pp. 5228-5235
    • Griffiths, T.L.1    Steyvers, M.2
  • 5
    • 33644555811 scopus 로고    scopus 로고
    • The minimum-entropy set cover problem
    • ISSN 0304-3975
    • E. Halperin and R. M. Karp. The minimum-entropy set cover problem. Theor. Comput. Sci., 348 (2):240-250, 2005. ISSN 0304-3975. doi: http://dx.doi.org/10. 1016/j.tcs.2005.09.015.
    • (2005) Theor. Comput. Sci. , vol.348 , Issue.2 , pp. 240-250
    • Halperin, E.1    Karp, R.M.2
  • 6
    • 0000284439 scopus 로고
    • Consistency of the maximum likelihood estimator in the presence of infinitely many incidental parameters
    • ISSN 0003-4851
    • J. Kiefer and J. Wolfowitz. Consistency of the maximum likelihood estimator in the presence of infinitely many incidental parameters. Ann. Math. Statist., 27:887-906, 1956. ISSN 0003-4851.
    • (1956) Ann. Math. Statist. , vol.27 , pp. 887-906
    • Kiefer, J.1    Wolfowitz, J.2
  • 7
    • 0008815681 scopus 로고
    • Exponentiated gradient versus gradient descent for linear predictors
    • J. Kivinen and M. K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Inform. and Comput., 132, 1995.
    • (1995) Inform. and Comput. , vol.132
    • Kivinen, J.1    Warmuth, M.K.2
  • 9
    • 79957489009 scopus 로고    scopus 로고
    • DiscLDA: Discriminative learning for dimensionality reduction and classification
    • D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors
    • S. Lacoste-Julien, F. Sha, and M. Jordan. DiscLDA: Discriminative learning for dimensionality reduction and classification. In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Adv. in Neural Inform. Processing Syst. 21, pages 897-904. 2009.
    • (2009) Adv. in Neural Inform. Processing Syst. , vol.21 , pp. 897-904
    • Lacoste-Julien, S.1    Sha, F.2    Jordan, M.3
  • 10
    • 29244455873 scopus 로고    scopus 로고
    • Semi-supervised sequence modeling with syntactic topic models
    • AAAI Press
    • W. Li and A. McCallum. Semi-supervised sequence modeling with syntactic topic models. In Proc. of the 20th Nat. Conf. on Artificial Intelligence, volume 2, pages 813-818. AAAI Press, 2005.
    • (2005) Proc. of the 20th Nat. Conf. on Artificial Intelligence , vol.2 , pp. 813-818
    • Li, W.1    McCallum, A.2
  • 11
    • 37249086892 scopus 로고    scopus 로고
    • Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization
    • IEEE Computer Society, ISBN 0-7695-2720-5
    • L. Lovasz and S. Vempala. Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. In Proc. of the 47th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 57-68. IEEE Computer Society, 2006. ISBN 0-7695-2720-5.
    • (2006) Proc. of the 47th Ann IEEE Symp. on Foundations of Comput. Sci , pp. 57-68
    • Lovasz, L.1    Vempala, S.2
  • 13
    • 80053160955 scopus 로고    scopus 로고
    • Relative performance guarantees for approximate inference in latent Dirichlet allocation
    • D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors
    • I. Mukherjee and D. M. Blei. Relative performance guarantees for approximate inference in latent Dirichlet allocation. In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Adv. in Neural Inform. Processing Syst. 21, pages 1129-1136. 2009.
    • (2009) Adv. in Neural Inform. Processing Syst. , vol.21 , pp. 1129-1136
    • Mukherjee, I.1    Blei, D.M.2
  • 15
    • 0013169095 scopus 로고    scopus 로고
    • Combinatorial optimization
    • volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, ISBN 3-540-44389-4. Paths, flows, matchings, Chapters 1-38
    • A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. A, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003. ISBN 3-540-44389-4. Paths, flows, matchings, Chapters 1-38.
    • (2003) Polyhedra and Efficiency , vol.A
    • Schrijver, A.1
  • 17
    • 84864061876 scopus 로고    scopus 로고
    • A collapsed variational Bayesian inference algorithm for latent Dirichlet allocation
    • volume 19
    • Y. W. Teh, D. Newman, and M. Welling. A collapsed variational Bayesian inference algorithm for latent Dirichlet allocation. In Adv. in Neural Inform. Processing Syst. 19, volume 19, 2007.
    • (2007) Adv. in Neural Inform. Processing Syst. , vol.19
    • Teh, Y.W.1    Newman, D.2    Welling, M.3
  • 18
    • 0037686659 scopus 로고    scopus 로고
    • The concave-convex procedure
    • April. ISSN 0899-7667
    • A. L. Yuille and A. Rangarajan. The concave-convex procedure. Neural Comput., 15:915-936, April 2003. ISSN 0899-7667.
    • (2003) Neural Comput. , vol.15 , pp. 915-936
    • Yuille, A.L.1    Rangarajan, A.2


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