연구동향 분석
박사

그래프에서 최대최소 경로를 활용하는 기계학습 알고리즘 연구 : Learning with Minimax Paths on Graphs

김계현 2015년

논문상세정보
인용/피인용
' 그래프에서 최대최소 경로를 활용하는 기계학습 알고리즘 연구 : Learning with Minimax Paths on Graphs' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • machine learning
  • semi-supervised learning
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
918 0

0.0%

' 그래프에서 최대최소 경로를 활용하는 기계학습 알고리즘 연구 : Learning with Minimax Paths on Graphs' 의 참고문헌

  • Y. Li, J. Sun, C. K. Tang, H. Y. Shum, Lazy snapping, in: Proceedings of the ACM SIGGRAPH, 2004.
  • Y. Bengio, O. Delalleau, N. Le Roux, Label propagation and quadratic criterion, in: Semi-Supervised Learning, MIT Press, 2006, pp. 193?216.
  • X. Zhu, Z. Ghahramani, J. Lafferty, Semi-supervised learning using Gaussian fields and harmonic functions, in: Proceedings of the International Conference on Machine Learning (ICML), 2003, pp. 912?919.
  • X. Zhu, Semi-supervised learning literature survey, Tech. Rep. TR-1530, University of Wisconsin-Madison (2008).
  • X. Zhu, J. Lafferty, Harmonic mixtures: Combining mixture models and graph-based methods for inductive and scalable semi-supervised learning, in: Proceedings of the International Conference on Machine Learning (ICML), 2005, pp. 1052?1059.
  • X. Bai, G. Sapiro, Geodesic matting: A framework for fast interactive image and video segmentation and matting, International Journal of Computer Vision 82 (2) (2009) 113?132.
  • W. Liu, J. He, S. F. Chang, Large graph construction for scalable semi-supervised learning, in: Proceedings of the International Conference on Machine Learning (ICML), 2010.
  • T. Kalisky, S. Sreenivasan, L. A. Braunstein, S. V. Buldyrev, S. Havlin, H. E. Stanley, Scale-free properties of weighted random graphs: Minimum spanning trees and percolation, in: AIP Conference Proceedings, 2005.
  • T. Hastie, R. Tibshirani, Discriminant adaptive nearest neighbor classification, IEEE Trans. Pattern Analysis and Machine Intelligence 18 (6) (1996) 607?616.
  • S. Winder, M. Brown, Learning local image descriptors, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2007.
  • S. C. H. Hoi, W. Liu, S. F. Chang, Semi-supervised distance metric learning for collaborative image retrieval, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2008.
  • S. A. Nene, S. K. Nayar, H. Murase, Columbia object image library (COIL-100), Tech. Rep. CUCS-006-96, Department of Computer Science, Columbia University (1996).
  • R. Fergus, Y. Weiss, A. Torralba, Semi-supervised learning in gigantic image collections, in: Advances in Neural Information Processing Systems (NIPS), 2009.
  • R. B. Zadeh, S. Ben-David, A uniqueness theorem for clustering, in: Proceedings of the International Conference on Uncertainty in Artificial Intelligence (UAI), 2009, pp.639?646.
  • P. Chebotarev, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, Discrete Applied Mathematics 159 (5) (2011) 295?302.
  • O. Delalleau, Y. Bengio, N. L. Roux, Efficient non-parametric function induction in semi-supervised learning, in: Proceedings of the International Workshop on Artificial Intelligence and Statistics (AISTATS), 2005, pp. 96?103.
  • O. Chapelle, B. Sch olkopf, A. Zien (Eds.), Semi-Supervised Learning, MIT Press,2006.
  • M. Szummer, T. Jaakkola, Partially labeled classification with Markov random walks, in: Advances in Neural Information Processing Systems (NIPS), Vol. 14, MIT Press, 2002.
  • M. Pollack, The maximum capacity through a network, Operation Research 8 (5) (1960) 733?736.
  • M. Muja, D. G. Lowe, Fast approximate nearest neighbors with automatic algorithm configuration, in: Proceedings of the International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISAPP), 2009.
  • M. L. Fredman, R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM 34 (3) (1987) 596?615.
  • M. Belkin, P. Niyogi, V. Sindhwani, Manifold regularization: A geometric framework for learning examples, Journal of Machine Learning Research 7 (2006) 2399?2434.
  • L. Yen, F. Fouss, C. Decaestecker, P. Francq, M. Saerens, Graph nodes clustering with the sigmoid commute-time kernel: A comparative study, Data & Knowledge Engineering 68 (3) (2009) 338?361.
  • L. Yen, A. Mantrach, M. Shimbo, A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances, in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, Las Vegas, Nevada, USA, 2008, pp. 785?793.
  • L. Si, R. Jin, S. C. H. Hoi, M. R. Lyu, Collaborative image retrieval via regularized metric learning, Multimedia Systems 12 (1) (2006) 34?44.
  • L. Bo, K. Lai, X. Ren, Object recognition with hierarchical kernel descriptors, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2011.
  • L. A. Braunstein, S. V. Buldyrev, R. Cohen, S. Havlin, H. E. Stanley, Optimal paths in disordered complex networks, Physics Review Letters 91 (16).
  • K. Zhang, J. T. Kwok, B. Parvin, Prototype vector machine for large scale semisupervised learning, in: Proceedings of the International Conference on Machine Learning (ICML), 2009, pp. 1233?1240.
  • K. Q. Weinberger, J. Blitzer, L. K. Saul, Distance metric learning for large margin nearest neighbor classification, in: Advances in Neural Information Processing Systems (NIPS), Vol. 18, MIT Press, 2006.
  • K. Kavukcuoglu, M. Ranzato, R. Fergus, Y. LeCun, Learning invariant features through topographic filter maps, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2009.
  • K. H. Kim, S. Choi, Walking on minimax paths for k-nn search, in: Proceedings of the AAAI National Conference on Artificial Intelligence (AAAI), AAAI, Bellevue, Washington, USA, 2013, pp. 518?525.
  • K. H. Kim, S. Choi, Neighbor search with global geometry: A minimax message passing algorithm, in: Proceedings of the International Conference on Machine Learning (ICML), Corvallis, Oregon, 2007.
  • K. H. Kim, S. Choi, Label propagation through minimax paths for scalable semisupervised learning, Pattern Recognition Letters 45 (2014) 17?25.
  • K. C. Lee, J. Ho, D. Kriegman, Acquiring linear subspaces for face recognition under variable lighting, IEEE Trans. Pattern Analysis and Machine Intelligence 27 (5) (2005) 1?15.
  • J. S. Beis, D. G. Lowe, Shape indexing using approximate nearest-neighbour search in high-dimensional spaces, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, San Juan, Puerto Rico, 1997, pp. 1000?1006.
  • J. Philbin, O. Chum, M. Isard, J. Sivic, A. Zisserman, Object retrieval with large vocabularies and fast spatial matching, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2007.
  • J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Francisco, CA, 1988.
  • J. Goldberger, S. Roweis, G. Hinton, R. Salakhutdinov, Neighbourhood components analysis, in: Advances in Neural Information Processing Systems (NIPS), Vol. 17,MIT Press, 2005, pp. 513?520.
  • J. Garcke, M. Griebel, Semi-supervised learning with sparse grids, in: Proceedings of ICML, Workshop on Learning with Partially Classified Training Data, 2005, pp.19?28.
  • J. D. Carroll, Minimax length links of a dissimilarity matrix and minimum spanning trees, Psychometrika 60 (1995) 371?374.
  • J. C. Gower, G. J. S. Ross, Minimum spanning tree and single-linkage cluster analysis, Applied Statistics 18 (1969) 54?64.
  • J. B. Tenenbaum, V. de Silva, J. C. Langford, A global geometric framework for nonlinear dimensionality reduction, Science 290 (2000) 2319?2323.
  • J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman roblem, Proceedings of the American Mathematical Society 7 (1) (1956) 48?50.
  • H.W. Corley, H. Golnabi, Minimax trees, paths, and cut sets, Naval Research Logistic Quarterly 30 (4) (1983) 665?666.
  • H. Samet, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann Publishers Inc., San Francisco, California, USA, 2005.
  • H. Mobahi, R. Collobert, J.Weston, Deep learning from temporal coherence in video,in: Proceedings of the International Conference on Machine Learning (ICML), ACM, Montreal, Canada, 2009, pp. 737?744.
  • H. Luo, C. Niu, R. Shen, C. Ullrich, A collaborative filtering framework based on both local user similarity and global user similarity, Machine Learning 72 (3) (2008) 231?245.
  • H. Chang, D. Y. Yeung, Locally linear metric adaptation for semi-supervised clustering, in: Proceedings of the International Conference on Machine Learning (ICML), 2004, pp. 153?160.
  • F. Wang, C. Zhang, Label propagation through linear neighborhoods, in: Proceedings of the International Conference on Machine Learning (ICML), Pittsburgh, PA, 2006.
  • F. R. Kschischang, B. J. Frey, H. A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Trans. Information Theory 47 (2) (2001) 498?519.
  • F. Fouss, K. Francoisse, L. Yen, A. Pirotte, M. Saerens, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Neural Networks 31 (2012) 53?72.
  • F. Fouss, A. Pirotte, J. M. Renders, M. Saerens, Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, IEEE Trans. Knowledge and Data Engineering 19 (3) (2007) 355?369.
  • E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959) 269?271.
  • E. P. Xing, A. Y. Ng, M. I. Jordan, S. Russel, Distance metric learning, with application to clustering with side-information, in: Advances in Neural Information Processing Systems (NIPS), Vol. 15, MIT Press, 2003.
  • D. Zhou, O. Bousquet, T. N. Lal, J. Weston, B. Sch olkopf, Learning with local and global consistency, in: Advances in Neural Information Processing Systems (NIPS), Vol. 16, MIT Press, 2004, pp. 321?328.
  • D. Zhou, J. Weston, A. Gretton, O. Bousquet, B. Sch olkopf, Ranking on data manifolds, in: Advances in Neural Information Processing Systems (NIPS), Vol. 16, MIT Press, 2004, pp. 169?176.
  • D. Zhou, B. Sch olkopf, Learning from labeled and unlabeled data using random walks, in: Proceedings of the 26th DAGM Pattern Recognition Symposium, 2004, pp. 237?244.
  • D. G. Lowe, Object recognition from local scale-invariant features, in: Proceedings of the International Conference on Computer Vision (ICCV), 1999.
  • C. Domeniconi, J. Peng, D. Gunopulos, Locally adaptive metric nearest-neighbor classificaton, IEEE Trans. Pattern Analysis and Machine Intelligence 24 (2002) 1281?1285.
  • B. L. Price, B. S. Morse, S. Cohen, Geodesic graph cut for interactive image segmentation, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2010.
  • A. Singh, R. D. Nowak, X. Zhu, Unlabeled data: Now it helps, now it doesn t, in: Advances in Neural Information Processing Systems (NIPS), Vol. 22, MIT Press, 2008, pp. 1513?1520.
  • A. S. Georghiades, P. N. Belhumeur, D. J. Kriegman, From few to many: Illumination cone models for face recognition under variable lighting and pose, IEEE Trans. Pattern Analysis and Machine Intelligence 23 (6) (2001) 643?660.
  • A. Mantrach, L. Yen, J. Callut, K. Francoisse, M. Shimbo, M. Saerens, The sum-overpaths covariance kernel: A novel covariance measure between nodes of a directed graph, IEEE Trans. Pattern Analysis and Machine Intelligence 32 (6) (2010) 338?361.
  • A. Blum, S. Chawla, Learning from labeled and unlabeled data using graph mincuts, in: Proceedings of the International Conference on Machine Learning (ICML), 2001.
  • ?K. Q.Weinberger, L. K. Saul, Distance metric learning for large margin nearest neighbor classification, Journal of Machine Learning Research 10 (2009) 207?244.