Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Classif

Search In Journal Title:

Abbravation: Journal of Classification

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s10853-005-4996-7

Search In DOI:

ISSN

1432-1343

Search In ISSN:
Search In Title Of Papers:

An Exact Algorithm for the TwoMode Emphasis Type

Authors: Michael J Brusco Patrick Doreian
Publish Date: 2015/09/26
Volume: 32, Issue: 3, Pages: 481-515
PDF Link

Abstract

Twomode partitioning applications are increasingly common in the physical and social sciences with a variety of models and methods spanning these applications Twomode KLmeans partitioning TMKLMP is one type of twomode partitioning model with a conceptual appeal that stems largely from the fact that it is a generalization of the ubiquitous onemode Kmeans clustering problem A number of heuristic methods have been proposed for TMKLMP ranging from a twomode version of the Kmeans heuristic to metaheuristic approaches based on simulated annealing genetic algorithms variable neighborhood search fuzzy steps and tabu search We present an exact algorithm for TMKLMP based on branchandbound programming and demonstrate its utility for the clustering of brand switching manufacturing cell formation and journal citation data Although the proposed branchandbound algorithm does not obviate the need for approximation methods for large twomode data sets it does provide a first step in the development of methods that afford a guarantee of globallyoptimal solutions for TMKLMP


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: