Combinatorial optimization in data mining

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter presents data mining techniques that are formulated as combinatorial optimization problems together with their applications. There are a number of cases where fundamental data mining tool is not combinatorial in nature, yet widely used special-purpose combinatorial extensions exist. For the sake of completeness, these fundamental tools are also discussed in detail before the extensions with underlying combinatorial optimization problems. A number of computationally challenging data mining algorithms that have non-convex formulations are also explored.

Cite

CITATION STYLE

APA

Saedi, S., & Kundakcioglu, O. E. (2013). Combinatorial optimization in data mining. In Handbook of Combinatorial Optimization (Vol. 1–5, pp. 595–630). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free