IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v30y2013i3p428-452.html
   My bibliography  Save this article

Model Similarity and Rank-Order Based Classification of Bayesian Networks

Author

Listed:
  • Sung-Ho Kim
  • Geonyoup Noh

Abstract

Suppose that we rank-order the conditional probabilities for a group of subjects that are provided from a Bayesian network (BN) model of binary variables. The conditional probability is the probability that a subject has a certain attribute given an outcome of some other variables and the classification is based on the rank-order. Under the condition that the class sizes are equal across the class levels and that all the variables in the model are positively associated with each other, we compared the classification results between models of binary variables which share the same model structure. In the comparison, we used a BN model, called a similar BN model, which was constructed under some rule based on a set of BN models satisfying certain conditions. Simulation results indicate that the agreement level of the classification between a set of BN models and their corresponding similar BN model is considerably high with the exact agreement for about half of the subjects or more and the agreement up to one-class-level difference for about 90% or more. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Sung-Ho Kim & Geonyoup Noh, 2013. "Model Similarity and Rank-Order Based Classification of Bayesian Networks," Journal of Classification, Springer;The Classification Society, vol. 30(3), pages 428-452, October.
    • Handle: RePEc:spr:jclass:v:30:y:2013:i:3:p:428-452
    DOI: 10.1007/s00357-013-9140-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00357-013-9140-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00357-013-9140-9?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. H. Messatfa, 1992. "An algorithm to maximize the agreement between partitions," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 5-15, January.
    2. Kim, Sung-Ho, 2002. "Calibrated initials for an EM applied to recursive models of categorical variables," Computational Statistics & Data Analysis, Elsevier, vol. 40(1), pages 97-110, July.
    3. Ahmed N. Albatineh & Magdalena Niewiadomska-Bugaj & Daniel Mihalko, 2006. "On Similarity Indices and Correction for Chance Agreement," Journal of Classification, Springer;The Classification Society, vol. 23(2), pages 301-313, September.
    4. Robert Mislevy, 1994. "Evidence and inference in educational assessment," Psychometrika, Springer;The Psychometric Society, vol. 59(4), pages 439-483, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Doyeob Kim & Sung-Ho Kim, 2020. "A Short Note on Improvement of Agreement Rate," Journal of Classification, Springer;The Classification Society, vol. 37(3), pages 550-557, October.

    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. José E. Chacón, 2021. "Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 257-263, July.
    2. José E. Chacón & Ana I. Rastrojo, 2023. "Minimum adjusted Rand index for two clusterings of a given size," 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. 17(1), pages 125-133, March.
    3. Kim, Seong-Ho & Kim, Sung-Ho, 2006. "A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data," Computational Statistics & Data Analysis, Elsevier, vol. 50(3), pages 611-641, February.
    4. Douglas Steinley & Gretchen Hendrickson & Michael Brusco, 2015. "A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties," Journal of Classification, Springer;The Classification Society, vol. 32(1), pages 114-126, April.
    5. Michael Brusco & Douglas Steinley, 2008. "A Binary Integer Program to Maximize the Agreement Between Partitions," Journal of Classification, Springer;The Classification Society, vol. 25(2), pages 185-193, November.
    6. Stefano Tonellato & Andrea Pastore, 2013. "On the comparison of model-based clustering solutions," Working Papers 2013:05, Department of Economics, University of Venice "Ca' Foscari".
    7. Theresa Ullmann & Anna Beer & Maximilian Hünemörder & Thomas Seidl & Anne-Laure Boulesteix, 2023. "Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study," 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. 17(1), pages 211-238, March.
    8. Martina Sundqvist & Julien Chiquet & Guillem Rigaill, 2023. "Adjusting the adjusted Rand Index," Computational Statistics, Springer, vol. 38(1), pages 327-347, March.
    9. Doyeob Kim & Sung-Ho Kim, 2020. "A Short Note on Improvement of Agreement Rate," Journal of Classification, Springer;The Classification Society, vol. 37(3), pages 550-557, October.
    10. Daniel Segall, 2001. "General ability measurement: An application of multidimensional item response theory," Psychometrika, Springer;The Psychometric Society, vol. 66(1), pages 79-97, March.
    11. Matthijs J. Warrens & Alexandra de Raadt, 2015. "Ordering Properties of the First Eigenvector of Certain Similarity Matrices," Journal of Mathematics, Hindawi, vol. 2015, pages 1-5, November.
    12. Matthijs Warrens, 2008. "On the Equivalence of Cohen’s Kappa and the Hubert-Arabie Adjusted Rand Index," Journal of Classification, Springer;The Classification Society, vol. 25(2), pages 177-183, November.
    13. Antonio D’Ambrosio & Sonia Amodio & Carmela Iorio & Giuseppe Pandolfo & Roberta Siciliano, 2021. "Adjusted Concordance Index: an Extensionl of the Adjusted Rand Index to Fuzzy Partitions," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 112-128, April.
    14. Matthijs J. Warrens, 2014. "New Interpretations of Cohen’s Kappa," Journal of Mathematics, Hindawi, vol. 2014, pages 1-9, September.
    15. Matthijs Warrens, 2008. "On Association Coefficients for 2×2 Tables and Properties That Do Not Depend on the Marginal Distributions," Psychometrika, Springer;The Psychometric Society, vol. 73(4), pages 777-789, December.
    16. Matthijs Warrens, 2009. "On Robinsonian dissimilarities, the consecutive ones property and latent variable models," 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. 3(2), pages 169-184, September.
    17. Matthijs Warrens, 2008. "On Similarity Coefficients for 2×2 Tables and Correction for Chance," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 487-502, September.
    18. Ana Severiano & João A Carriço & D Ashley Robinson & Mário Ramirez & Francisco R Pinto, 2011. "Evaluation of Jackknife and Bootstrap for Defining Confidence Intervals for Pairwise Agreement Measures," PLOS ONE, Public Library of Science, vol. 6(5), pages 1-11, May.
    19. Valerie Robert & Yann Vasseur & Vincent Brault, 2021. "Comparing High-Dimensional Partitions with the Co-clustering Adjusted Rand Index," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 158-186, April.
    20. Johann Kraus & Christoph Müssel & Günther Palm & Hans Kestler, 2011. "Multi-objective selection for collecting cluster alternatives," Computational Statistics, Springer, vol. 26(2), pages 341-353, June.

    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:30:y:2013:i:3:p:428-452. 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.