Discriminative learning of max-sum classifiers

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 67-104

  Franc, Vojtěch ^a,c   Savchynskyy, Bogdan ^b  

^a FRAUNHOFER FIRST   (Germany)

^b Intl Res/Train Ctr Info T/S   (Ukraine)

^c CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Hidden markov networks; Max xum classifier; Support vector machines

Indexed keywords

LEARNING ALGORITHMS; LINEAR PROGRAMMING; MARKOV PROCESSES; MAXIMUM LIKELIHOOD; PARAMETER ESTIMATION;

HIDDEN MARKOV NETWORKS; MAX-XUM CLASSIFIER; QUALITY FUNCTIONS; RANDOM MARKOV FIELD;

SUPPORT VECTOR MACHINES;

EID: 38949112095     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. Y. Altun and T. Hofmann. Large margin methods for label sequence learning. In European Conference on Speech Communication and Technology (EuroSpeech), 2003.
2. Y. Altun, I. Tsochantaridis, and T. Hofmann. Hidden markov support vector machines. In International Conference on Machine Learning. ACM Press, New York, 2003.
3. D. Anguelov, B. Taskar, V. Chatabashev, D. Koller, D. Gupta, G. Heitz, and A. Ng. Discriminative learning of markov random fields for segmentation of 3D scan data. In International Conference on Computer Vision and Pattern Recognition, pages 167-176. IEEE Computer Society, Washington, DC, 2005.
4. J. Besag. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society, 48: 259-302, 1986.
5. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9): 1124-1137, Sept. 2004.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11): 1222-1239, Nov. 2001.
7. C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Symposium on Discrete Algorithms, pages 109-118, 2001.
8. P.B. Chou and C.M. Brown. The theory and practice of bayesian image labeling. International Journal on Computer Vision, 4(3):185-210, June 1990.
9. M. Collins. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Conference on Empirical Methods in Natural Language Processing, pages 1-8, 2002.
10. K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2:265-292, Dec. 2001.
11. T. Finley and T. Joachims. Supervised clustering with support vector machines. In International Conference on Machine Learning, pages 217-224. ACM Press, New York, 2005.
12. R. M. Haralick and L. G. Shapiro. The consistent labeling problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(2):173-184, 1979.
13. G. E. Hinton and T. J. Sejnowski. Learning and relearning in boltzmann machines. In Parallel Distributed Processing: Explorations in the Microstructure of Cognition, volume 1, pages 282-317. MIT Press, Cambridge, 1986.
14. M. Jerrum and A. Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal of Computing, 22:1087-1116, 1993.
15. V. Kolmogorov. Convergent tree-reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10): 1568-1583, 2006.
16. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In European Conference on Computer Vision, pages 65-81. Springer-Verlag, 2002.
17. A. Koster, C. P. M. Hoesel, and A. W. J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 23(3-5):89-97, 1998.
18. V.A. Koval and M.I. Schlesinger. Dvumernoe programmirovanie v zadachakh analiza izobrazheniy (two-dimensional programming in image analysis problems). USSR Academy of Science, Automatics and Telemechanics, 8:149-168, 1976. In Russian.
19. I. Kovtun. Segmentaciya Zobrazhen na Usnovi Dostatnikh Umov Optimalnosti v NP-povnikh Klasakh Zadach Strukturnoi Rozmitki (Image Segmentation Based on Sufficient Conditions Of Optimality in NP-complete Classes of Structural Labeling Problems). PhD thesis, IRTC ITS Nat. Academy of Science Ukraine, Kiev, 2004. In Ukrainian.
20. A. Novikoff. On convergence proofs of perceptions. In Symposium on Mathematical Theory of Automata, volume 12, pages 615-622. Polytechnic Institute of Brooklyn, 1962.
21. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco, CA, USA, 1988.
22. N.D. Ratliff and J.A. Bagnell. Subgradient methods for maximum margin structured learning. In ICML Workshop on Learning in Structured Output Spaces, 2006.
23. A. Rosenfeld, R. A. Hummel, and S. W. Zucker. Scene labeling by relaxation operations. IEEE Transactions on Systems, Man, and Cybernetics, 6(6):420-433, June 1976.
24. D. Schlesinger. Structurelle Ansätze für die Stereoreconstruction. PhD thesis, Technische Universität Dresden, Fakultät Informatik, Institut für Künstliche Intelligenz, July 2005. In German.
25. M.I. Schlesinger. Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions). Kibernetika, 4:113-130, 1976. In Russian.
26. M.I. Schlesinger and B. Flach. Some solvable sublcasses of structural recognition problems. In Czech Pattern Recognition Workshop. Czech Pattern Recognition Society, 2000.
27. M.I. Schlesinger and V. Hlaváč. Ten Lectures on Statistical and Structural Pattern Recognition. Kluwer Academic Publishers, 2002.
28. B. Schölkopf, C. Burges, and V. Vapnik. Extracting support data for a given task. In U.M. Fayyad and R. Uthurusamy, editors, International Conference on Knowledge Discovery & Data Mining. AAAI Press, Menlo Park, 1995.
29. B. Taskar, V. Chatalbashev, and D. Koller. Learning associative markov networks. In International Conference on Machine Learning. ACM Press, New York, 2004a.
30. B. Taskar, C. Guestrin, and D. Koller. Maximum-margin markov networks. In Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2004b.
31. B. Taskar, S. Lacoste-Jullien, and M.I. Jordan. Structured prediction, dual extragradient and bregman projections. Journal of Machine Learning Research, 7:1627-1653, Jul. 2006.
32. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484, Sep. 2005.
33. V. Vapnik. Statistical Learning Theory. John Wiley & Sons, Inc., 1998.
34. M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on hypertrees: message passing and linear programming approaches. In Conference on Communication, Control and Computing, 2002.
35. T. Werner. A linear programming approach to max-sum problem: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7): 1165-1179, July 2007.
36. T. Werner. A linear programming approach to max-sum problem: A review. Research Report CTU-CMP-2005-25, Center for Machine Perception, K13133 FEE Czech Technical University, Prague, Czech Republic, December 2005.
37. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7):2282-2312, 2005.