Mixed integer linear programming and heuristic methods for feature selection in clustering
This paper studies the problem of selecting relevant features in clustering problems, out of a data-set in which many features are useless, or masking. The data-set comprises a set U of units, a set V of features, a set R of (tentative) cluster centres and distances dijk for every i ∈ U, k ∈ R, j ∈...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor and Francis Ltd.
2018
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |