IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v36y2019i3d10.1007_s00357-019-09356-y.html
   My bibliography  Save this article

Editorial: Journal of Classification Vol. 36-3

Author

Listed:
  • Douglas L. Steinley

    (University of Missouri)

Abstract

No abstract is available for this item.

Suggested Citation

  • Douglas L. Steinley, 2019. "Editorial: Journal of Classification Vol. 36-3," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 393-396, October.
    • Handle: RePEc:spr:jclass:v:36:y:2019:i:3:d:10.1007_s00357-019-09356-y
    DOI: 10.1007/s00357-019-09356-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-019-09356-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-019-09356-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Douglas Steinley & Robert Henson, 2005. "OCLUS: An Analytic Method for Generating Clusters with Known Overlap," Journal of Classification, Springer;The Classification Society, vol. 22(2), pages 221-250, September.
    2. Sven Herrmann & Katharina Huber & Vincent Moulton & Andreas Spillner, 2012. "Recognizing Treelike k-Dissimilarities," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 321-340, October.
    3. Haydemar Núñez & Luis Gonzalez-Abril & Cecilio Angulo, 2017. "Improving SVM Classification on Imbalanced Datasets by Introducing a New Bias," Journal of Classification, Springer;The Classification Society, vol. 34(3), pages 427-443, October.
    4. Hans-Friedrich Köhn & Chia-Yi Chiu, 2018. "How to Build a Complete Q-Matrix for a Cognitively Diagnostic Test," Journal of Classification, Springer;The Classification Society, vol. 35(2), pages 273-299, July.
    5. Douglas Steinley & Lawrence Hubert, 2008. "Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal," Psychometrika, Springer;The Psychometric Society, vol. 73(4), pages 647-664, December.
    6. Wenxin Zhu & Yunyan Song & Yingyuan Xiao, 2018. "A New Support Vector Machine Plus with Pinball Loss," Journal of Classification, Springer;The Classification Society, vol. 35(1), pages 52-70, April.
    7. Weiliang Qiu & Harry Joe, 2006. "Generation of Random Clusters with Specified Degree of Separation," Journal of Classification, Springer;The Classification Society, vol. 23(2), pages 315-334, September.
    8. Abby Flynt & Nema Dean, 2019. "Growth Mixture Modeling with Measurement Selection," Journal of Classification, Springer;The Classification Society, vol. 36(1), pages 3-25, April.
    9. Maryam Abaszade & Sohrab Effati, 2019. "A New Method for Classifying Random Variables Based on Support Vector Machine," Journal of Classification, Springer;The Classification Society, vol. 36(1), pages 152-174, April.
    10. Glenn Milligan, 1985. "An algorithm for generating artificial test clusters," Psychometrika, Springer;The Psychometric Society, vol. 50(1), pages 123-127, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jerzy Korzeniewski, 2013. "Empirical Evaluation of OCLUS and GenRandomClust Algorithms of Generating Cluster Structures," Statistics in Transition new series, Główny Urząd Statystyczny (Polska), vol. 14(3), pages 487-494, September.
    2. Antonello Maruotti & Antonio Punzo, 2021. "Initialization of Hidden Markov and Semi‐Markov Models: A Critical Evaluation of Several Strategies," International Statistical Review, International Statistical Institute, vol. 89(3), pages 447-480, December.
    3. Félix Iglesias & Tanja Zseby & Daniel Ferreira & Arthur Zimek, 2019. "MDCGen: Multidimensional Dataset Generator for Clustering," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 599-618, October.
    4. Douglas Steinley & Michael Brusco, 2008. "Selection of Variables in Cluster Analysis: An Empirical Comparison of Eight Procedures," Psychometrika, Springer;The Psychometric Society, vol. 73(1), pages 125-144, March.
    5. Marco Riani & Andrea Cerioli & Domenico Perrotta & Francesca Torti, 2015. "Simulating mixtures of multivariate data with fixed cluster overlap in FSDA library," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 9(4), pages 461-481, December.
    6. Jeffrey Andrews & Paul McNicholas, 2014. "Variable Selection for Clustering and Classification," Journal of Classification, Springer;The Classification Society, vol. 31(2), pages 136-153, July.
    7. Douglas L. Steinley & M. J. Brusco, 2019. "Using an Iterative Reallocation Partitioning Algorithm to Verify Test Multidimensionality," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 397-413, October.
    8. Glenn Milligan & Richard Cheng, 1996. "Measuring the influence of individual data points in a cluster analysis," Journal of Classification, Springer;The Classification Society, vol. 13(2), pages 315-335, September.
    9. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    10. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    11. Glenn Milligan, 1989. "A validation study of a variable weighting algorithm for cluster analysis," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 53-71, December.
    12. Simone Calamai, 2020. "Moduli Space of Families of Positive (n − 1)-Weights," Journal of Classification, Springer;The Classification Society, vol. 37(2), pages 317-327, July.
    13. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.
    14. Chen, S. K. & Mangiameli, P. & West, D., 1995. "The comparative ability of self-organizing neural networks to define cluster structure," Omega, Elsevier, vol. 23(3), pages 271-279, June.
    15. Michio Yamamoto, 2012. "Clustering of functional data in a low-dimensional subspace," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(3), pages 219-247, October.
    16. Elena Rubei, 2016. "Weighted Graphs with Distances in Given Ranges," Journal of Classification, Springer;The Classification Society, vol. 33(2), pages 282-297, July.
    17. Joeri Hofmans & Eva Ceulemans & Douglas Steinley & Iven Mechelen, 2015. "On the Added Value of Bootstrap Analysis for K-Means Clustering," Journal of Classification, Springer;The Classification Society, vol. 32(2), pages 268-284, July.
    18. Sebastian Krey & Uwe Ligges & Friedrich Leisch, 2014. "Music and timbre segmentation by recursive constrained K-means clustering," Computational Statistics, Springer, vol. 29(1), pages 37-50, February.
    19. Shiqi Wu & Hualong Yu & Yan Gu & Changbin Shao & Shang Gao, 2024. "SNN-PDM: An Improved Probability Density Machine Algorithm Based on Shared Nearest Neighbors Clustering Technique," Journal of Classification, Springer;The Classification Society, vol. 41(2), pages 289-312, July.
    20. Alessio Farcomeni & Monia Ranalli & Sara Viviani, 2021. "Dimension reduction for longitudinal multivariate data by optimizing class separation of projected latent Markov models," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 462-480, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:36:y:2019:i:3:d:10.1007_s00357-019-09356-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.