Full-class set classification using the Hungarian algorithm

International Journal of Machine Learning and Cybernetics

Volumn 1, Issue 1-4, 2010, Pages 53-61

  Kuncheva, Ludmila I ^a  

^a BANGOR UNIVERSITY   (United Kingdom)

Author keywords

Bayes optimal classifier; Full class set classification; Label assignment problem

Indexed keywords

ASSIGNMENT ALGORITHMS; CLASSIFICATION TASKS; FULL-CLASS SET CLASSIFICATION; HUNGARIAN ALGORITHM; HUNGARIANS; MOVING OBJECTS; OPTIMAL CLASSIFIERS; OPTIMAL SOLUTIONS; REGISTRATION SYSTEMS;

ALGORITHMS;

OPTIMIZATION;

EID: 79952314979     PISSN: 18688071     EISSN: 1868808X     Source Type: Journal    
DOI: 10.1007/s13042-010-0002-z     Document Type: Article

References (19)

1. Amit Y, Trouvé A (2007) POP: patchwork of parts models for object recognition. Int J Comput Vis 75:267-282.
2. Asuncion A, Newman DJ (2007) UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences. http://www.ics.uci.edu/*mlearn/MLRepository.html.
3. Belongie S, Malik J, Puzicha J (2002) Shape matching and object recognition using shape contexts. IEEE Trans Pattern Analy Mach Intell 24:509-522.
4. Dietterich TG, Lathrop RH, Lozano-Perez T (1997) Solving the multiple-instance problem with axis-parallel rectangles. Artif Intell 89:31-71.
5. Duda RO, Hart PE, Stork DG (2001) Pattern classification, 2nd edn. Wiley, NY.
6. Fawcett T (2003) ROC graphs: notes and practical considerations for researchers. Technical Report HPL-2003-4, HP Labs, Palo Alto. http://www.hpl.hp.com/techreports/2003/HPL-2003-4.pdf.
7. Hand DJ (2006) Classifier technology and the illusion of progress (with discussion). Stat Sci 21:1-34.
8. Kaucic R, Perera AGA, Brooksby G, Kaufhold J, Hoogs A (2005) A unified framework for tracking through occlusions and across sensor gaps. In: IEEE computer society conference on computer vision and pattern recognition, CVPR, vol 1, pp 1063-1069.
9. Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83-97.
10. Kuncheva LI (2002) A theoretical study on expert fusion strategies. IEEE Trans Pattern Anal Mach Intell 24(2):281-286.
11. Mangasarian OL, Wild EW (2008) Multiple instance classification via successive linear programming. J Optim Theory Appl 137:555-568.
12. McDowell LK, Gupta KM, Aha DW (2007) Cautious inference in collective classification. In: Processdings of AAAI, pp 596-601.
13. Ning X, Karypis G (2009) The set classification problem and solution methods. In: Proceedings of SIAM data mining, pp 847-858.
14. Provost F, Domingos P (2003) Tree induction for probabilitybased ranking. Mach Learn 52(3):199-215.
15. Ripley BD (1996) Pattern recognition and neural networks. University Press, Cambridge.
16. Sen P, Namata G, Bilgic M, Getoor L, Gallagher B, Eliassi-Rad T (2008) Collective classification in network data. AI Magazine 29:93-106.
17. Wang J, Zucker J-Dl (2000) Solving the multiple-instance problem: a lazy learning approach. In: Proceedings 17th international conference on machine learning, pp 1119-1125.
18. Zadrozny B, Elkan C (2001) Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In: Proceedings of the eighteenth international conference on machine learning (ICML'01), pp 609-616.
19. Zadrozny B, Elkan C (2002) Transforming classifier scores into accurate multiclass probability estimates. In: Proceedings of the 8th international conference on knowledge discovery and data mining (KDD'02).