[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/12723.html
   My bibliography  Save this paper

The most representative composite rank ordering of multi-attribute objects by the particle swarm optimization

Author

Abstract
Rank-ordering of individuals or objects on multiple criteria has many important practical applications. A reasonably representative composite rank ordering of multi-attribute objects/individuals or multi-dimensional points is often obtained by the Principal Component Analysis, although much inferior but computationally convenient methods also are frequently used. However, such rank ordering – even the one based on the Principal Component Analysis – may not be optimal. This has been demonstrated by several numerical examples. To solve this problem, the Ordinal Principal Component Analysis was suggested some time back. However, this approach cannot deal with various types of alternative schemes of rank ordering, mainly due to its dependence on the method of solution by the constrained integer programming. In this paper we propose an alternative method of solution, namely by the Particle Swarm Optimization. A computer program in FORTRAN to solve the problem has also been provided. The suggested method is notably versatile and can take care of various schemes of rank ordering, norms and types or measures of correlation. The versatility of the method and its capability to obtain the most representative composite rank ordering of multi-attribute objects or multi-dimensional points have been demonstrated by several numerical examples. It has also been found that rank ordering based on maximization of the sum of absolute values of the correlation coefficients of composite rank scores with its constituent variables has robustness, but it may have multiple optimal solutions. Thus, while it solves the one problem, it gives rise to the other problem. The overall ranking of objects by maximin correlation principle performs better if the composite rank scores are obtained by direct optimization with respect to the individual ranking scores.

Suggested Citation

  • Mishra, SK, 2009. "The most representative composite rank ordering of multi-attribute objects by the particle swarm optimization," MPRA Paper 12723, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:12723
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/12723/1/MPRA_paper_12723.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Korhonen, Pekka & Siljamaki, Aapo, 1998. "Ordinal principal component analysis theory and an application," Computational Statistics & Data Analysis, Elsevier, vol. 26(4), pages 411-424, February.
    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. Mishra, SK, 2012. "Construction of Pena’s DP2-based ordinal synthetic indicator when partial indicators are rank scores," MPRA Paper 39088, University Library of Munich, Germany.

    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. S. K. Mishra, 2010. "(Computer Algorithms) The Most Representative Composite Rank Ordering of Multi-Attribute Objects by the Particle Swarm Optimization Method," Journal of Quantitative Economics, The Indian Econometric Society, vol. 8(2), pages 165-200.
    2. Charpentier, Arthur & Mussard, Stéphane & Ouraga, Téa, 2021. "Principal component analysis: A generalized Gini approach," European Journal of Operational Research, Elsevier, vol. 294(1), pages 236-249.
    3. Tarsitano Agostino & Lombardo Rosetta, 2013. "A Coefficient of Correlation Based on Ratios of Ranks and Anti-ranks," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 233(2), pages 206-224, April.
    4. Arcagni, Alberto & Avellone, Alessandro & Fattore, Marco, 2022. "Complexity reduction and approximation of multidomain systems of partially ordered data," Computational Statistics & Data Analysis, Elsevier, vol. 173(C).
    5. Graciela Estévez-Pérez & Philippe Vieu, 2021. "A new way for ranking functional data with applications in diagnostic test," Computational Statistics, Springer, vol. 36(1), pages 127-154, March.
    6. Agostino Tarsitano & Rosetta Lombardo, 2011. "An Exhaustive Coefficient Of Rank Correlation," Working Papers 201111, Università della Calabria, Dipartimento di Economia, Statistica e Finanza "Giovanni Anania" - DESF.
    7. Mishra, SK, 2009. "A note on the ordinal canonical correlation analysis of two sets of ranking scores," MPRA Paper 12796, University Library of Munich, Germany.

    More about this item

    Keywords

    Rank ordering; standard; modified; competition; fractional; dense; ordinal; principal component; integer programming; repulsive particle swarm; maximin; absolute; correlation; FORTRAN; program;
    All these keywords.

    JEL classification:

    • C13 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - Estimation: General
    • C43 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Index Numbers and Aggregation
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C14 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - Semiparametric and Nonparametric Methods: General
    • C87 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Econometric Software
    • C45 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Neural Networks and Related Topics
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pra:mprapa:12723. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.