Cost-sensitive learning with conditional Markov networks

Data Mining and Knowledge Discovery

Volumn 17, Issue 2, 2008, Pages 136-163

  Sen, Prithviraj ^a   Getoor, Lise ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

Cost sensitive learning; Machine learning; Markov networks; Structured output spaces

Indexed keywords

ACOUSTIC WAVE INTERFERENCE; CLASSIFICATION (OF INFORMATION); CLASSIFIERS; CORRELATION METHODS; COST FUNCTIONS; DECISION SUPPORT SYSTEMS; ESTIMATION; INFORMATION MANAGEMENT; LEARNING SYSTEMS; MARKOV PROCESSES; PROBABILITY; RANDOM PROCESSES; RISK PERCEPTION; SEARCH ENGINES; STANDARDS;

CONDITIONAL PROBABILITIES; CONDITIONAL RANDOM FIELDS; COST-SENSITIVE; COST-SENSITIVE CLASSIFICATION; COST-SENSITIVE LEARNING; EXPECTED COST OF MISCLASSIFICATION; FLEXIBLE MECHANISMS; GENERAL FRAMEWORK; LINK PREDICTION; LINK STRUCTURES; MACHINE LEARNING; MARKOV NETWORKS; MAXIMUM ENTROPY; MISCLASSIFICATIONS; PROBABILITY ESTIMATIONS; REAL-WORLD DATA; STRUCTURED OUTPUT SPACES;

COST BENEFIT ANALYSIS;

EID: 50549104328     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-008-0090-5     Document Type: Article

References (40)

1. Abe N, Zadrozny B, Langford J (2004) An iterative method for multiclass cost-sensitive learning. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, Seattle, WA, pp 3-11
2. Berrou C, Glavieux A, Thitimajshima P (1993) Near Shannon limit error-correcting coding and decoding: turbo codes. In: Proceedings of IEEE international conference on communications, vol 2. IEEE, Geneva, Switzerland, pp 1064-1070
3. Besag J (1986) On the statistical analysis of dirty pictures. J R Stat Soc 48: 259-302
4. Bodik P, Hong W, Guestrin C, Madden S, Paskin M, Thibaux R (2004) Intel lab dataset. http://berkeley.intel-research.net/labdata/
5. Bollobas B, Borgs C, Chayes JT, Riordan O (2003) Directed scale-free graphs. In: Proceedings of the fourteenth ACM-SIAM symposium on discrete algorithms (SODA). SIAM, Baltimore, MD, pp 132-139
6. Bradford J, Kunz C, Kohavi R, Brunk C, Brodley C (1998) Pruning decision trees with misclassification costs. In: Proceedings of the tenth European conference on machine learning. Springer-Verlag, Chemnitz, Germany, pp 131-136
7. Brefeld U, Geibel P, Wysotzki F (2003) Support vector machines with example dependent costs. In: Proceedings of the fourteenth European conference on machine learning. Springer, Cavtat-Dubrovnik, Croatia, pp 23-34
8. Chakrabarti S, Dom B, Indyk P (1998) Enhanced hypertext categorization using hyperlinks. In: Proceedings of the ACM SIGMOD international conference on management of data. ACM, Seattle, WA, pp 307-318
9. Chan P, Stolfo S (1998) Toward scalable learning with non-uniform class and cost distributions: a case study in credit card fraud detection. In: Proceedings of the fourth international conference on knowledge discovery and data mining. AAAI Press, New York, NY, pp 164-168
10. Cohn D, Hofmann T (2001) The missing link - a probabilistic model of document content and hypertext connectivity. In: Advances in neural information processing systems 13. MIT Press, Denver, CO, pp 430-436
11. Deshpande A, Guestrin C, Madden S, Hong W (2005) Exploiting correlated attributes in acquisitional query processing. In: Proceedings of the twenty-first international conference on data engineering. IEEE, Tokyo, Japan, pp 143-154
12. Domingos P (1999) MetaCost: a general method for making classifiers cost-sensitive. In: Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 155-164
13. Duda RO, Hart PE, Stork DG (2001) Pattern classification. Wiley Interscience
14. Elkan C (2001) The foundations of cost-sensitive learning. In: Proceedings of the seventeenth international joint conference on artificial intelligence. Morgan Kaufmann, Seattle, WA, pp 973-978
15. Fumera G, Roli F (2002) Cost-sensitive learning in support vector machines. In: Convegno Associazione Italiana per L'Intelligenza Artificiale
16. Geibel P, Wysotzki F (2003) Perceptron based learning with example dependent and noisy costs. In: Proceedings of the twentieth international conference on machine learning. AAAI Press, Menlo Park, CA, pp 218-225
17. Getoor L, Friedman N, Koller D, Taskar B (2002) Learning probabilistic models of link structure. J Machine Learning Res 3: 679-707
18. Hummel R, Zucker S (1983) On the foundations of relaxation labeling processes. IEEE Trans Pattern Anal Mach Intell 5(3): 267-287
19. Jaynes ET, Rosenkrantz RD (ed) (2003) E. T. Jaynes: papers on probability, statistics and statistical physics. Springer
20. Knoll U, Nakhaeizadeh G, Tausend B (1994) Cost-sensitive pruning of decision trees. In: Proceedings of the European conference on machine learning. Springer-Verlag, Catania, Italy, pp 383-386
21. Kschischang FR, Frey BJ (1998) Iterative decoding of compound codes by probability propagation in graphical models. IEEE J Sel Areas Commun 16: 219-230
22. Lafferty J, McCallum A, Pereira F (2001) Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: Proceedings of the eighteenth international conference on machine learning. Morgan Kaufmann, Williamstown, MA, pp 282-289
23. Lu Q, Getoor L (2003) Link-based classification. In: Proceedings of the twentieth international conference on machine learning. AAAI Press, Washington, DC, pp 496-503
24. McEliece RJ, MacKay DJC, Cheng JF (1998) Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE J Sel Areas Commun 16: 140-152
25. Minka T (2001) Expectation propagation for approximate bayesian inference. In: Proceedings of the seventeenth conference in uncertainty in artificial intelligence. Morgan Kaufmann, Seattle, WA, pp 362-369
26. Murphy K, Weiss Y, Jordan MI (1999) Loopy belief propagation for approximate inference: an empirical study. In: Proceedings of the fifteenth conference on uncertainty in artificial intelligence. Morgan Kaufmann, Stockholm, Sweden, pp 467-475
27. Neville J, Jensen D (2000) Iterative classification in relational data. In: AAAI workshop on learning statistical models from relational data. AAAI Press, Austin, TX, pp 13-20
28. Sen P, Getoor L (2006) Cost-sensitive learning with conditional Markov networks. In: Proceedings of the twenty-third international conference on machine learning. ACM, Pittsburgh, PA, pp 801-808
29. Singhvi V, Krause A, Guestrin C, Garrett J, Matthews HS (2005) Intelligent light control using sensor networks. In: Proceedings of the third international conference on embedded networked sensor systems. ACM, San Diego, CA, pp 218-229
30. Slattery S, Craven M (1998) Combining statistical and relational methods for learning in hypertext domains. In: Proceedings of the 8th international workshop on inductive logic programming. Springer-Verlag, Madison, WI, pp 38-52
31. Taskar B, Abbeel P, Koller D (2002) Discriminative probabilistic models for relational data. In: Proceedings of the eighteenth conference on uncertainty in artificial intelligence. Morgan Kaufmann, Edmonton, Canada, pp 485-492
32. Taskar B, Chatalbashev V, Koller D (2004a) Learning associative Markov networks. In: Proceedings of the twenty-first international conference on machine learning. ACM, Banff, Alberta, Canada, pp 807-814
33. Taskar B, Guestrin C, Koller D (2004b) Max-margin Markov networks. In: Advances in neural information processing systems 16. MIT Press, Vancouver and Whistler, British Columbia, Canada, pp 25-32
34. Tsochantaridis I, Hofmann T, Joachims T, Altun Y (2004) Support vector machine learning for interdependent and structured output spaces. In: Proceedings of the twenty-first international conference on machine learning. ACM, Banff, Alberta, Canada, pp 823-830
35. Xu L, Wilkinson D, Southey F, Schuurmans D (2006) Discriminative unsupervised learning of structured predictors. In: Proceedings of the twenty-third international conference on machine learning. ACM, Pittsburgh, PA, pp 1057-1064
36. Yedidia JS, Freeman WT, Weiss Y (2001) Generalized belief propagation. In: Advances in neural information processing systems 13. MIT Press, Denver, CO, pp 689-695
37. Yedidia JS, Freeman WT, Weiss Y (2005) Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans Inform Theory 51: 2282-2312
38. Zadrozny B, Elkan C (2001) Learning and making decisions when costs and probabilities are both unknown. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, San Francisco, CA, pp 204-213
39. Zadrozny B, Langford J, Abe N (2003) Cost-sensitive learning by cost-proportionate example weighting. In: Proceedings of the third IEEE international conference on data mining. IEEE, Melbourne, FL, pp 435-442
40. Zhang T, Oles FJ (2001) Text categorization based on regularized linear classification methods. Inform Retrieval 4: 5-31