Journal of Classification

1984 - 2025

Current editor(s): Douglas Steinley

From:
Springer
The Classification Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 3, issue 2, 1986

Foreword: Comparison and consensus of classifications pp. 183-185

William Day

On the use of ordered sets in problems of comparison and consensus of classifications pp. 187-224

Jean-Pierre Barthélemy, Bruno Leclerc and Bernard Monjardet

On lattice consensus methods pp. 225-255

Dean Neumann and Victor Norton

Comparison of classifications using measures intermediate between metric dissimilarity and consensus similarity pp. 257-280

Daniel Faith and Lee Belbin

Clustering and isolation in the consensus problem for partitions pp. 281-297

Dean Neumann and Victor Norton

N-trees as nestings: Complexity, similarity, and consensus pp. 299-317

Edward Adams

s-Consensus index method: An additional axiom pp. 319-327

Ralph Stinebrickner

The median procedure for n-trees pp. 329-334

Jean-Pierre Barthélemy and F. McMorris

Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves pp. 335-348

Gordon Ad

Tree enumeration modulo a consensus pp. 349-356

Mariana Constantinescu and David Sankoff

Volume 3, issue 1, 1986

Metric and Euclidean properties of dissimilarity coefficients pp. 5-48

J. Gower and P. Legendre

Two classes of element-wise transformations preserving the psd nature of coefficient matrices pp. 49-53

Frits Zegers

Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete pp. 55-60

Mirko Křivánek

Aggregation of equivalence relations pp. 61-65

Peter Fishburn and Ariel Rubinstein

The minimal rank correlation, subject to order restrictions, with application to the weighted linear choice model pp. 67-95

Paul Green and Abba Krieger

A special Jackknife for Multidimensional Scaling pp. 97-112

Jan Leeuw and Jacqueline Meulman

A hierarchical approach to multigroup factorial invariance pp. 113-134

Stephen Bieber

Book reviews pp. 135-173

Frank Critchley, Lawrence Jones, Hubert Feger, Tapas Sen, David Swofford, Arthur Kendall, Frank Critchley, William Day, Gilbert Saporta, George Estabrook, John Sonquist and Charles Jones

Volume 2, issue 1, 1985

Optimal algorithms for comparing trees with labeled leaves pp. 7-28

William Day

Evolutionary and psychological effects in pre-evolutionary classifications pp. 29-39

Eric Holman

Buyer similarity measures in conjoint analysis: Some alternative proposals pp. 41-61

Paul Green and Abba Krieger

Statistical theory in clustering pp. 63-76

J. Hartigan

On some significance tests in cluster analysis pp. 77-108

H. Bock

The mixture method of clustering applied to three-way data pp. 109-125

Kaye Basford and Geoffrey McLachlan

Book reviews pp. 133-137

Glenn Milligan

Book reviews pp. 139-143

Herman Friedman and Richard Dubes

Book reviews pp. 145-150

Morris Goodman and Jan Leeuw

Numerical classification of proximity data with assignment measures pp. 157-172

Michael Windham

Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm pp. 173-192

Geert Soete, Wayne DeSarbo and J. Carroll

Comparing partitions pp. 193-218

Lawrence Hubert and Phipps Arabie

Cluster analysis of dyad distributions in networks pp. 219-238

Ove Frank, Henryka Komańska and Keith Widaman

Investigation of proportional link linkage clustering methods pp. 239-254

William Day and Herbert Edelsbrunner

Obtaining common pruned trees pp. 255-276

C. Finden and A. Gordon

Book reviews pp. 277-299

W. Krzanowski, Gregory Cermak, Jan Leeuw, Fionn Murtagh, Peter Bryant, Bernard Monjardet and Chikio Hayashi

On some significance tests in cluster analysis pp. 300-300

Bock H.H.

Volume 1, issue 1, 1984

Efficient algorithms for agglomerative hierarchical clustering methods pp. 7-24

William Day and Herbert Edelsbrunner

The representation of three-way proximity data by single and multiple tree structure models pp. 25-74

J. Carroll, Linda Clark and Wayne DeSarbo

Unclassed matrix shading and optimal ordering in hierarchical cluster analysis pp. 75-92

Nathan Gale, William Halperin and C. Costanzo

A computationally efficient approximation to the nearest neighbor interchange metric pp. 93-124

Edward Brown and William Day

A note on Cohen's profile similarity coefficientr c pp. 125-131

Sampo Paunonen

Book reviews pp. 133-138

Carl Finkbeiner, Roger Blashfield and Roberta Isleib

GENFOLD2: A set of models and algorithms for the general UnFOLDing analysis of preference/dominance data pp. 147-186

Wayne DeSarbo and Vithala Rao

The generation of random, binary unordered trees pp. 187-233

George Furnas

Ultrametric tree representations of incomplete dissimilarity data pp. 235-242

Geert Soete

On the null distribution of distance between two groups, using mixed continuous and categorical variables pp. 243-253

W. Krzanowski

Asymptotic properties of univariate sample k-means clusters pp. 255-270

M. Wong

Book reviews pp. 271-288

Willem Heiser, Lawrence Hubert, Bert Green, Philip Hopke, William Day and Phipps Arabie