메뉴 건너뛰기




Volumn 37, Issue 12, 2010, Pages 7870-7879

Graph sharpening

Author keywords

Machine learning; Semi supervised learning

Indexed keywords

GRAPHIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; SUPERVISED LEARNING;

EID: 77957842081     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.04.050     Document Type: Article
Times cited : (16)

References (40)
  • 1
    • 2942534292 scopus 로고    scopus 로고
    • Connecting the protein structure universe by using sparse recurring fragments
    • Adai, A., Date, S., Wieland, S., & Marcotte, E. (2004). Connecting the protein structure universe by using sparse recurring fragments. Journal of Molecular Biology, 340(1), 179-190.
    • (2004) Journal of Molecular Biology , vol.340 , Issue.1 , pp. 179-190
    • Adai, A.1    Date, S.2    Wieland, S.3    Marcotte, E.4
  • 5
    • 84898946656 scopus 로고    scopus 로고
    • Using manifold structure for partially labelled classification
    • S. Becker, S. Thrun, & K. Obermayer (Eds.), MIT Press
    • Belkin, M., & Niyogi, P. (2003). Using manifold structure for partially labelled classification. In S. Becker, S. Thrun, & K. Obermayer (Eds.). Advances in neural information processing systems (NIPS) (Vol. 15). MIT Press.
    • (2003) Advances in Neural Information Processing Systems (NIPS) , vol.15
    • Belkin, M.1    Niyogi, P.2
  • 8
    • 50649084677 scopus 로고    scopus 로고
    • Cluster kernels for semi-supervised learning
    • S. Becker, S. Thrun, & K. Obermayer (Eds.), MIT Press
    • Chapelle, O., Weston, J., & Scholkopf, B. (2003). Cluster kernels for semi-supervised learning. In S. Becker, S. Thrun, & K. Obermayer (Eds.). Advances in neural information processing systems (NIPS) (Vol. 15, pp. 585-592). MIT Press.
    • (2003) Advances in Neural Information Processing Systems (NIPS) , vol.15 , pp. 585-592
    • Chapelle, O.1    Weston, J.2    Scholkopf, B.3
  • 9
    • 85030578548 scopus 로고    scopus 로고
    • Number 92 Regional Conference Series in Mathematics. Providence, RI: American Mathematical Society
    • Chung, F. (1997). Spectral graph theory. Number 92 Regional Conference Series in Mathematics. Providence, RI: American Mathematical Society.
    • (1997) Spectral Graph Theory
    • Chung, F.1
  • 13
    • 29644438050 scopus 로고    scopus 로고
    • Statistical comparisons of classifiers over multiple data sets
    • Demsar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1-30. (Pubitemid 43022939)
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1-30
    • Demsar, J.1
  • 15
    • 33748776559 scopus 로고    scopus 로고
    • Automated protein function prediction - The genomic challenge
    • Friedberg, I. (2006). Automated protein function prediction - The genomic challenge. Briefings in Bioinformatics, 7(3), 225-242.
    • (2006) Briefings in Bioinformatics , vol.7 , Issue.3 , pp. 225-242
    • Friedberg, I.1
  • 16
    • 23444459516 scopus 로고    scopus 로고
    • Connecting the protein structure universe by using sparse recurring fragments
    • Friedberg, I., & Godzik, A. (2005). Connecting the protein structure universe by using sparse recurring fragments. Structure, 13(8), 1213-1224.
    • (2005) Structure , vol.13 , Issue.8 , pp. 1213-1224
    • Friedberg, I.1    Godzik, A.2
  • 20
    • 33744491016 scopus 로고    scopus 로고
    • Recurrent use of evolutionary importance for functional annotation of proteins based on local structural similarity
    • Kristensen, D. M., Chen, B. Y., Fofanov, V. Y., Ward, R. M., Lisewski, A. M., Kimmel, M., et al. (2006). Recurrent use of evolutionary importance for functional annotation of proteins based on local structural similarity. Protein Science, 15(6), 1530-1536.
    • (2006) Protein Science , vol.15 , Issue.6 , pp. 1530-1536
    • Kristensen, D.M.1    Chen, B.Y.2    Fofanov, V.Y.3    Ward, R.M.4    Lisewski, A.M.5    Kimmel, M.6
  • 22
    • 0029913807 scopus 로고
    • An evolutionary trace method defines binding surfaces common to protein families
    • Lichtarge, O., Bourne, H., & Cohen, F. (1995). An evolutionary trace method defines binding surfaces common to protein families. Journal of Molecular Biology, 257(2), 342-358.
    • (1995) Journal of Molecular Biology , vol.257 , Issue.2 , pp. 342-358
    • Lichtarge, O.1    Bourne, H.2    Cohen, F.3
  • 23
    • 33845885769 scopus 로고    scopus 로고
    • Rapid detection of similarity in protein structure and function through contact metric distances
    • Lisewski, A. M., & Lichtarge, O. (2006). Rapid detection of similarity in protein structure and function through contact metric distances. Nucleic Acids Research, 34(22), e152.
    • (2006) Nucleic Acids Research , vol.34 , Issue.22
    • Lisewski, A.M.1    Lichtarge, O.2
  • 26
    • 36549013593 scopus 로고    scopus 로고
    • Graph sharpening plus graph integration: A synergy that improves protein functional classification
    • Shin, H., Lisewski, A. M., & Lichtarge, O. (2007). Graph sharpening plus graph integration: A synergy that improves protein functional classification. Bioinformatics, 23(23), 3217-3224.
    • (2007) Bioinformatics , vol.23 , Issue.23 , pp. 3217-3224
    • Shin, H.1    Lisewski, A.M.2    Lichtarge, O.3
  • 27
    • 56349128167 scopus 로고    scopus 로고
    • Protein functional class prediction with a combined graph
    • Shin, H., Tsuda, K., & Scholkopf, B. (2009). Protein functional class prediction with a combined graph. Expert Systems with Applications, 36(2), 3284-3292.
    • (2009) Expert Systems with Applications , vol.36 , Issue.2 , pp. 3284-3292
    • Shin, H.1    Tsuda, K.2    Scholkopf, B.3
  • 31
    • 4544280485 scopus 로고    scopus 로고
    • Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
    • ACM Press
    • Spielman, D., & Teng, S. (2004). Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 26th annual ACM symposium on theory of computing (pp. 81-90). ACM Press.
    • (2004) Proceedings of the 26th Annual ACM Symposium on Theory of Computing , pp. 81-90
    • Spielman, D.1    Teng, S.2
  • 32
    • 21844471282 scopus 로고    scopus 로고
    • Matrix exponentiated gradient updates for on-line learning and bregman projection
    • Tsuda, K., Ratsch, G., & Warmuth, M. (2005). Matrix exponentiated gradient updates for on-line learning and bregman projection. Journal of Machine Learning Research, 6, 995-1018.
    • (2005) Journal of Machine Learning Research , vol.6 , pp. 995-1018
    • Tsuda, K.1    Ratsch, G.2    Warmuth, M.3
  • 33
    • 27544435126 scopus 로고    scopus 로고
    • Fast protein classification with multiple networks
    • Tsuda, K., Shin, H., & Scholkopf, B. (2005). Fast protein classification with multiple networks. Bioinformatics, 59-65.
    • (2005) Bioinformatics , pp. 59-65
    • Tsuda, K.1    Shin, H.2    Scholkopf, B.3
  • 36
    • 0032726692 scopus 로고    scopus 로고
    • Protomap: Automatic classification of protein sequences, a hierarchy of protein families, and local maps of the protein space
    • Yona, G., Linial, N., & Linial, M. (1999). Protomap: Automatic classification of protein sequences, a hierarchy of protein families, and local maps of the protein space. Proteins: Structure, Function, and Genetics, 37, 360-678.
    • (1999) Proteins: Structure, Function, and Genetics , vol.37 , pp. 360-678
    • Yona, G.1    Linial, N.2    Linial, M.3
  • 40
    • 34447292952 scopus 로고    scopus 로고
    • Fast: A novel protein structure alignment algorithm
    • Zhu, J., & Weng, Z. (2005). Fast: A novel protein structure alignment algorithm. Proteins, 14, 417-423.
    • (2005) Proteins , vol.14 , pp. 417-423
    • Zhu, J.1    Weng, Z.2


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