A representation choice problem is based on the selection of an object (or objects) called a representative (or representatives), which should at best represent a given set of objects. For solving this problem in the most of cases one defines a distance function between objects and representation choice functions (choice criteria). However, it often happens that the number of representatives is too large, what in many practical situations is not convenient for decision making processes and information management. In this paper the authors propose 3 methods for solving the problem of representatives number reduction. Some examples illustrating these methods are also included.
CITATION STYLE
Nguyen, N. T., & Danilowicz, C. (2004). Methods for reducing the number of representatives in representation choice tasks. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3029, pp. 154–163). Springer Verlag. https://doi.org/10.1007/978-3-540-24677-0_17
Mendeley helps you to discover research relevant for your work.