메뉴 건너뛰기




Volumn 24, Issue 3, 2012, Pages 700-723

Graph transduction as a noncooperative game

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84861152401     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00233     Document Type: Letter
Times cited : (48)

References (58)
  • 1
    • 34250754984 scopus 로고    scopus 로고
    • In W.W. Cohen & A. Moore (Eds.), Proc. 23rd Intl. Conf. Machine Learing, New York: ACM
    • Agarwal, S., Branson, K.,&Belongie, S. (2006). Higher order learning with graphs. In W.W. Cohen & A. Moore (Eds.), Proc. 23rd Intl. Conf. Machine Learing (pp. 17-24). New York: ACM.
    • (2006) Higher order learning with graphs , pp. 17-24
    • Agarwal, S.1    Branson, K.2    Belongie, S.3
  • 2
    • 33750729556 scopus 로고    scopus 로고
    • Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
    • Belkin, M., Niyogi, P., & Sindhwani, V. (2006).Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7, 2399-2434.
    • (2006) J. Mach. Learn. Res. , vol.7 , pp. 2399-2434
    • Belkin, M.1    Niyogi, P.2    Sindhwani, V.3
  • 3
    • 31844453456 scopus 로고    scopus 로고
    • In L. De Raedt & S. Wrobel (Eds.), Proc 22nd Intl. Conf. on Machine Learning, New York: ACM
    • Breitenbach, M., & Grudic, G. Z. (2005). Clustering through ranking on manifolds. In L. De Raedt & S. Wrobel (Eds.), Proc 22nd Intl. Conf. on Machine Learning (pp. 73-80). New York: ACM.
    • (2005) Clustering through ranking on manifolds , pp. 73-80
    • Breitenbach, M.1    Grudic, G.Z.2
  • 5
    • 84861175663 scopus 로고    scopus 로고
    • In L. De Raedt & S. Wrobel (Eds.), Proc. 22nd Intl. Conf. on Machine Learning, Philadelphia: SIAM
    • Daskalakis, C. (2011). On the complexity of approximating a Nash equilibrium. In L. De Raedt & S. Wrobel (Eds.), Proc. 22nd Intl. Conf. on Machine Learning (pp. 73-80). Philadelphia: SIAM.
    • (2011) On the complexity of approximating a Nash equilibrium , pp. 73-80
    • Daskalakis, C.1
  • 6
    • 58849134355 scopus 로고    scopus 로고
    • The complexity of computing a Nash equilibrium
    • Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009). The complexity of computing a Nash equilibrium. Commun. ACM, 52(2), 89-97.
    • (2009) Commun. ACM , vol.52 , Issue.2 , pp. 89-97
    • Daskalakis, C.1    Goldberg, P.W.2    Papadimitriou, C.H.3
  • 7
    • 0008723917 scopus 로고
    • A program for finding Nash equilibria
    • Dickhaut, J., & Kaplan, T. (1991). A program for finding Nash equilibria. Math. J., 1(4), 87-93.
    • (1991) Math. J. , vol.1 , Issue.4 , pp. 87-93
    • Dickhaut, J.1    Kaplan, T.2
  • 10
    • 0035363672 scopus 로고    scopus 로고
    • From few to many: Illumination cone models for face recognition under variable lighting and pose
    • Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001). From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell., 23, 643-660.
    • (2001) IEEE Trans. Pattern Anal. Mach. Intell. , vol.23 , pp. 643-660
    • Georghiades, A.S.1    Belhumeur, P.N.2    Kriegman, D.J.3
  • 11
    • 77951295401 scopus 로고    scopus 로고
    • Dinkelbach NCUT: An efficient framework for solving normalized cuts problems with priors and convex constraints
    • Ghanem, B., & Ahuja, N. (2010). Dinkelbach NCUT: An efficient framework for solving normalized cuts problems with priors and convex constraints. Int. J. Comput. Vis., 89, 40-55.
    • (2010) Int. J. Comput. Vis. , vol.89 , pp. 40-55
    • Ghanem, B.1    Ahuja, N.2
  • 12
    • 84861171252 scopus 로고    scopus 로고
    • In M. Melia & X. Shen (Eds.), Proc. 11th Intl. Conf. on Artificial Intelligence and Statistics. N.p.: Society for Artificial Intelligence and Statistics
    • Goldberg, A., Zhu, X., & Wright, S. (2007). Dissimilarity in graph-based semisupervised classification. In M. Melia & X. Shen (Eds.), Proc. 11th Intl. Conf. on Artificial Intelligence and Statistics. N.p.: Society for Artificial Intelligence and Statistics.
    • (2007) Dissimilarity in graph-based semisupervised classification
    • Goldberg, A.1    Zhu, X.2    Wright, S.3
  • 13
    • 0038009937 scopus 로고    scopus 로고
    • A global Newton method to compute Nash equilibria
    • Govindan, S., &Wilson, R. (2003). A global Newton method to compute Nash equilibria. J. Econ. Theory, 110, 65-86.
    • (2003) J. Econ. Theory , vol.110 , pp. 65-86
    • Govindan, S.1    Wilson, R.2
  • 17
    • 0011697387 scopus 로고
    • Equilibria of polymatrix games
    • Howson, J. T. (1972). Equilibria of polymatrix games. Management Science, 18, 312-318.
    • (1972) Management Science , vol.18 , pp. 312-318
    • Howson, J.T.1
  • 19
    • 0034204827 scopus 로고    scopus 로고
    • Classification with nonmetric distances: Image retrieval and class representation
    • Jacobs, D. W., Weinshall, D., & Gdalyahu, Y. (2000). Classification with nonmetric distances: Image retrieval and class representation. IEEE Trans. Pattern Anal.Mach. Intell., 22, 583-600.
    • (2000) IEEE Trans. Pattern Anal.Mach. Intell. , vol.22 , pp. 583-600
    • Jacobs, D.W.1    Weinshall, D.2    Gdalyahu, Y.3
  • 21
    • 71149102018 scopus 로고    scopus 로고
    • In A. P. Danyluk, L. Bottou, & M. L. Littman (Eds.), Proc. 26th Intl. Conf. on Machine Learning, New York: ACM
    • Jebara, T., Wang, J., & Chang, S. (2009). Graph construction and b-matching for semisupervised learning. In A. P. Danyluk, L. Bottou, & M. L. Littman (Eds.), Proc. 26th Intl. Conf. on Machine Learning (pp. 441-448). New York: ACM.
    • (2009) Graph construction and b-matching for semisupervised learning , pp. 441-448
    • Jebara, T.1    Wang, J.2    Chang, S.3
  • 23
    • 1942484960 scopus 로고    scopus 로고
    • T.Fawcett&N. Mishra (Eds.), Proc. 20th Intl. Conf. onMachine Learning (pp. 290-297). Cambridge, MA: AAAI Press
    • Joachims, T. (2003). Transductive learning via spectral graph partitioning. In T.Fawcett&N. Mishra (Eds.), Proc. 20th Intl. Conf. onMachine Learning (pp. 290-297). Cambridge, MA: AAAI Press.
    • (2003) Transductive learning via spectral graph partitioning , pp. 290-297
    • Joachims, T.1
  • 25
    • 0000176354 scopus 로고
    • Equilibrium points of bimatrix games
    • Mangasarian, O. (1964). Equilibrium points of bimatrix games. J. Soc. Ind. Appl. Math., 12, 778-780.
    • (1964) J. Soc. Ind. Appl. Math. , vol.12 , pp. 778-780
    • Mangasarian, O.1
  • 29
    • 0009685688 scopus 로고
    • Copositive-plus Lemke algorithm solves polymatrix games
    • Miller, D. A., & Zucker, S.W. (1991). Copositive-plus Lemke algorithm solves polymatrix games. Operations Research Letters, 10, 285-290.
    • (1991) Operations Research Letters , vol.10 , pp. 285-290
    • Miller, D.A.1    Zucker, S.W.2
  • 31
    • 0001730497 scopus 로고
    • Non-cooperative games
    • Nash, J. (1951). Non-cooperative games. Annals of Mathematics, 54, 286-295.
    • (1951) Annals of Mathematics , vol.54 , pp. 286-295
    • Nash, J.1
  • 33
    • 0035328421 scopus 로고    scopus 로고
    • Modeling the shape of the scene: A holistic representation of the spatial envelope
    • Oliva, A., & Torralba, A. (2001). Modeling the shape of the scene: A holistic representation of the spatial envelope. Int. J. Comput. Vis., 42, 145-175.
    • (2001) Int. J. Comput. Vis. , vol.42 , pp. 145-175
    • Oliva, A.1    Torralba, A.2
  • 35
    • 0031246228 scopus 로고    scopus 로고
    • The dynamics of nonlinear relaxation labeling processes
    • Pelillo, M. (1997). The dynamics of nonlinear relaxation labeling processes. J. Math. Imaging Vis., 7, 309-323.
    • (1997) J. Math. Imaging Vis. , vol.7 , pp. 309-323
    • Pelillo, M.1
  • 36
    • 0033570815 scopus 로고    scopus 로고
    • Replicator equations, naximal cliques, and graph isomorphism
    • Pelillo, M. (1999). Replicator equations, naximal cliques, and graph isomorphism. Neural Computation, 11, 1933-1955.
    • (1999) Neural Computation , vol.11 , pp. 1933-1955
    • Pelillo, M.1
  • 39
    • 78650872285 scopus 로고    scopus 로고
    • Infection and immunization: A new class of evolutionary game dynamics
    • Rota Bulò, S., & Bomze, I. M. (2011). Infection and immunization: A new class of evolutionary game dynamics. Games and Economic Behaviour, 71, 193-211.
    • (2011) Games and Economic Behaviour , vol.71 , pp. 193-211
    • Rota Bulò, S.1    Bomze, I.M.2
  • 40
    • 80052667004 scopus 로고    scopus 로고
    • In Y. Bengio, D. Schuurmans, J. Lafferty, C.K.I.Williams, & A. Culotta (Eds.), Advances in neural information processing systems, 22, Cambridge, MA: MIT Press
    • Rota Bulò S., & Pelillo, M. (2009). A game-theoretic approach to hypergraph clustering. In Y. Bengio, D. Schuurmans, J. Lafferty, C.K.I.Williams, & A. Culotta (Eds.), Advances in neural information processing systems, 22 (pp. 1571-1579). Cambridge, MA: MIT Press.
    • (2009) A game-theoretic approach to hypergraph clustering , pp. 1571-1579
    • Rota Bulò, S.1    Pelillo, M.2
  • 43
    • 36348935562 scopus 로고    scopus 로고
    • In Proc. 22nd AAAI Conf. on Artificial Intelligence, Cambridge, MA: MIT Press
    • Tong, W., & Jin, R. (2007). semisupervised learning by mixed label propagation. In Proc. 22nd AAAI Conf. on Artificial Intelligence (pp. 651-656). Cambridge, MA: MIT Press.
    • (2007) semisupervised learning by mixed label propagation , pp. 651-656
    • Tong, W.1    Jin, R.2
  • 45
    • 58149411184 scopus 로고
    • Features of similarity
    • Tversky, A. (1977). Features of similarity. Psychological Review, 84, 327-352.
    • (1977) Psychological Review , vol.84 , pp. 327-352
    • Tversky, A.1
  • 46
    • 0001081294 scopus 로고
    • Simplicial variable dimension 1987 for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling
    • van der Laan, G., Talman, A., & van der Heyden, L. (1987). Simplicial variable dimension 1987 for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Math. Operations Res., 12, 377-397.
    • (1987) Math. Operations Res. , vol.12 , pp. 377-397
    • van der Laan, G.1    Talman, A.2    van der Heyden, L.3
  • 48
    • 0002680001 scopus 로고
    • In P. H. Winston (Ed.), The psychology of computer vision, New York: McGraw- Hill
    • Waltz, D. L. (1975). Understanding line drawings of scenes with shadows. In P. H. Winston (Ed.), The psychology of computer vision (pp. 19-92). New York: McGraw- Hill.
    • (1975) Understanding line drawings of scenes with shadows , pp. 19-92
    • Waltz, D.L.1
  • 51
    • 70450187127 scopus 로고    scopus 로고
    • Fast normalized cut with linear constraints
    • Xu, L., Li, W., & Schuurmans, D. (2009). Fast normalized cut with linear constraints. In CVPR, 2866-2873.
    • (2009) In CVPR , pp. 2866-2873
    • Xu, L.1    Li, W.2    Schuurmans, D.3
  • 52
    • 0344551898 scopus 로고    scopus 로고
    • In Proc. IEEE Conf. onComputer Vision and Pattern Recognition ., Piscataway, NJ: IEEE
    • Yu, S.X.,&Shi, J. (2003).Multiclass spectral clustering. In Proc. IEEE Conf. onComputer Vision and Pattern Recognition (pp. 313-319). Piscataway, NJ: IEEE.
    • (2003) Multiclass spectral clustering , pp. 313-319
    • Yu, S.X.1    Shi, J.2
  • 53
    • 0742321103 scopus 로고    scopus 로고
    • Segmentation given partial grouping constraints
    • Yu, S. X., & Shi, J. (2004). Segmentation given partial grouping constraints. IEEE Trans. Pattern Anal. Mach. Intell., 26, 173-183.
    • (2004) IEEE Trans. Pattern Anal. Mach. Intell. , vol.26 , pp. 173-183
    • Yu, S.X.1    Shi, J.2
  • 56
    • 84864027458 scopus 로고    scopus 로고
    • In J. C. Platt, D. Koller, Y. Singer, & S. Roweis (Eds.), Advances in neural information processing systems, 20, Cambridge, MA: MIT Press
    • Zhou, D., Huang, J., & Scḧolkopf, B. (2007). Learning with hypergraphs: Clustering, classification, and embedding. In J. C. Platt, D. Koller, Y. Singer, & S. Roweis (Eds.), Advances in neural information processing systems, 20 (pp. 1601-1608). Cambridge, MA: MIT Press.
    • (2007) Learning with hypergraphs: Clustering, classification, and embedding , pp. 1601-1608
    • Zhou, D.1    Huang, J.2    Scḧolkopf, B.3
  • 57
    • 33745456231 scopus 로고    scopus 로고
    • Tech. Rep. No. 1530. Madison: Computer Sciences, University ofWisconsin-Madison
    • Zhu, X. (2005). Semi-supervised learning literature survey (Tech. Rep. No. 1530). Madison: Computer Sciences, University ofWisconsin-Madison.
    • (2005) Semi-supervised learning literature survey
    • Zhu, X.1


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