Non-hierarchical clustering with masloc

doi:10.1016/0031-3203(83)90055-9

Pattern Recognition

Volume 16, Issue 5, 1983, Pages 507-516

https://doi.org/10.1016/0031-3203(83)90055-9 Get rights and content

Abstract

MASLOC is a cluster analysis technique based on the p-median model of location theory, which permits for each value of p, clustering the given objects into p groups, each provided with a representative object. Both an exact and heuristic method are described, along with their application range. The interesting values for p are then determined, along with the more interesting clusters, by robustness analysis. The paper includes a description of a computer program for MASLOC and some of the applications it was used for.

References (10)

H. De Clercq et al.
The selection of representative substances by operations research techniques
J. Chromat.
(1976)
H.D. Vinod
Integer programming and the theory of grouping
J. Am. statist. Ass.
(1969)
A.H. Land et al.
An automatic method of solving discrete programming problems
Econometrica
(1960)
P. Hansen
Programmes mathématiques en variables 0–1
L. Kaufman
La localisation des entrepôts
Belg. Tijdschr. Statist. Inf. Op. Ond.
(1971)

There are more references available in the full text version of this article.

Cited by (22)

The role of chemometrics in improving clinical data analysis and diagnostics
2024, TrAC - Trends in Analytical Chemistry
In recent years, due to the significant development of instrumental techniques, clinical research has acquired many interesting tools and analytical platforms that can support the development of advanced diagnostic methods. Nevertheless, along with these attractive instrument possibilities and the pressure to implement the complementary descriptions of biological systems, there is a need for rational research planning and the effective analysis of complex experimental data, which aims to assess research hypotheses, create logical rules and expert systems that support the diagnostic process, and respects the environment by developing greener analysis methods. These aspects are addressed when appropriate chemometric methods are applied in the research process. This article aims to show when and how this can be done.
Revisiting agglomerative clustering
2022, Physica A: Statistical Mechanics and its Applications
Citation Excerpt :
Since then, a variety of new forms of hierarchical clustering has been proposed as well as applied with different ends [15]. In [16], the authors propose an exact and a heuristic clustering methods. They also proposed a general robustness analysis of each method to select the most relevant clusters.
Hierarchical agglomerative methods stand out as particularly effective and popular approaches for clustering data. Yet, these methods have not been systematically compared regarding the important issue of false positives while searching for clusters. A model of clusters involving a higher density nucleus surrounded by a transition, followed by outliers is adopted as a means to quantify the relevance of the obtained clusters and address the problem of false positives. Six traditional methodologies, namely the single, average, median, complete, centroid and Ward’s linkage criteria are compared with respect to the adopted model. Unimodal and bimodal datasets obeying uniform, gaussian, exponential and power-law distributions are considered for this comparison. The obtained results include the verification that many methods detect two clusters in unimodal data. The single-linkage method was found to be more resilient to false positives. Also, several methods detected clusters not corresponding directly to the nucleus.
Free to choose: Promoting conservation by relaxing outdoor watering restrictions
2014, Journal of Economic Behavior and Organization
Many water utilities use outdoor watering restrictions based on assigned weekly watering days to promote conservation and delay costly capacity expansions. We find that such policies can lead to unintended consequences – customers who adhere to the prescribed schedule use more water than those following a more flexible irrigation pattern. For our application to residential watering in a high-desert environment, this “rigidity penalty” is robust to an exogenous policy change that allowed an additional watering day per week. Our findings contribute to the growing literature on leakage effects of regulatory policies. In our case inefficiencies arise as policies limit the extent to which agents can temporally re-allocate actions.
Cluster analysis
1998, Data Handling in Science and Technology
On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasiblity and comparison
1993, Analytica Chimica Acta
A novel approach to the problem of k-medoid clustering of large data sets is presented, using a genetic algorithm. Genetic algorithms comprise a family of optimization methods based loosely upon principles of natural evolution. They have proven to be especially suited to tackle complex, large-scale optimization problems efficiently, including a rapidly growing variety of problems of practical utility. Our pilot study lays emphasis on the feasiblity of GCA — our genetic algorithm for k-medoid clustering of large datasets — and provides some background information to elucidate differences with traditional approaches. The experimental part of this study is done on the basis of artificial data sets and includes a comparison with CLARA — another approach to k-medoid clustering of large data sets, introduced recently. Results indicate that GCA accomplishes a better sampling of the combinatorial search space.
Set partition by globally optimized cluster seed points
1991, European Journal of Operational Research

View all citing articles on Scopus

View full text

Non-hierarchical clustering with masloc

Abstract

J. Chromat.

Integer programming and the theory of grouping

J. Am. statist. Ass.

An automatic method of solving discrete programming problems

Econometrica

Programmes mathématiques en variables 0–1

La localisation des entrepôts

Belg. Tijdschr. Statist. Inf. Op. Ond.