메뉴 건너뛰기




Volumn 3, Issue , 2014, Pages 2695-2702

Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; OPTIMIZATION;

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

References (19)
  • 5
    • 34548748711 scopus 로고    scopus 로고
    • Weighted graph cuts without eigenvectors: A multilevel approach
    • Dhillon, Indeijit S., Guan, Yuqiang, and Kulis, Brian. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell., 29(11):1944-1957, 2007.
    • (2007) IEEE Trans. Pattern Anal. Mach. Intell. , vol.29 , Issue.11 , pp. 1944-1957
    • Dhillon, I.S.1    Guan, Y.2    Kulis, B.3
  • 6
    • 0024090156 scopus 로고
    • A new approach to the maximum-flow problem
    • Goldberg, Andrew V. and Tarjan, Robert E. A new approach to the maximum-flow problem. Journal of the ACM, 35(4):921-940, 1988.
    • (1988) Journal of the ACM , vol.35 , Issue.4 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 10
    • 84924178998 scopus 로고    scopus 로고
    • Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
    • Leskovec, Jure, Lang, Kevin J., Dasgupta, Anirban, and Mahoney, Michael W. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
    • (2009) Internet Mathematics , vol.6 , Issue.1 , pp. 29-123
    • Leskovec, J.1    Lang, K.J.2    Dasgupta, A.3    Mahoney, M.W.4
  • 12
    • 84869155042 scopus 로고    scopus 로고
    • A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
    • Mahoney, Michael W., Orecchia, Lorenzo, and Vishnoi, Nisheeth K. A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. Journal of Machine Learning Research, 13:2339-2365, 2012.
    • (2012) Journal of Machine Learning Research , vol.13 , pp. 2339-2365
    • Mahoney, M.W.1    Orecchia, L.2    Vishnoi, N.K.3
  • 13
    • 33749468596 scopus 로고    scopus 로고
    • Finding community structure in networks using the eigenvectors of matrices
    • Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74:036104, 2006.
    • (2006) Phys. Rev. E , vol.74 , pp. 036104
    • Newman, M.E.J.1
  • 17
    • 0000307001 scopus 로고
    • Solution of sparse rectangular systems using LSQR and CRAIG
    • Saunders, Michael A. Solution of sparse rectangular systems using LSQR and CRAIG. BIT Numerical Mathematics, 35(4): 588-604, 1995.
    • (1995) BIT Numerical Mathematics , vol.35 , Issue.4 , pp. 588-604
    • Saunders, M.A.1


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