IDEAS home Printed from https://ideas.repec.org/a/spr/jagbes/v30y2025i3d10.1007_s13253-024-00622-0.html
   My bibliography  Save this article

Using Density and Fuzzy Clustering for Data Cleaning and Segmental Description of Livestock Data

Author

Listed:
  • Torgunn Aslaug Skjerve

    (Norwegian University of Life sciences)

  • Gunnar Klemetsdal

    (Norwegian University of Life sciences)

  • Bente Aspeholen Åby

    (Norwegian University of Life sciences)

  • Jon Kristian Sommerseth

    (TINE SA, BTB-NMBU)

  • Ulf Geir Indahl

    (Norwegian University of Life Sciences)

  • Hanne Fjerdingby Olsen

    (Norwegian University of Life sciences)

Abstract

The cluster algorithms density-based clustering with noise and fuzzy c-means were used to edit and group a large, noisy data set from a livestock herd recording scheme consisting of slaughter records on 73,743 bulls. Density-based clustering with noise was used for data selection with $$\epsilon =0.06$$ ϵ = 0.06 and minPts $$=$$ = 8. The remaining data ( $${n} = 65{,}446$$ n = 65 , 446 ) was exposed to a fuzzy c-means analysis to partition data based on three variables: Age at slaughter, carcass weight, and average daily carcass gain. Appropriate number of clusters was chosen by the maximum value of the modified partition coefficient ( $${k} = 3$$ k = 3 clusters). Cluster validation for both hard cluster assignment and cluster membership was performed with linear models and a permutation test. The three clusters had centroid values for slaughter age and carcass weight interpreted as: Part of production systems characterized by high bull turnover (Cluster 1), production systems aiming for heavy slaughter weights (Cluster 2), and a less intensive system with higher roughage proportions (Cluster 3). The results show that the approach can be successfully combined to segment meaningful groups from large, noisy industry data, exemplified by the description of slaughter performance records. Supplementary materials accompanying this paper appear online.

Suggested Citation

  • Torgunn Aslaug Skjerve & Gunnar Klemetsdal & Bente Aspeholen Åby & Jon Kristian Sommerseth & Ulf Geir Indahl & Hanne Fjerdingby Olsen, 2025. "Using Density and Fuzzy Clustering for Data Cleaning and Segmental Description of Livestock Data," Journal of Agricultural, Biological and Environmental Statistics, Springer;The International Biometric Society;American Statistical Association, vol. 30(3), pages 870-885, September.
  • Handle: RePEc:spr:jagbes:v:30:y:2025:i:3:d:10.1007_s13253-024-00622-0
    DOI: 10.1007/s13253-024-00622-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13253-024-00622-0
    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/s13253-024-00622-0?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Mayra Z Rodriguez & Cesar H Comin & Dalcimar Casanova & Odemir M Bruno & Diego R Amancio & Luciano da F Costa & Francisco A Rodrigues, 2019. "Clustering algorithms: A comparative approach," PLOS ONE, Public Library of Science, vol. 14(1), pages 1-34, January.
    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. Fernandez Martinez, Roberto & Lostado Lorza, Ruben & Santos Delgado, Ana Alexandra & Piedra, Nelson, 2021. "Use of classification trees and rule-based models to optimize the funding assignment to research projects: A case study of UTPL," Journal of Informetrics, Elsevier, vol. 15(1).
    2. Polina Bombina & Dwayne Tally & Zachary B Abrams & Kevin R Coombes, 2024. "SillyPutty: Improved clustering by optimizing the silhouette width," PLOS ONE, Public Library of Science, vol. 19(6), pages 1-17, June.
    3. Narjes Vara & Mahdieh Mirzabeigi & Hajar Sotudeh & Seyed Mostafa Fakhrahmad, 2022. "Application of k-means clustering algorithm to improve effectiveness of the results recommended by journal recommender system," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(6), pages 3237-3252, June.
    4. Théophile Carniel & José Halloy & Jean-Michel Dalle, 2023. "A novel clustering approach to bipartite investor-startup networks," PLOS ONE, Public Library of Science, vol. 18(1), pages 1-20, January.
    5. Alfred Kume & Stephen G Walker, 2021. "The utility of clusters and a Hungarian clustering algorithm," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-23, August.
    6. Mark, Ebba & Rafaty, Ryan & Schwarz, Moritz, 2024. "Spatial–temporal dynamics of structural unemployment in declining coal mining regions and potentialities of the ‘just transition’," Energy Policy, Elsevier, vol. 195(C).
    7. Tohalino, Jorge A.V. & Amancio, Diego R., 2022. "On predicting research grants productivity via machine learning," Journal of Informetrics, Elsevier, vol. 16(2).
    8. Christian Hennig, 2022. "An empirical comparison and characterisation of nine popular clustering methods," 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. 16(1), pages 201-229, March.
    9. Hossam M J Mustafa & Masri Ayob & Mohd Zakree Ahmad Nazri & Graham Kendall, 2019. "An improved adaptive memetic differential evolution optimization algorithms for data clustering problems," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-28, May.
    10. Giovana D da Silva & Filipi N Silva & Henrique F de Arruda & Bárbara C e Souza & Luciano da F Costa & Diego R Amancio, 2024. "Using full-text content to characterize and identify best seller books: A study of early 20th-century literature," PLOS ONE, Public Library of Science, vol. 19(4), pages 1-20, April.
    11. Corrêa, Edilson A. & Marinho, Vanessa Q. & Amancio, Diego R., 2020. "Semantic flow in language networks discriminates texts by genre and publication date," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    12. Ioannis Mikrou & Nickolas S. Sapidis, 2024. "Enhancing operational research in mechatronic systems via modularization: comparative analysis of four clustering algorithms using validation indices," Operational Research, Springer, vol. 24(4), pages 1-44, December.
    13. Ebba Mark & Ryan Rafaty & Moritz Schwarz, 2022. "Spatial-temporal dynamics of employment shocks in declining coal mining regions and potentialities of the 'just transition'," Papers 2211.12619, arXiv.org.
    14. Simon Crase & Suresh N Thennadil, 2022. "An analysis framework for clustering algorithm selection with applications to spectroscopy," PLOS ONE, Public Library of Science, vol. 17(3), pages 1-24, March.
    15. K. S. Sablin & E. S. Kagan & E. S. Chernova, 2020. "Clustering of the Russian coal mining regions: Investment and innovation activity," Journal of New Economy, Ural State University of Economics, vol. 21(1), pages 89-106, March.
    16. Chong, Woon Kian & Chang, Chiachi, 2024. "Information exploitation of human resource data with persistent homology," Journal of Business Research, Elsevier, vol. 172(C).
    17. Quispe, Laura V.C. & Tohalino, Jorge A.V. & Amancio, Diego R., 2021. "Using virtual edges to improve the discriminability of co-occurrence text networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 562(C).
    18. Sultan Mahmud & Ferdausi Mahojabin Sumana & Md Mohsin & Md. Hasinur Rahaman Khan, 2022. "Redefining homogeneous climate regions in Bangladesh using multivariate clustering approaches," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 111(2), pages 1863-1884, March.
    19. Yerbury, Luke W. & Campello, Ricardo J.G.B. & Livingston Jr, G.C. & Goldsworthy, Mark & O’Neil, Lachlan, 2025. "Comparing clustering approaches for smart meter time series: Investigating the influence of dataset properties on performance," Applied Energy, Elsevier, vol. 391(C).
    20. Mikhail Kanevski, 2021. "Unsupervised learning of Swiss population spatial distribution," PLOS ONE, Public Library of Science, vol. 16(2), pages 1-24, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:jagbes:v:30:y:2025:i:3:d:10.1007_s13253-024-00622-0. 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.